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/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:47:52,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:47:52,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:47:52,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:47:52,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:47:52,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:47:52,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:47:52,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:47:52,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:47:52,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:47:52,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:47:52,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:47:52,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:47:52,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:47:52,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:47:52,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:47:52,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:47:52,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:47:52,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:47:52,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:47:52,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:47:52,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:47:52,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:47:52,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:47:52,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:47:52,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:47:52,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:47:52,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:47:52,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:47:52,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:47:52,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:47:52,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:47:52,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:47:52,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:47:52,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:47:52,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:47:52,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:47:52,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:47:52,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:47:52,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:47:52,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:47:52,165 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-05 11:47:52,194 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:47:52,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:47:52,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:47:52,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:47:52,196 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:47:52,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:47:52,197 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:47:52,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:47:52,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:47:52,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:47:52,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:47:52,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:47:52,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:47:52,198 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:47:52,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:47:52,199 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:47:52,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:47:52,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:47:52,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:47:52,201 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:47:52,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:47:52,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:47:52,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:47:52,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:47:52,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:47:52,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:47:52,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:47:52,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:47:52,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:47:52,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:47:52,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:47:52,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:47:52,275 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:47:52,275 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:47:52,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-05 11:47:52,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387acc7a0/24915be5fc854968908eb6e9b3702fb2/FLAG5561794d8 [2019-09-05 11:47:52,761 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:47:52,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-05 11:47:52,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387acc7a0/24915be5fc854968908eb6e9b3702fb2/FLAG5561794d8 [2019-09-05 11:47:53,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387acc7a0/24915be5fc854968908eb6e9b3702fb2 [2019-09-05 11:47:53,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:47:53,175 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:47:53,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:47:53,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:47:53,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:47:53,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d452d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53, skipping insertion in model container [2019-09-05 11:47:53,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,190 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:47:53,205 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:47:53,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:47:53,372 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:47:53,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:47:53,407 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:47:53,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53 WrapperNode [2019-09-05 11:47:53,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:47:53,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:47:53,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:47:53,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:47:53,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (1/1) ... [2019-09-05 11:47:53,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:47:53,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:47:53,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:47:53,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:47:53,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (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-05 11:47:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:47:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:47:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:47:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:47:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:47:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:47:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:47:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:47:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:47:53,796 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:47:53,797 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:47:53,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:47:53 BoogieIcfgContainer [2019-09-05 11:47:53,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:47:53,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:47:53,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:47:53,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:47:53,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:47:53" (1/3) ... [2019-09-05 11:47:53,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d62b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:47:53, skipping insertion in model container [2019-09-05 11:47:53,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:47:53" (2/3) ... [2019-09-05 11:47:53,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d62b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:47:53, skipping insertion in model container [2019-09-05 11:47:53,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:47:53" (3/3) ... [2019-09-05 11:47:53,805 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2019-09-05 11:47:53,813 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:47:53,821 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:47:53,838 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:47:53,874 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:47:53,875 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:47:53,875 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:47:53,875 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:47:53,876 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:47:53,876 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:47:53,876 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:47:53,876 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:47:53,876 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:47:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-05 11:47:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:47:53,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:53,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:53,901 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:53,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-05 11:47:53,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:53,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:53,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:53,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:47:53,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:54,125 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-05 11:47:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:47:54,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:47:54,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:47:54,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:47:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:47:54,154 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-05 11:47:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:54,221 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-05 11:47:54,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:47:54,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 11:47:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:54,235 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:47:54,236 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 11:47:54,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:47:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 11:47:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 11:47:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 11:47:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-05 11:47:54,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-05 11:47:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:54,282 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-05 11:47:54,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:47:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-05 11:47:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 11:47:54,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:54,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:54,287 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-05 11:47:54,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:54,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:54,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:54,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:47:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:54,403 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-05 11:47:54,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:54,403 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-05 11:47:54,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:47:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:54,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:47:54,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:47:54,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:54,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:47:54,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:47:54,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:47:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:47:54,513 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-05 11:47:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:54,532 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-05 11:47:54,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:47:54,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-05 11:47:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:54,534 INFO L225 Difference]: With dead ends: 18 [2019-09-05 11:47:54,534 INFO L226 Difference]: Without dead ends: 13 [2019-09-05 11:47:54,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:47:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-05 11:47:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-05 11:47:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 11:47:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-05 11:47:54,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-05 11:47:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:54,540 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-05 11:47:54,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:47:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-05 11:47:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:47:54,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:54,542 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:54,542 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-05 11:47:54,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:54,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:54,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:47:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:54,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:54,652 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-05 11:47:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:47:54,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:47:54,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:54,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:47:54,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:54,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:54,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:47:54,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:47:54,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:47:54,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:47:54,716 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-05 11:47:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:54,762 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-05 11:47:54,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:47:54,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-05 11:47:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:54,765 INFO L225 Difference]: With dead ends: 19 [2019-09-05 11:47:54,765 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 11:47:54,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:47:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 11:47:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 11:47:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 11:47:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-05 11:47:54,775 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-05 11:47:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:54,775 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-05 11:47:54,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:47:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-05 11:47:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:47:54,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:54,776 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:54,776 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-05 11:47:54,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:54,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:54,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:54,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:54,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:47:54,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:47:54,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:47:54,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:54,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:47:54,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:54,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:54,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:47:54,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:47:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:47:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:47:54,967 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-05 11:47:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:55,019 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-05 11:47:55,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:47:55,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-05 11:47:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:55,021 INFO L225 Difference]: With dead ends: 20 [2019-09-05 11:47:55,021 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 11:47:55,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:47:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 11:47:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 11:47:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 11:47:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-05 11:47:55,032 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-05 11:47:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:55,033 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-05 11:47:55,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:47:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-05 11:47:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:47:55,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:55,034 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:55,034 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-05 11:47:55,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:55,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:55,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:55,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:55,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:55,156 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-05 11:47:55,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:47:55,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:47:55,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:55,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:47:55,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:47:55,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:47:55,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:47:55,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:47:55,226 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-05 11:47:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:55,293 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-05 11:47:55,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:47:55,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-05 11:47:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:55,295 INFO L225 Difference]: With dead ends: 21 [2019-09-05 11:47:55,295 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 11:47:55,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:47:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 11:47:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 11:47:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 11:47:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-05 11:47:55,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-05 11:47:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:55,303 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-05 11:47:55,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:47:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-05 11:47:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:47:55,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:55,305 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:55,306 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-05 11:47:55,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:55,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:55,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:55,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:55,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:55,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 11:47:55,479 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:47:55,494 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:47:55,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:55,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:47:55,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:55,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:55,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:47:55,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:47:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:47:55,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:47:55,536 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-05 11:47:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:55,590 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-05 11:47:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:47:55,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-05 11:47:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:55,592 INFO L225 Difference]: With dead ends: 22 [2019-09-05 11:47:55,592 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 11:47:55,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:47:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 11:47:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 11:47:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:47:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-05 11:47:55,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-05 11:47:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:55,597 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-05 11:47:55,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:47:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-05 11:47:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:47:55,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:55,598 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:55,598 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-05 11:47:55,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:55,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:55,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:55,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:55,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:55,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:55,758 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-05 11:47:55,771 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:47:55,786 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-05 11:47:55,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:55,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:47:55,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:55,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:55,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:47:55,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:47:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:47:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:47:55,819 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-05 11:47:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:55,881 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-05 11:47:55,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:47:55,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-05 11:47:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:55,883 INFO L225 Difference]: With dead ends: 23 [2019-09-05 11:47:55,883 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:47:55,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:47:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:47:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 11:47:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 11:47:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-05 11:47:55,890 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-05 11:47:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:55,892 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-05 11:47:55,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:47:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-05 11:47:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:47:55,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:55,893 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:55,893 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-05 11:47:55,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:55,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:55,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:56,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:56,054 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-05 11:47:56,069 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-05 11:47:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:56,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:47:56,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:56,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:56,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:47:56,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:47:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:47:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:47:56,115 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-05 11:47:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:56,193 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-05 11:47:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:47:56,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-05 11:47:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:56,194 INFO L225 Difference]: With dead ends: 24 [2019-09-05 11:47:56,195 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 11:47:56,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:47:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 11:47:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 11:47:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 11:47:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-05 11:47:56,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-05 11:47:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:56,203 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-05 11:47:56,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:47:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-05 11:47:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:47:56,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:56,204 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:56,208 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:56,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-05 11:47:56,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:56,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:56,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:47:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:56,356 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-05 11:47:56,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:56,357 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-05 11:47:56,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:47:56,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:47:56,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:56,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:47:56,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:56,414 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-05 11:47:56,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:56,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-05 11:47:56,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:47:56,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:47:56,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:47:56,419 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-05 11:47:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:56,524 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-05 11:47:56,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:47:56,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-05 11:47:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:56,525 INFO L225 Difference]: With dead ends: 25 [2019-09-05 11:47:56,525 INFO L226 Difference]: Without dead ends: 20 [2019-09-05 11:47:56,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:47:56,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-05 11:47:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-05 11:47:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 11:47:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-05 11:47:56,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-05 11:47:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:56,531 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-05 11:47:56,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:47:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-05 11:47:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:47:56,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:56,532 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:56,532 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:56,532 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-05 11:47:56,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:56,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:56,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:56,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:56,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:56,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:47:56,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:47:56,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:47:56,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:56,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:47:56,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:56,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:56,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-05 11:47:56,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:47:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:47:56,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:47:56,792 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-05 11:47:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:56,897 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-05 11:47:56,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:47:56,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-05 11:47:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:56,898 INFO L225 Difference]: With dead ends: 26 [2019-09-05 11:47:56,899 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 11:47:56,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:47:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 11:47:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 11:47:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 11:47:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-05 11:47:56,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-05 11:47:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:56,903 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-05 11:47:56,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:47:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-05 11:47:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:47:56,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:56,904 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:56,905 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-05 11:47:56,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:56,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:56,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:57,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:57,066 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-05 11:47:57,080 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-05 11:47:57,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:47:57,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:57,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:47:57,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:57,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:47:57,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:47:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:47:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:47:57,129 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-05 11:47:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:57,225 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-05 11:47:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:47:57,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-05 11:47:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:57,226 INFO L225 Difference]: With dead ends: 27 [2019-09-05 11:47:57,227 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:47:57,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:47:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:47:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 11:47:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:47:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-05 11:47:57,231 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-05 11:47:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:57,232 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-05 11:47:57,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:47:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-05 11:47:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:47:57,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:57,233 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:57,233 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-05 11:47:57,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:57,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:57,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:57,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:57,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:47:57,428 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:48:13,888 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:48:13,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:14,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:48:14,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:14,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:14,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-05 11:48:14,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:48:14,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:48:14,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:48:14,167 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-05 11:48:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:14,289 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-05 11:48:14,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:48:14,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-05 11:48:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:14,295 INFO L225 Difference]: With dead ends: 28 [2019-09-05 11:48:14,295 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:48:14,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:48:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:48:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 11:48:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 11:48:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-05 11:48:14,300 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-05 11:48:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:14,300 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-05 11:48:14,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:48:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-05 11:48:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:48:14,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:14,302 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:14,302 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-05 11:48:14,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:14,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:14,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:14,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:14,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:14,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:48:14,523 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:48:26,847 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:48:26,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:26,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:48:26,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:26,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:26,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-05 11:48:26,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:48:26,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:48:26,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:48:26,882 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-05 11:48:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:27,006 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-05 11:48:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:48:27,008 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-05 11:48:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:27,009 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:48:27,009 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 11:48:27,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:48:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 11:48:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 11:48:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:48:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-05 11:48:27,014 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-05 11:48:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:27,014 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-05 11:48:27,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:48:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-05 11:48:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:48:27,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:27,017 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:27,017 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-05 11:48:27,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:27,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:27,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:27,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:27,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:27,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:27,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:48:27,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:48:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:27,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:48:27,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:27,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:27,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:48:27,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:48:27,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:48:27,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:48:27,306 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-05 11:48:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:27,454 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-05 11:48:27,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:48:27,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-05 11:48:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:27,455 INFO L225 Difference]: With dead ends: 30 [2019-09-05 11:48:27,455 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:48:27,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:48:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:48:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 11:48:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:48:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-05 11:48:27,460 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-05 11:48:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:27,460 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-05 11:48:27,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:48:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-05 11:48:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:48:27,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:27,461 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:27,461 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-05 11:48:27,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:27,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:27,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:48:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:27,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:27,700 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-05 11:48:27,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:48:27,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:48:27,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:27,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:48:27,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:27,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:27,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-05 11:48:27,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:48:27,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:48:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:48:27,801 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-05 11:48:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:27,981 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-05 11:48:27,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:48:27,983 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-05 11:48:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:27,983 INFO L225 Difference]: With dead ends: 31 [2019-09-05 11:48:27,983 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 11:48:27,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:48:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 11:48:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-05 11:48:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:48:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-05 11:48:27,990 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-05 11:48:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:27,990 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-05 11:48:27,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:48:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-05 11:48:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:48:27,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:27,992 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:27,992 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-05 11:48:27,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:27,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:27,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:28,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:28,244 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-05 11:48:28,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:48:29,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:48:29,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:29,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:48:29,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:29,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:29,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-05 11:48:29,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:48:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:48:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:48:29,930 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-05 11:48:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:30,127 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-05 11:48:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:48:30,128 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-05 11:48:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:30,129 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:48:30,129 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:48:30,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:48:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:48:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 11:48:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:48:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-05 11:48:30,134 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-05 11:48:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:30,134 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-05 11:48:30,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:48:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-05 11:48:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:48:30,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:30,136 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:30,136 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-05 11:48:30,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:30,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:30,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:30,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:30,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:48:30,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:48:30,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:48:30,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:48:30,415 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:48:30,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:48:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:30,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:48:30,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:48:30,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:48:30,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:48:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:48:30,451 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-05 11:48:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:48:30,713 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-05 11:48:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:48:30,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-05 11:48:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:48:30,714 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:48:30,714 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 11:48:30,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:48:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 11:48:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-05 11:48:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 11:48:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-05 11:48:30,718 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-05 11:48:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:48:30,718 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-05 11:48:30,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:48:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-05 11:48:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 11:48:30,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:48:30,721 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:48:30,721 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:48:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:48:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-05 11:48:30,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:48:30,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:48:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:30,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:48:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:48:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:48:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:48:31,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:48:31,015 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-05 11:48:31,026 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:49:21,416 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-05 11:49:21,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:21,720 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:49:21,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:21,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:21,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-05 11:49:21,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:49:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:49:21,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:49:21,774 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-05 11:49:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:21,967 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-05 11:49:21,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:49:21,968 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-05 11:49:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:21,968 INFO L225 Difference]: With dead ends: 34 [2019-09-05 11:49:21,968 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:49:21,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:49:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:49:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 11:49:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:49:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-05 11:49:21,973 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-05 11:49:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:21,973 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-05 11:49:21,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:49:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-05 11:49:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:49:21,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:21,974 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:21,974 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:21,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-05 11:49:21,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:21,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:21,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:21,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:22,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:22,285 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) [2019-09-05 11:49:22,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:37,560 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-05 11:49:37,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:37,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:49:37,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:37,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:37,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-05 11:49:37,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:49:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:49:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:49:37,626 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-05 11:49:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:37,885 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-05 11:49:37,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:49:37,886 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-05 11:49:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:37,886 INFO L225 Difference]: With dead ends: 35 [2019-09-05 11:49:37,886 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 11:49:37,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:49:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 11:49:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-05 11:49:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:49:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-05 11:49:37,892 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-05 11:49:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:37,892 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-05 11:49:37,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:49:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-05 11:49:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:49:37,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:37,893 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:37,893 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-05 11:49:37,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:37,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:37,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:37,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:37,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:38,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:38,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:49:38,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:38,221 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:49:38,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:38,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:38,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:49:38,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:49:38,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:49:38,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:49:38,266 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-05 11:49:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:38,540 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-05 11:49:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:49:38,540 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-05 11:49:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:38,541 INFO L225 Difference]: With dead ends: 36 [2019-09-05 11:49:38,541 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:49:38,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:49:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:49:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 11:49:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:49:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-05 11:49:38,547 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-05 11:49:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:38,547 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-05 11:49:38,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:49:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-05 11:49:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:49:38,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:38,548 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:38,548 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-05 11:49:38,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:38,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:38,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:49:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:38,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:38,919 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) [2019-09-05 11:49:38,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:38,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:49:38,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:38,960 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:49:38,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:39,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:39,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-05 11:49:39,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:49:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:49:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:49:39,027 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-05 11:49:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:39,331 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-05 11:49:39,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:49:39,331 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-05 11:49:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:39,332 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:49:39,332 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:49:39,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:49:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:49:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-05 11:49:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:49:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-05 11:49:39,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-05 11:49:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:39,338 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-05 11:49:39,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:49:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-05 11:49:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:49:39,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:39,342 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:39,342 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:39,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:39,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-05 11:49:39,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:39,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:39,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:39,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:39,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:39,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:39,710 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-05 11:49:39,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:49:57,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 11:49:57,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:57,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:49:57,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:57,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:57,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-05 11:49:57,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:49:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:49:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:49:57,416 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-05 11:49:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:57,730 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-05 11:49:57,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:49:57,736 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-05 11:49:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:57,737 INFO L225 Difference]: With dead ends: 38 [2019-09-05 11:49:57,737 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:49:57,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:49:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:49:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 11:49:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:49:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 11:49:57,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-05 11:49:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:57,741 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 11:49:57,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:49:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 11:49:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:49:57,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:57,742 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:57,743 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-05 11:49:57,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:57,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:57,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:58,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:58,231 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) [2019-09-05 11:49:58,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:58,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:49:58,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:49:58,262 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:49:58,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:49:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:58,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:49:58,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-05 11:49:58,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:49:58,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:49:58,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:49:58,309 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-05 11:49:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:49:58,617 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-05 11:49:58,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:49:58,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-05 11:49:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:49:58,618 INFO L225 Difference]: With dead ends: 39 [2019-09-05 11:49:58,618 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:49:58,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:49:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:49:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-05 11:49:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:49:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-05 11:49:58,627 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-05 11:49:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:49:58,630 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-05 11:49:58,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:49:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-05 11:49:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 11:49:58,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:49:58,631 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:49:58,632 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:49:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:49:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-05 11:49:58,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:49:58,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:49:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:58,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:49:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:49:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:49:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:49:59,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:49:59,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:49:59,081 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:51:48,197 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-05 11:51:48,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:51:49,768 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:51:49,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:49,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:49,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-05 11:51:49,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:51:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:51:49,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:51:49,825 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-05 11:51:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:50,196 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-05 11:51:50,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:51:50,196 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-05 11:51:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:50,197 INFO L225 Difference]: With dead ends: 40 [2019-09-05 11:51:50,197 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 11:51:50,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:51:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 11:51:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 11:51:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:51:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-05 11:51:50,201 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-05 11:51:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:50,201 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-05 11:51:50,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:51:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-05 11:51:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:51:50,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:50,202 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:50,202 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:50,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-05 11:51:50,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:50,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:50,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:51:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:50,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:50,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 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-05 11:51:50,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:53:08,878 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:53:08,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:53:16,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:53:16,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-09-05 11:53:16,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:53:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:53:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:53:16,401 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 27 states. [2019-09-05 11:53:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:53:16,733 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-05 11:53:16,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:53:16,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-09-05 11:53:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:53:16,735 INFO L225 Difference]: With dead ends: 41 [2019-09-05 11:53:16,735 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 11:53:16,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:53:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 11:53:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-05 11:53:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 11:53:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-05 11:53:16,739 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-05 11:53:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:53:16,740 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-05 11:53:16,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:53:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-05 11:53:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 11:53:16,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:53:16,740 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:53:16,740 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:53:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:53:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-05 11:53:16,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:53:16,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:53:16,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:16,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:53:16,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:17,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:53:17,199 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-05 11:53:17,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:53:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:17,227 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 11:53:17,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:53:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:17,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:53:17,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-05 11:53:17,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:53:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:53:17,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:53:17,272 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-05 11:53:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:53:17,722 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-05 11:53:17,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:53:17,727 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-05 11:53:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:53:17,728 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:53:17,728 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:53:17,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:53:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:53:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 11:53:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:53:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-05 11:53:17,732 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-05 11:53:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:53:17,732 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-05 11:53:17,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:53:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-05 11:53:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:53:17,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:53:17,733 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:53:17,733 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:53:17,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:53:17,733 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-05 11:53:17,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:53:17,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:53:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:17,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:53:17,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:18,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:53:18,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 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-05 11:53:18,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:53:18,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:53:18,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:53:18,421 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 11:53:18,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:53:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:18,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:53:18,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-05 11:53:18,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:53:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:53:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:53:18,508 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-05 11:53:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:53:18,956 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-05 11:53:18,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:53:18,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-05 11:53:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:53:18,958 INFO L225 Difference]: With dead ends: 43 [2019-09-05 11:53:18,958 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 11:53:18,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:53:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 11:53:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-05 11:53:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 11:53:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-05 11:53:18,963 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-05 11:53:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:53:18,963 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-05 11:53:18,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:53:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-05 11:53:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:53:18,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:53:18,964 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:53:18,964 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:53:18,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:53:18,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-05 11:53:18,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:53:18,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:53:18,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:18,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:53:18,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:19,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:53:19,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:53:19,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:54:30,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 11:54:30,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:30,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 11:54:30,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:30,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:30,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-05 11:54:30,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:54:30,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:54:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:54:30,349 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-05 11:54:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:30,859 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-05 11:54:30,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:54:30,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-05 11:54:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:30,860 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:54:30,860 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:54:30,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:54:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:54:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-05 11:54:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:54:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-05 11:54:30,864 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-05 11:54:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:30,864 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-05 11:54:30,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:54:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-05 11:54:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:54:30,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:30,865 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:30,865 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:30,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-05 11:54:30,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:30,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:30,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:30,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:30,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:31,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:31,505 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-05 11:54:31,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:54:31,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:54:31,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:54:31,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 11:54:31,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:54:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:31,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:54:31,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-05 11:54:31,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:54:31,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:54:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:54:31,588 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-05 11:54:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:54:32,122 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 11:54:32,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:54:32,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-05 11:54:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:54:32,123 INFO L225 Difference]: With dead ends: 45 [2019-09-05 11:54:32,123 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 11:54:32,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:54:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 11:54:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-05 11:54:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:54:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-05 11:54:32,127 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-05 11:54:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:54:32,128 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-05 11:54:32,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:54:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-05 11:54:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:54:32,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:54:32,128 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:54:32,129 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:54:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:54:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-05 11:54:32,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:54:32,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:54:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:32,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:54:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:54:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:54:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:54:32,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:54:32,729 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) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:54:32,739 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:57:52,197 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-05 11:57:52,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:57:52,646 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 11:57:52,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:57:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:57:52,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:57:52,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-05 11:57:52,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:57:52,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:57:52,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:57:52,730 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-05 11:57:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:53,281 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-05 11:57:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:57:53,281 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-05 11:57:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:53,282 INFO L225 Difference]: With dead ends: 46 [2019-09-05 11:57:53,282 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 11:57:53,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:57:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 11:57:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 11:57:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:57:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-05 11:57:53,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-05 11:57:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:53,286 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-05 11:57:53,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:57:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-05 11:57:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:57:53,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:53,287 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:53,287 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:53,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:53,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-05 11:57:53,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:53,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:53,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:53,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:57:53,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:57:53,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:57:53,958 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-05 11:57:53,967 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:59:12,496 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-05 11:59:12,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:12,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-05 11:59:12,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:13,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:13,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-05 11:59:13,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:59:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:59:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:59:13,055 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-05 11:59:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:13,672 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-05 11:59:13,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:59:13,672 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-05 11:59:13,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:13,673 INFO L225 Difference]: With dead ends: 47 [2019-09-05 11:59:13,673 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:59:13,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:59:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:59:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-05 11:59:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 11:59:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-05 11:59:13,677 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-05 11:59:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:13,677 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-05 11:59:13,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:59:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-05 11:59:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:59:13,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:13,678 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:13,678 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-05 11:59:13,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:13,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:13,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:13,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:13,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:14,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:14,485 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-05 11:59:14,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:14,519 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 11:59:14,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:14,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:14,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-05 11:59:14,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:59:14,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:59:14,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:59:14,565 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-05 11:59:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:15,233 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-05 11:59:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:59:15,238 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-05 11:59:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:15,238 INFO L225 Difference]: With dead ends: 48 [2019-09-05 11:59:15,238 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 11:59:15,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:59:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 11:59:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 11:59:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 11:59:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-05 11:59:15,244 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-05 11:59:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:15,244 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-05 11:59:15,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:59:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-05 11:59:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 11:59:15,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:15,245 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:15,245 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-05 11:59:15,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:15,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:15,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:15,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:15,891 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-05 11:59:15,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:15,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:15,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:15,922 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-05 11:59:15,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:15,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:15,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-05 11:59:15,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:59:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:59:15,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:59:15,974 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-05 11:59:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:16,637 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-05 11:59:16,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:59:16,637 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-05 11:59:16,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:16,637 INFO L225 Difference]: With dead ends: 49 [2019-09-05 11:59:16,638 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 11:59:16,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:59:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 11:59:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 11:59:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 11:59:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-05 11:59:16,642 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-05 11:59:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:16,642 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-05 11:59:16,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:59:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-05 11:59:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 11:59:16,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:16,643 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:16,643 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:16,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-05 11:59:16,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:16,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:16,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:17,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:17,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:17,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:50,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 11:59:50,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:50,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-05 11:59:50,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:50,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:50,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-05 11:59:50,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 11:59:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 11:59:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:59:50,152 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-05 11:59:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:50,876 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-05 11:59:50,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 11:59:50,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-05 11:59:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:50,877 INFO L225 Difference]: With dead ends: 50 [2019-09-05 11:59:50,877 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 11:59:50,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:59:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 11:59:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-05 11:59:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 11:59:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-05 11:59:50,883 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-05 11:59:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:50,883 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-05 11:59:50,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 11:59:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-05 11:59:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:59:50,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:50,884 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:50,884 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:50,885 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-05 11:59:50,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:50,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:50,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:50,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:51,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:51,576 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-05 11:59:51,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:51,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:51,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:51,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 11:59:51,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:51,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:51,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-05 11:59:51,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:59:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:59:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:59:51,672 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-05 11:59:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:52,456 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-05 11:59:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:59:52,456 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-05 11:59:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:52,457 INFO L225 Difference]: With dead ends: 51 [2019-09-05 11:59:52,457 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 11:59:52,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:59:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 11:59:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-05 11:59:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 11:59:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-05 11:59:52,462 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-05 11:59:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:52,462 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-05 11:59:52,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:59:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-05 11:59:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-05 11:59:52,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:52,463 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:52,463 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-05 11:59:52,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:52,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:52,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:52,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:53,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:53,328 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) [2019-09-05 11:59:53,348 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000