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/array-examples/standard_copy1_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 09:30:03,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 09:30:03,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 09:30:03,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 09:30:03,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 09:30:03,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 09:30:03,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 09:30:03,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 09:30:03,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 09:30:03,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 09:30:03,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 09:30:03,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 09:30:03,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 09:30:03,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 09:30:03,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 09:30:03,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 09:30:03,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 09:30:03,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 09:30:03,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 09:30:03,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 09:30:03,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 09:30:03,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 09:30:03,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 09:30:03,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 09:30:03,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 09:30:03,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 09:30:03,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 09:30:03,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 09:30:03,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 09:30:03,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 09:30:03,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 09:30:03,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 09:30:03,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 09:30:03,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 09:30:03,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 09:30:03,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 09:30:03,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 09:30:03,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 09:30:03,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 09:30:03,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 09:30:03,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 09:30:03,267 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-07 09:30:03,292 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 09:30:03,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 09:30:03,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 09:30:03,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 09:30:03,295 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 09:30:03,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 09:30:03,296 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 09:30:03,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 09:30:03,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 09:30:03,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 09:30:03,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 09:30:03,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 09:30:03,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 09:30:03,298 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 09:30:03,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 09:30:03,299 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 09:30:03,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 09:30:03,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 09:30:03,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 09:30:03,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 09:30:03,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 09:30:03,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:30:03,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 09:30:03,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 09:30:03,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 09:30:03,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 09:30:03,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 09:30:03,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 09:30:03,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 09:30:03,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 09:30:03,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 09:30:03,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 09:30:03,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 09:30:03,382 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 09:30:03,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_ground-2.i [2019-09-07 09:30:03,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22514515/f8b3fbce5cd84d909a2bf9e3e4bfa931/FLAG95343b6a7 [2019-09-07 09:30:03,924 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 09:30:03,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_ground-2.i [2019-09-07 09:30:03,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22514515/f8b3fbce5cd84d909a2bf9e3e4bfa931/FLAG95343b6a7 [2019-09-07 09:30:04,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22514515/f8b3fbce5cd84d909a2bf9e3e4bfa931 [2019-09-07 09:30:04,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 09:30:04,323 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 09:30:04,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 09:30:04,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 09:30:04,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 09:30:04,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af94a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04, skipping insertion in model container [2019-09-07 09:30:04,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 09:30:04,354 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 09:30:04,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:30:04,529 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 09:30:04,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:30:04,570 INFO L192 MainTranslator]: Completed translation [2019-09-07 09:30:04,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04 WrapperNode [2019-09-07 09:30:04,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 09:30:04,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 09:30:04,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 09:30:04,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 09:30:04,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (1/1) ... [2019-09-07 09:30:04,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 09:30:04,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 09:30:04,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 09:30:04,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 09:30:04,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (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-07 09:30:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 09:30:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 09:30:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 09:30:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 09:30:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 09:30:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 09:30:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 09:30:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 09:30:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 09:30:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 09:30:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 09:30:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 09:30:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 09:30:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 09:30:04,982 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 09:30:04,983 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 09:30:04,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:30:04 BoogieIcfgContainer [2019-09-07 09:30:04,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 09:30:04,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 09:30:04,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 09:30:05,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 09:30:05,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:30:04" (1/3) ... [2019-09-07 09:30:05,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8c269c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:30:05, skipping insertion in model container [2019-09-07 09:30:05,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:30:04" (2/3) ... [2019-09-07 09:30:05,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8c269c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:30:05, skipping insertion in model container [2019-09-07 09:30:05,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:30:04" (3/3) ... [2019-09-07 09:30:05,009 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy1_ground-2.i [2019-09-07 09:30:05,034 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 09:30:05,046 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 09:30:05,071 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 09:30:05,122 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 09:30:05,123 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 09:30:05,123 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 09:30:05,124 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 09:30:05,124 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 09:30:05,124 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 09:30:05,124 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 09:30:05,125 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 09:30:05,125 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 09:30:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-07 09:30:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 09:30:05,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:05,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:05,167 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-09-07 09:30:05,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:05,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:05,316 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-07 09:30:05,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:30:05,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 09:30:05,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 09:30:05,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 09:30:05,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:30:05,335 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-07 09:30:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:05,356 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-09-07 09:30:05,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 09:30:05,357 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 09:30:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:05,364 INFO L225 Difference]: With dead ends: 46 [2019-09-07 09:30:05,365 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 09:30:05,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:30:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 09:30:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 09:30:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 09:30:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-07 09:30:05,409 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-09-07 09:30:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:05,410 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-07 09:30:05,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 09:30:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-07 09:30:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 09:30:05,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:05,411 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:05,412 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-09-07 09:30:05,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:05,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:05,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:05,484 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-07 09:30:05,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:30:05,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:30:05,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:30:05,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:30:05,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:30:05,487 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-09-07 09:30:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:05,513 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-07 09:30:05,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:30:05,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 09:30:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:05,517 INFO L225 Difference]: With dead ends: 38 [2019-09-07 09:30:05,517 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 09:30:05,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:30:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 09:30:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-07 09:30:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 09:30:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-07 09:30:05,528 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-09-07 09:30:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:05,528 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-07 09:30:05,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:30:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-07 09:30:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 09:30:05,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:05,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:05,529 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:05,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1578997828, now seen corresponding path program 1 times [2019-09-07 09:30:05,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:05,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:05,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:30:05,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:30:05,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:30:05,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:30:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:30:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:30:05,585 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-09-07 09:30:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:05,607 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-09-07 09:30:05,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:30:05,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 09:30:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:05,609 INFO L225 Difference]: With dead ends: 36 [2019-09-07 09:30:05,609 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 09:30:05,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:30:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 09:30:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-07 09:30:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 09:30:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-07 09:30:05,616 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-09-07 09:30:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:05,616 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-07 09:30:05,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:30:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-07 09:30:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 09:30:05,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:05,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:05,618 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:05,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-09-07 09:30:05,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:05,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:05,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:05,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:30:05,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:05,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 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-07 09:30:05,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:05,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 09:30:05,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream Closed [2019-09-07 09:30:05,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:05,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 09:30:05,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 09:30:05,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 09:30:05,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:30:05,832 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-09-07 09:30:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:05,870 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-09-07 09:30:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 09:30:05,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-07 09:30:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:05,872 INFO L225 Difference]: With dead ends: 42 [2019-09-07 09:30:05,872 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 09:30:05,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:30:05,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 09:30:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-07 09:30:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 09:30:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-07 09:30:05,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2019-09-07 09:30:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:05,879 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-07 09:30:05,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 09:30:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-07 09:30:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 09:30:05,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:05,881 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:05,881 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:05,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:05,883 INFO L82 PathProgramCache]: Analyzing trace with hash 64185792, now seen corresponding path program 2 times [2019-09-07 09:30:05,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:05,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:05,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:05,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:30:05,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:05,976 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-07 09:30:05,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:30:06,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:30:06,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:06,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 09:30:06,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:30:06,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:06,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 09:30:06,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:30:06,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:30:06,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:30:06,090 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2019-09-07 09:30:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:06,154 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-09-07 09:30:06,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 09:30:06,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-09-07 09:30:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:06,156 INFO L225 Difference]: With dead ends: 47 [2019-09-07 09:30:06,156 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 09:30:06,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:30:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 09:30:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-07 09:30:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 09:30:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-07 09:30:06,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2019-09-07 09:30:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:06,164 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-07 09:30:06,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:30:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-07 09:30:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 09:30:06,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:06,165 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:06,166 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash 683083068, now seen corresponding path program 3 times [2019-09-07 09:30:06,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:06,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:30:06,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:06,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:06,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:30:06,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:30:06,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:06,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 09:30:06,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:30:06,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:06,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 09:30:06,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:30:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:30:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:30:06,326 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2019-09-07 09:30:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:06,364 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-09-07 09:30:06,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 09:30:06,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-07 09:30:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:06,370 INFO L225 Difference]: With dead ends: 44 [2019-09-07 09:30:06,370 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 09:30:06,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:30:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 09:30:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-07 09:30:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 09:30:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-07 09:30:06,385 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2019-09-07 09:30:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:06,386 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-07 09:30:06,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:30:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-07 09:30:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 09:30:06,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:06,390 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:06,390 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 4 times [2019-09-07 09:30:06,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:30:06,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:06,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:06,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:06,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:30:06,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:06,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:30:06,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:30:06,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 09:30:06,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:30:06,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:30:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:30:06,600 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2019-09-07 09:30:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:06,649 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-09-07 09:30:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:30:06,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-07 09:30:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:06,650 INFO L225 Difference]: With dead ends: 54 [2019-09-07 09:30:06,651 INFO L226 Difference]: Without dead ends: 35 [2019-09-07 09:30:06,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:30:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-07 09:30:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-07 09:30:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-07 09:30:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-07 09:30:06,657 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2019-09-07 09:30:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:06,657 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-07 09:30:06,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:30:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-07 09:30:06,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 09:30:06,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:06,659 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:06,659 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1626114376, now seen corresponding path program 5 times [2019-09-07 09:30:06,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:06,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:06,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:30:06,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:06,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:06,756 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:06,808 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 09:30:06,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:06,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:30:06,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:30:06,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:06,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 09:30:06,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:30:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:30:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:30:06,842 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 7 states. [2019-09-07 09:30:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:06,867 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-09-07 09:30:06,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:30:06,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-09-07 09:30:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:06,872 INFO L225 Difference]: With dead ends: 48 [2019-09-07 09:30:06,872 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 09:30:06,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:30:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 09:30:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-07 09:30:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-07 09:30:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-07 09:30:06,879 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2019-09-07 09:30:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:06,879 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-07 09:30:06,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:30:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-07 09:30:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 09:30:06,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:06,881 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:06,881 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash 702132246, now seen corresponding path program 6 times [2019-09-07 09:30:06,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:06,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:30:06,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:06,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:07,016 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 09:30:07,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:07,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 09:30:07,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:30:07,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:07,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-07 09:30:07,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 09:30:07,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 09:30:07,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:30:07,093 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 12 states. [2019-09-07 09:30:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:07,179 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-09-07 09:30:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:30:07,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-09-07 09:30:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:07,182 INFO L225 Difference]: With dead ends: 63 [2019-09-07 09:30:07,182 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 09:30:07,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:30:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 09:30:07,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-07 09:30:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 09:30:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-07 09:30:07,198 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2019-09-07 09:30:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:07,198 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-07 09:30:07,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 09:30:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-07 09:30:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 09:30:07,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:07,200 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:07,200 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash -294189934, now seen corresponding path program 7 times [2019-09-07 09:30:07,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:07,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:07,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:07,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:07,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:30:07,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:07,333 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:07,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:07,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 09:30:07,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:30:07,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:07,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 09:30:07,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 09:30:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 09:30:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:30:07,420 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 9 states. [2019-09-07 09:30:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:07,463 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-09-07 09:30:07,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 09:30:07,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-09-07 09:30:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:07,464 INFO L225 Difference]: With dead ends: 66 [2019-09-07 09:30:07,464 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 09:30:07,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:30:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 09:30:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-07 09:30:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 09:30:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-07 09:30:07,470 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 35 [2019-09-07 09:30:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:07,471 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-07 09:30:07,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 09:30:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-07 09:30:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 09:30:07,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:07,472 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:07,472 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 551735216, now seen corresponding path program 8 times [2019-09-07 09:30:07,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:07,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:07,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:07,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:07,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 09:30:07,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:07,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:07,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:07,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:30:07,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:07,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 09:30:07,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:30:07,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:07,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 09:30:07,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:30:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:30:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:30:07,754 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 15 states. [2019-09-07 09:30:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:07,838 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-09-07 09:30:07,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:30:07,838 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-09-07 09:30:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:07,839 INFO L225 Difference]: With dead ends: 71 [2019-09-07 09:30:07,839 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 09:30:07,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:30:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 09:30:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-07 09:30:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 09:30:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-07 09:30:07,849 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 37 [2019-09-07 09:30:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:07,849 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-07 09:30:07,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:30:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-07 09:30:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 09:30:07,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:07,851 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:07,851 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1469335764, now seen corresponding path program 9 times [2019-09-07 09:30:07,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:07,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:07,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:07,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:07,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 09:30:07,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:07,924 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-07 09:30:07,951 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-07 09:30:08,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 09:30:08,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:08,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 09:30:08,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 09:30:08,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:08,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 09:30:08,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 09:30:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 09:30:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:30:08,041 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 10 states. [2019-09-07 09:30:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:08,074 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-09-07 09:30:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 09:30:08,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-09-07 09:30:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:08,075 INFO L225 Difference]: With dead ends: 60 [2019-09-07 09:30:08,076 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 09:30:08,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:30:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 09:30:08,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-07 09:30:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 09:30:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-07 09:30:08,084 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2019-09-07 09:30:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:08,084 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-07 09:30:08,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 09:30:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-07 09:30:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 09:30:08,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:08,085 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:08,085 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1042523018, now seen corresponding path program 10 times [2019-09-07 09:30:08,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:08,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:08,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 09:30:08,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:08,172 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-07 09:30:08,186 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-07 09:30:08,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:30:08,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:08,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 09:30:08,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 09:30:08,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:08,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 09:30:08,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 09:30:08,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 09:30:08,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 09:30:08,263 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 11 states. [2019-09-07 09:30:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:08,315 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-09-07 09:30:08,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 09:30:08,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-09-07 09:30:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:08,316 INFO L225 Difference]: With dead ends: 78 [2019-09-07 09:30:08,316 INFO L226 Difference]: Without dead ends: 51 [2019-09-07 09:30:08,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 09:30:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-07 09:30:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-07 09:30:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 09:30:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-07 09:30:08,325 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2019-09-07 09:30:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:08,326 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-07 09:30:08,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 09:30:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-07 09:30:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 09:30:08,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:08,333 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:08,333 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2040098984, now seen corresponding path program 11 times [2019-09-07 09:30:08,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:08,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:08,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:08,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 09:30:08,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:08,432 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-07 09:30:08,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:30:08,751 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-07 09:30:08,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:08,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:30:08,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 09:30:08,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:08,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 09:30:08,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:30:08,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:30:08,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:30:08,931 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 19 states. [2019-09-07 09:30:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:09,027 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-09-07 09:30:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:30:09,028 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-09-07 09:30:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:09,029 INFO L225 Difference]: With dead ends: 83 [2019-09-07 09:30:09,030 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 09:30:09,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:30:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 09:30:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-09-07 09:30:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 09:30:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-09-07 09:30:09,047 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 45 [2019-09-07 09:30:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:09,047 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-09-07 09:30:09,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:30:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-09-07 09:30:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 09:30:09,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:09,053 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:09,053 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1043790884, now seen corresponding path program 12 times [2019-09-07 09:30:09,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:09,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:09,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:09,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:09,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 09:30:09,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:09,181 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-07 09:30:09,201 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-07 09:30:09,401 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 09:30:09,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:09,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:30:09,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 09:30:09,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:09,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 09:30:09,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:30:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:30:09,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:30:09,568 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 21 states. [2019-09-07 09:30:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:09,677 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-09-07 09:30:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:30:09,678 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-09-07 09:30:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:09,679 INFO L225 Difference]: With dead ends: 89 [2019-09-07 09:30:09,679 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 09:30:09,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:30:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 09:30:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-09-07 09:30:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 09:30:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-07 09:30:09,685 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 49 [2019-09-07 09:30:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:09,685 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-07 09:30:09,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:30:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-07 09:30:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 09:30:09,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:09,687 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:09,687 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1316005472, now seen corresponding path program 13 times [2019-09-07 09:30:09,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:09,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:09,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:09,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:09,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 09:30:09,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:09,784 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-07 09:30:09,802 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-07 09:30:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:09,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 09:30:09,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 09:30:10,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:10,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-07 09:30:10,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 09:30:10,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 09:30:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:30:10,082 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 23 states. [2019-09-07 09:30:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:10,202 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-09-07 09:30:10,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 09:30:10,206 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-09-07 09:30:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:10,206 INFO L225 Difference]: With dead ends: 95 [2019-09-07 09:30:10,206 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 09:30:10,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:30:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 09:30:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-09-07 09:30:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 09:30:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-07 09:30:10,216 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 53 [2019-09-07 09:30:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:10,216 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-07 09:30:10,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 09:30:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-07 09:30:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 09:30:10,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:10,218 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:10,218 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:10,219 INFO L82 PathProgramCache]: Analyzing trace with hash 544049436, now seen corresponding path program 14 times [2019-09-07 09:30:10,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:10,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:10,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:10,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:10,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 09:30:10,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:10,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:10,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:10,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:30:10,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:10,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:30:10,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 09:30:10,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:10,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 09:30:10,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:30:10,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:30:10,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:30:10,645 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 25 states. [2019-09-07 09:30:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:10,749 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-09-07 09:30:10,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:30:10,749 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2019-09-07 09:30:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:10,750 INFO L225 Difference]: With dead ends: 101 [2019-09-07 09:30:10,750 INFO L226 Difference]: Without dead ends: 68 [2019-09-07 09:30:10,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:30:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-07 09:30:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-09-07 09:30:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 09:30:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-07 09:30:10,767 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 57 [2019-09-07 09:30:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:10,767 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-07 09:30:10,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:30:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-07 09:30:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 09:30:10,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:10,772 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:10,772 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:10,772 INFO L82 PathProgramCache]: Analyzing trace with hash -384005480, now seen corresponding path program 15 times [2019-09-07 09:30:10,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:10,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:10,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:10,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:10,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 09:30:10,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:10,916 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-07 09:30:10,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:30:12,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 09:30:12,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:12,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:30:12,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:30:12,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:12,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 09:30:12,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:30:12,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:30:12,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:30:12,243 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 15 states. [2019-09-07 09:30:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:12,291 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-09-07 09:30:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 09:30:12,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-09-07 09:30:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:12,292 INFO L225 Difference]: With dead ends: 80 [2019-09-07 09:30:12,292 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 09:30:12,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:30:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 09:30:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-07 09:30:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 09:30:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-07 09:30:12,306 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 61 [2019-09-07 09:30:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:12,306 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-07 09:30:12,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:30:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-07 09:30:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 09:30:12,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:12,307 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:12,308 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash 367873014, now seen corresponding path program 16 times [2019-09-07 09:30:12,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:12,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:12,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 09:30:12,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:12,455 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-07 09:30:12,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:30:12,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:30:12,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:12,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:30:12,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 09:30:12,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:12,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 09:30:12,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 09:30:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 09:30:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:30:12,567 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 16 states. [2019-09-07 09:30:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:12,640 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-09-07 09:30:12,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:30:12,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-09-07 09:30:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:12,643 INFO L225 Difference]: With dead ends: 108 [2019-09-07 09:30:12,643 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 09:30:12,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:30:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 09:30:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-07 09:30:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-07 09:30:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-09-07 09:30:12,653 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-09-07 09:30:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:12,653 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-09-07 09:30:12,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 09:30:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-09-07 09:30:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 09:30:12,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:12,655 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:12,655 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:12,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:12,656 INFO L82 PathProgramCache]: Analyzing trace with hash -77111788, now seen corresponding path program 17 times [2019-09-07 09:30:12,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:12,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:12,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 09:30:12,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:12,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:12,888 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:13,815 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 09:30:13,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:13,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:30:13,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:30:13,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:13,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 09:30:13,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 09:30:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 09:30:13,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:30:13,874 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 16 states. [2019-09-07 09:30:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:13,929 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2019-09-07 09:30:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:30:13,930 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-09-07 09:30:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:13,931 INFO L225 Difference]: With dead ends: 84 [2019-09-07 09:30:13,932 INFO L226 Difference]: Without dead ends: 73 [2019-09-07 09:30:13,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:30:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-07 09:30:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-09-07 09:30:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 09:30:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-07 09:30:13,938 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 65 [2019-09-07 09:30:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:13,941 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-07 09:30:13,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 09:30:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-07 09:30:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 09:30:13,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:13,942 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:13,942 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1060032398, now seen corresponding path program 18 times [2019-09-07 09:30:13,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:13,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:13,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:13,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:13,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 09:30:14,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:14,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:14,166 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:30:17,913 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-07 09:30:17,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:17,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 09:30:17,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 09:30:18,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:18,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-09-07 09:30:18,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:30:18,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:30:18,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:30:18,202 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 30 states. [2019-09-07 09:30:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:18,314 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-09-07 09:30:18,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:30:18,316 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-09-07 09:30:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:18,317 INFO L225 Difference]: With dead ends: 117 [2019-09-07 09:30:18,317 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 09:30:18,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:30:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 09:30:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-07 09:30:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 09:30:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-07 09:30:18,325 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 67 [2019-09-07 09:30:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:18,326 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-07 09:30:18,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:30:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-07 09:30:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 09:30:18,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:18,327 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:18,327 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:18,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1741723922, now seen corresponding path program 19 times [2019-09-07 09:30:18,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:18,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:18,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:18,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 09:30:18,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:18,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:18,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:18,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 09:30:18,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:30:18,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:18,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 09:30:18,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 09:30:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 09:30:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:30:18,596 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 18 states. [2019-09-07 09:30:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:18,666 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-09-07 09:30:18,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 09:30:18,671 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2019-09-07 09:30:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:18,671 INFO L225 Difference]: With dead ends: 120 [2019-09-07 09:30:18,672 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 09:30:18,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:30:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 09:30:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-07 09:30:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 09:30:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-07 09:30:18,679 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2019-09-07 09:30:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:18,679 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-07 09:30:18,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 09:30:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-07 09:30:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:30:18,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:18,682 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:18,682 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:18,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:18,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1820558580, now seen corresponding path program 20 times [2019-09-07 09:30:18,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:18,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:18,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:18,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:18,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 09:30:18,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:18,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:18,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:30:18,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:30:18,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:18,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:30:18,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 09:30:19,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:19,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 09:30:19,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 09:30:19,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 09:30:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:30:19,294 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 33 states. [2019-09-07 09:30:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:19,428 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-09-07 09:30:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:30:19,429 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2019-09-07 09:30:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:19,430 INFO L225 Difference]: With dead ends: 125 [2019-09-07 09:30:19,430 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 09:30:19,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:30:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 09:30:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-09-07 09:30:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 09:30:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-09-07 09:30:19,436 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 73 [2019-09-07 09:30:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:19,436 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-09-07 09:30:19,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 09:30:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-09-07 09:30:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 09:30:19,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:19,438 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:19,439 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1348256904, now seen corresponding path program 21 times [2019-09-07 09:30:19,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:19,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:19,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 09:30:19,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:19,662 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-07 09:30:19,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:30:24,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-07 09:30:24,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:24,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:30:24,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 09:30:24,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:24,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 09:30:24,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:30:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:30:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:30:24,565 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 19 states. [2019-09-07 09:30:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:24,632 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2019-09-07 09:30:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:30:24,635 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2019-09-07 09:30:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:24,636 INFO L225 Difference]: With dead ends: 96 [2019-09-07 09:30:24,636 INFO L226 Difference]: Without dead ends: 85 [2019-09-07 09:30:24,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:30:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-07 09:30:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-07 09:30:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 09:30:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-07 09:30:24,640 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 77 [2019-09-07 09:30:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:24,640 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-07 09:30:24,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:30:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-07 09:30:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 09:30:24,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:24,642 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:24,642 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1375286810, now seen corresponding path program 22 times [2019-09-07 09:30:24,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:24,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:24,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 09:30:24,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:24,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:24,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:30:24,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:30:24,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:24,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:30:24,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 09:30:25,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:25,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-09-07 09:30:25,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 09:30:25,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 09:30:25,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:30:25,244 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 36 states. [2019-09-07 09:30:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:25,407 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-09-07 09:30:25,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 09:30:25,407 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2019-09-07 09:30:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:25,408 INFO L225 Difference]: With dead ends: 135 [2019-09-07 09:30:25,408 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 09:30:25,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:30:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 09:30:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-07 09:30:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 09:30:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-07 09:30:25,413 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 79 [2019-09-07 09:30:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:25,413 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-07 09:30:25,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 09:30:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-07 09:30:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 09:30:25,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:25,414 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:25,415 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1726613918, now seen corresponding path program 23 times [2019-09-07 09:30:25,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:25,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:25,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:25,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:25,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:30:25,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:25,670 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-07 09:30:25,681 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:30:27,923 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-07 09:30:27,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:27,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:30:27,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:30:27,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:27,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 09:30:27,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:30:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:30:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:30:27,950 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 21 states. [2019-09-07 09:30:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:28,024 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2019-09-07 09:30:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 09:30:28,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2019-09-07 09:30:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:28,028 INFO L225 Difference]: With dead ends: 138 [2019-09-07 09:30:28,029 INFO L226 Difference]: Without dead ends: 91 [2019-09-07 09:30:28,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:30:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-07 09:30:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-09-07 09:30:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-07 09:30:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-07 09:30:28,034 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 83 [2019-09-07 09:30:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:28,034 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-07 09:30:28,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:30:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-07 09:30:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 09:30:28,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:28,035 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:28,035 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash 952094080, now seen corresponding path program 24 times [2019-09-07 09:30:28,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:28,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:28,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 09:30:28,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:28,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:28,270 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:44,867 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 09:30:44,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:44,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 09:30:44,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:30:45,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:45,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 09:30:45,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:30:45,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:30:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:30:45,359 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 39 states. [2019-09-07 09:30:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:45,534 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2019-09-07 09:30:45,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 09:30:45,534 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2019-09-07 09:30:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:45,536 INFO L225 Difference]: With dead ends: 143 [2019-09-07 09:30:45,536 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 09:30:45,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:30:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 09:30:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-09-07 09:30:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-07 09:30:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-09-07 09:30:45,542 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 85 [2019-09-07 09:30:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:45,543 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-09-07 09:30:45,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:30:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-09-07 09:30:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 09:30:45,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:45,544 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:45,544 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:45,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2074571524, now seen corresponding path program 25 times [2019-09-07 09:30:45,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:45,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:45,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 09:30:46,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:46,083 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-07 09:30:46,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:46,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:30:46,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:30:46,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:46,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2019-09-07 09:30:46,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 09:30:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 09:30:46,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:30:46,484 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 41 states. [2019-09-07 09:30:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:46,661 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2019-09-07 09:30:46,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 09:30:46,662 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 89 [2019-09-07 09:30:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:46,663 INFO L225 Difference]: With dead ends: 149 [2019-09-07 09:30:46,663 INFO L226 Difference]: Without dead ends: 100 [2019-09-07 09:30:46,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:30:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-07 09:30:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-07 09:30:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 09:30:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-07 09:30:46,670 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 89 [2019-09-07 09:30:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:46,670 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-07 09:30:46,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 09:30:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-07 09:30:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 09:30:46,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:46,672 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:46,672 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1843782024, now seen corresponding path program 26 times [2019-09-07 09:30:46,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:46,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:46,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 09:30:46,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:46,929 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) [2019-09-07 09:30:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:46,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:30:46,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:46,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:30:47,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 09:30:47,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:47,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 09:30:47,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 09:30:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 09:30:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:30:47,542 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 43 states. [2019-09-07 09:30:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:47,697 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2019-09-07 09:30:47,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 09:30:47,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 93 [2019-09-07 09:30:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:47,699 INFO L225 Difference]: With dead ends: 155 [2019-09-07 09:30:47,699 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 09:30:47,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:30:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 09:30:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-09-07 09:30:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-07 09:30:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-09-07 09:30:47,707 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 93 [2019-09-07 09:30:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:47,707 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-09-07 09:30:47,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 09:30:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-09-07 09:30:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 09:30:47,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:47,708 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:47,708 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash -573603340, now seen corresponding path program 27 times [2019-09-07 09:30:47,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:47,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:47,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 09:30:47,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:47,978 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-07 09:30:47,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:30:59,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 09:30:59,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:59,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:30:59,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 09:30:59,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:59,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 09:30:59,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:30:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:30:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:30:59,785 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 24 states. [2019-09-07 09:30:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:59,850 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2019-09-07 09:30:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 09:30:59,855 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2019-09-07 09:30:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:59,856 INFO L225 Difference]: With dead ends: 116 [2019-09-07 09:30:59,856 INFO L226 Difference]: Without dead ends: 105 [2019-09-07 09:30:59,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:30:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-07 09:30:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-07 09:30:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 09:30:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-07 09:30:59,860 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 97 [2019-09-07 09:30:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:59,861 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-07 09:30:59,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:30:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-07 09:30:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 09:30:59,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:59,862 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:59,862 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:59,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1447044014, now seen corresponding path program 28 times [2019-09-07 09:30:59,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:59,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:59,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:59,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 09:31:00,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:00,136 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-07 09:31:00,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:31:00,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:31:00,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:00,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 09:31:00,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 09:31:00,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:00,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 09:31:00,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:31:00,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:31:00,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:31:00,240 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 25 states. [2019-09-07 09:31:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:00,301 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2019-09-07 09:31:00,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:31:00,303 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2019-09-07 09:31:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:00,304 INFO L225 Difference]: With dead ends: 162 [2019-09-07 09:31:00,304 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 09:31:00,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:31:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 09:31:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-07 09:31:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-07 09:31:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-09-07 09:31:00,309 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 99 [2019-09-07 09:31:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:00,309 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-09-07 09:31:00,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:31:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-09-07 09:31:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 09:31:00,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:00,310 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:00,311 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -188500112, now seen corresponding path program 29 times [2019-09-07 09:31:00,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:00,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:00,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 09:31:00,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:00,577 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-07 09:31:00,588 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:31:37,963 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 09:31:37,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:37,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:31:37,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 09:31:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-09-07 09:31:38,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 09:31:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 09:31:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:31:38,408 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 47 states. [2019-09-07 09:31:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:38,576 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2019-09-07 09:31:38,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:31:38,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 101 [2019-09-07 09:31:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:38,578 INFO L225 Difference]: With dead ends: 167 [2019-09-07 09:31:38,578 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 09:31:38,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:31:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 09:31:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-09-07 09:31:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-07 09:31:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-09-07 09:31:38,590 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 101 [2019-09-07 09:31:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:38,590 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-09-07 09:31:38,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 09:31:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-09-07 09:31:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 09:31:38,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:38,592 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:38,592 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:38,592 INFO L82 PathProgramCache]: Analyzing trace with hash -171852052, now seen corresponding path program 30 times [2019-09-07 09:31:38,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:38,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:38,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:38,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:38,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 09:31:38,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:38,918 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-07 09:31:38,930 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:32:04,716 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-09-07 09:32:04,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:04,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 09:32:04,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 09:32:05,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:05,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2019-09-07 09:32:05,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 09:32:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 09:32:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:32:05,197 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 49 states. [2019-09-07 09:32:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:05,411 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2019-09-07 09:32:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:32:05,411 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 105 [2019-09-07 09:32:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:05,412 INFO L225 Difference]: With dead ends: 173 [2019-09-07 09:32:05,412 INFO L226 Difference]: Without dead ends: 116 [2019-09-07 09:32:05,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:32:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-07 09:32:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-09-07 09:32:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-07 09:32:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-09-07 09:32:05,418 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 105 [2019-09-07 09:32:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:05,418 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-09-07 09:32:05,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 09:32:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-09-07 09:32:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 09:32:05,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:05,419 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:05,420 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash 286562408, now seen corresponding path program 31 times [2019-09-07 09:32:05,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:05,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:05,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-07 09:32:05,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:05,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 09:32:05,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:32:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:05,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:32:05,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 09:32:06,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:06,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 09:32:06,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 09:32:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 09:32:06,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 09:32:06,566 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 51 states. [2019-09-07 09:32:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:06,781 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2019-09-07 09:32:06,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 09:32:06,781 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 109 [2019-09-07 09:32:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:06,782 INFO L225 Difference]: With dead ends: 179 [2019-09-07 09:32:06,783 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 09:32:06,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 09:32:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 09:32:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-09-07 09:32:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-07 09:32:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-09-07 09:32:06,789 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 109 [2019-09-07 09:32:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:06,789 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-09-07 09:32:06,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 09:32:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-09-07 09:32:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 09:32:06,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:06,790 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:06,790 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash 143082468, now seen corresponding path program 32 times [2019-09-07 09:32:06,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:06,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:06,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:32:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 09:32:07,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:07,137 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-07 09:32:07,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:32:07,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:32:07,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:07,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 09:32:07,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-07 09:32:07,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:07,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2019-09-07 09:32:07,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 09:32:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 09:32:07,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:32:07,823 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 53 states. [2019-09-07 09:32:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:08,092 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-09-07 09:32:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 09:32:08,093 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 113 [2019-09-07 09:32:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:08,094 INFO L225 Difference]: With dead ends: 185 [2019-09-07 09:32:08,094 INFO L226 Difference]: Without dead ends: 124 [2019-09-07 09:32:08,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:32:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-07 09:32:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-09-07 09:32:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-07 09:32:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-09-07 09:32:08,103 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 113 [2019-09-07 09:32:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:08,103 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-09-07 09:32:08,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 09:32:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-09-07 09:32:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 09:32:08,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:08,106 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:08,106 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1352351392, now seen corresponding path program 33 times [2019-09-07 09:32:08,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:08,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:08,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:08,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:08,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 09:32:08,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:08,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:08,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:33:04,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-07 09:33:04,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:33:04,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 09:33:04,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:33:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 09:33:04,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:04,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 09:33:04,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 09:33:04,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 09:33:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:33:04,394 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 29 states. [2019-09-07 09:33:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:04,489 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-09-07 09:33:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 09:33:04,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 117 [2019-09-07 09:33:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:04,491 INFO L225 Difference]: With dead ends: 136 [2019-09-07 09:33:04,491 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 09:33:04,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:33:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 09:33:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-07 09:33:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-07 09:33:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-09-07 09:33:04,496 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 117 [2019-09-07 09:33:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:04,496 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-09-07 09:33:04,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 09:33:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-09-07 09:33:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 09:33:04,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:04,498 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:33:04,498 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1795354814, now seen corresponding path program 34 times [2019-09-07 09:33:04,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:04,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:04,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:33:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 09:33:04,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:04,942 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) [2019-09-07 09:33:04,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:33:05,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:33:05,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:33:05,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 09:33:05,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:33:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 09:33:05,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:05,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 09:33:05,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:33:05,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:33:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:33:05,055 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 30 states. [2019-09-07 09:33:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:05,160 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2019-09-07 09:33:05,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 09:33:05,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2019-09-07 09:33:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:05,162 INFO L225 Difference]: With dead ends: 192 [2019-09-07 09:33:05,162 INFO L226 Difference]: Without dead ends: 127 [2019-09-07 09:33:05,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:33:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-07 09:33:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-07 09:33:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-07 09:33:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-09-07 09:33:05,167 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 119 [2019-09-07 09:33:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:05,168 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-09-07 09:33:05,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:33:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-09-07 09:33:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 09:33:05,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:05,169 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:33:05,169 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:05,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:05,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1786253532, now seen corresponding path program 35 times [2019-09-07 09:33:05,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:05,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:05,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:33:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 09:33:05,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:05,734 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-07 09:33:05,748 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 [2019-09-07 09:33:38,842 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-07 09:33:38,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:33:38,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 09:33:38,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:33:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 09:33:38,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:38,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 09:33:38,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:33:38,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:33:38,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:33:38,896 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 30 states. [2019-09-07 09:33:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:38,980 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2019-09-07 09:33:38,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 09:33:38,981 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 121 [2019-09-07 09:33:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:38,982 INFO L225 Difference]: With dead ends: 140 [2019-09-07 09:33:38,982 INFO L226 Difference]: Without dead ends: 129 [2019-09-07 09:33:38,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:33:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-07 09:33:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-09-07 09:33:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 09:33:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-09-07 09:33:38,989 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 121 [2019-09-07 09:33:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:38,989 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-09-07 09:33:38,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:33:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-09-07 09:33:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 09:33:38,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:38,990 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:33:38,990 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1367322310, now seen corresponding path program 36 times [2019-09-07 09:33:38,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:38,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:38,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:38,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:33:38,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 09:33:39,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:39,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:33:39,449 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:35:24,310 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-07 09:35:24,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:35:24,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:35:24,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:35:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 09:35:24,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:35:24,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 09:35:24,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:35:24,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:35:24,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:35:24,383 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 31 states. [2019-09-07 09:35:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:35:24,479 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2019-09-07 09:35:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:35:24,479 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2019-09-07 09:35:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:35:24,480 INFO L225 Difference]: With dead ends: 198 [2019-09-07 09:35:24,480 INFO L226 Difference]: Without dead ends: 131 [2019-09-07 09:35:24,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:35:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-07 09:35:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-09-07 09:35:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-07 09:35:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-09-07 09:35:24,485 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 123 [2019-09-07 09:35:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:35:24,486 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-09-07 09:35:24,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:35:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-09-07 09:35:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 09:35:24,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:35:24,487 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:35:24,487 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:35:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:35:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1341377960, now seen corresponding path program 37 times [2019-09-07 09:35:24,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:35:24,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:35:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:35:24,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:35:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:35:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:35:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 09:35:24,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:35:24,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:35:24,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:35:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:35:25,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 09:35:25,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:35:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 09:35:25,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:35:25,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2019-09-07 09:35:25,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 09:35:25,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 09:35:25,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:35:25,684 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 59 states. [2019-09-07 09:35:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:35:25,961 INFO L93 Difference]: Finished difference Result 203 states and 208 transitions. [2019-09-07 09:35:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 09:35:25,961 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 125 [2019-09-07 09:35:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:35:25,962 INFO L225 Difference]: With dead ends: 203 [2019-09-07 09:35:25,963 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 09:35:25,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:35:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 09:35:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-09-07 09:35:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-07 09:35:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-09-07 09:35:25,969 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 125 [2019-09-07 09:35:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:35:25,970 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2019-09-07 09:35:25,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 09:35:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2019-09-07 09:35:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 09:35:25,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:35:25,971 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:35:25,971 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:35:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:35:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2014566956, now seen corresponding path program 38 times [2019-09-07 09:35:25,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:35:25,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:35:25,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:35:25,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:35:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:35:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:35:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 09:35:26,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:35:26,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:35:26,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:35:26,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:35:26,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:35:26,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 09:35:26,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:35:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 09:35:27,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:35:27,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2019-09-07 09:35:27,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 09:35:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 09:35:27,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:35:27,185 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 61 states. [2019-09-07 09:35:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:35:27,518 INFO L93 Difference]: Finished difference Result 209 states and 214 transitions. [2019-09-07 09:35:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:35:27,518 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 129 [2019-09-07 09:35:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:35:27,519 INFO L225 Difference]: With dead ends: 209 [2019-09-07 09:35:27,519 INFO L226 Difference]: Without dead ends: 140 [2019-09-07 09:35:27,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:35:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-07 09:35:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-09-07 09:35:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-07 09:35:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-09-07 09:35:27,526 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 129 [2019-09-07 09:35:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:35:27,526 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-09-07 09:35:27,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 09:35:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-09-07 09:35:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-07 09:35:27,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:35:27,527 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:35:27,528 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:35:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:35:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash 191032144, now seen corresponding path program 39 times [2019-09-07 09:35:27,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:35:27,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:35:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:35:27,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:35:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:35:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:35:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 09:35:28,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:35:28,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:35:28,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:36:01,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-07 09:36:01,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:36:01,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 09:36:01,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:36:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 09:36:01,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:36:01,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 09:36:01,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 09:36:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 09:36:01,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:36:01,438 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 33 states. [2019-09-07 09:36:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:36:01,532 INFO L93 Difference]: Finished difference Result 152 states and 155 transitions. [2019-09-07 09:36:01,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 09:36:01,534 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 133 [2019-09-07 09:36:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:36:01,536 INFO L225 Difference]: With dead ends: 152 [2019-09-07 09:36:01,536 INFO L226 Difference]: Without dead ends: 141 [2019-09-07 09:36:01,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:36:01,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-07 09:36:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-09-07 09:36:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-07 09:36:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-09-07 09:36:01,541 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 133 [2019-09-07 09:36:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:36:01,542 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-09-07 09:36:01,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 09:36:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-09-07 09:36:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 09:36:01,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:36:01,543 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:36:01,543 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:36:01,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:36:01,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1071751506, now seen corresponding path program 40 times [2019-09-07 09:36:01,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:36:01,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:36:01,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:36:01,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:36:01,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:36:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:36:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 09:36:02,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:36:02,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:36:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:36:02,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:36:02,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:36:02,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 09:36:02,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:36:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 09:36:02,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:36:02,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 09:36:02,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 09:36:02,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 09:36:02,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:36:02,149 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 34 states. [2019-09-07 09:36:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:36:02,253 INFO L93 Difference]: Finished difference Result 216 states and 220 transitions. [2019-09-07 09:36:02,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:36:02,255 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-09-07 09:36:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:36:02,257 INFO L225 Difference]: With dead ends: 216 [2019-09-07 09:36:02,257 INFO L226 Difference]: Without dead ends: 143 [2019-09-07 09:36:02,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:36:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-07 09:36:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-07 09:36:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-07 09:36:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-09-07 09:36:02,266 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 135 [2019-09-07 09:36:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:36:02,266 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-09-07 09:36:02,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 09:36:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-09-07 09:36:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-07 09:36:02,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:36:02,268 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:36:02,268 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:36:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:36:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash -449084724, now seen corresponding path program 41 times [2019-09-07 09:36:02,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:36:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:36:02,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:36:02,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:36:02,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:36:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:36:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 09:36:02,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:36:02,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:36:02,751 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:38:02,499 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-07 09:38:02,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:38:02,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 09:38:02,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:38:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 09:38:02,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:38:02,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 09:38:02,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 09:38:02,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 09:38:02,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:38:02,583 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 34 states. [2019-09-07 09:38:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:38:02,658 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2019-09-07 09:38:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:38:02,659 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 137 [2019-09-07 09:38:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:38:02,660 INFO L225 Difference]: With dead ends: 156 [2019-09-07 09:38:02,660 INFO L226 Difference]: Without dead ends: 145 [2019-09-07 09:38:02,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:38:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-07 09:38:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-09-07 09:38:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-07 09:38:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-09-07 09:38:02,670 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 137 [2019-09-07 09:38:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:38:02,670 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-09-07 09:38:02,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 09:38:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-09-07 09:38:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 09:38:02,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:38:02,671 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:38:02,672 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:38:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:38:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2043738326, now seen corresponding path program 42 times [2019-09-07 09:38:02,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:38:02,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:38:02,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:38:02,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:38:02,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:38:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:38:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 09:38:03,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:38:03,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:38:03,279 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:40:17,062 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2019-09-07 09:40:17,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:40:17,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:40:17,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:40:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 09:40:17,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:40:17,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 09:40:17,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 09:40:17,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 09:40:17,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:40:17,175 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 35 states. [2019-09-07 09:40:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:40:17,318 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2019-09-07 09:40:17,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:40:17,319 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2019-09-07 09:40:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:40:17,320 INFO L225 Difference]: With dead ends: 222 [2019-09-07 09:40:17,320 INFO L226 Difference]: Without dead ends: 147 [2019-09-07 09:40:17,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:40:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-07 09:40:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-07 09:40:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 09:40:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-09-07 09:40:17,325 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 139 [2019-09-07 09:40:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:40:17,325 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-09-07 09:40:17,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 09:40:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-09-07 09:40:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 09:40:17,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:40:17,326 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:40:17,327 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:40:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:40:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash -775885752, now seen corresponding path program 43 times [2019-09-07 09:40:17,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:40:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:40:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:40:17,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:40:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:40:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:40:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1985 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-07 09:40:17,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:40:17,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:40:17,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:40:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:40:17,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 09:40:17,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:40:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1985 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 09:40:18,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:40:18,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 67 [2019-09-07 09:40:18,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 09:40:18,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 09:40:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 09:40:18,738 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 67 states. [2019-09-07 09:40:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:40:19,037 INFO L93 Difference]: Finished difference Result 227 states and 232 transitions. [2019-09-07 09:40:19,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 09:40:19,038 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 141 [2019-09-07 09:40:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:40:19,039 INFO L225 Difference]: With dead ends: 227 [2019-09-07 09:40:19,039 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 09:40:19,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 09:40:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 09:40:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-09-07 09:40:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-07 09:40:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-09-07 09:40:19,044 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 141 [2019-09-07 09:40:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:40:19,045 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-09-07 09:40:19,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 09:40:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-09-07 09:40:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-07 09:40:19,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:40:19,046 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:40:19,046 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:40:19,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:40:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash 515778500, now seen corresponding path program 44 times [2019-09-07 09:40:19,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:40:19,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:40:19,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:40:19,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:40:19,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:40:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:40:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2113 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-07 09:40:19,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:40:19,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:40:19,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:40:19,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:40:19,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:40:19,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 09:40:19,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:40:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2113 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-07 09:40:20,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:40:20,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 69 [2019-09-07 09:40:20,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 09:40:20,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 09:40:20,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 09:40:20,812 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 69 states. [2019-09-07 09:40:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:40:21,114 INFO L93 Difference]: Finished difference Result 233 states and 238 transitions. [2019-09-07 09:40:21,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 09:40:21,114 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 145 [2019-09-07 09:40:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:40:21,115 INFO L225 Difference]: With dead ends: 233 [2019-09-07 09:40:21,115 INFO L226 Difference]: Without dead ends: 156 [2019-09-07 09:40:21,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 09:40:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-07 09:40:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-09-07 09:40:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-07 09:40:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2019-09-07 09:40:21,126 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 145 [2019-09-07 09:40:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:40:21,126 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2019-09-07 09:40:21,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 09:40:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2019-09-07 09:40:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 09:40:21,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:40:21,128 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:40:21,129 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:40:21,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:40:21,129 INFO L82 PathProgramCache]: Analyzing trace with hash 729691456, now seen corresponding path program 45 times [2019-09-07 09:40:21,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:40:21,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:40:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:40:21,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:40:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:40:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:40:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-07 09:40:21,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:40:21,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:40:21,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:42:26,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-07 09:42:26,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:42:26,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 09:42:26,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:42:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-07 09:42:26,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:42:26,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-07 09:42:26,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 09:42:26,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 09:42:26,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:42:26,368 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 37 states. [2019-09-07 09:42:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:42:26,465 INFO L93 Difference]: Finished difference Result 168 states and 171 transitions. [2019-09-07 09:42:26,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 09:42:26,465 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2019-09-07 09:42:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:42:26,467 INFO L225 Difference]: With dead ends: 168 [2019-09-07 09:42:26,467 INFO L226 Difference]: Without dead ends: 157 [2019-09-07 09:42:26,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:42:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-07 09:42:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-07 09:42:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-07 09:42:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2019-09-07 09:42:26,474 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 149 [2019-09-07 09:42:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:42:26,475 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2019-09-07 09:42:26,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 09:42:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2019-09-07 09:42:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 09:42:26,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:42:26,476 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:42:26,476 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:42:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:42:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1183771806, now seen corresponding path program 46 times [2019-09-07 09:42:26,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:42:26,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:42:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:26,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:42:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:42:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-07 09:42:27,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:42:27,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:42:27,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:42:27,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:42:27,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:42:27,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:42:27,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:42:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-07 09:42:28,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:42:28,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72 [2019-09-07 09:42:28,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-07 09:42:28,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-07 09:42:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 09:42:28,456 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 72 states. [2019-09-07 09:42:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:42:28,815 INFO L93 Difference]: Finished difference Result 243 states and 248 transitions. [2019-09-07 09:42:28,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 09:42:28,815 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 151 [2019-09-07 09:42:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:42:28,817 INFO L225 Difference]: With dead ends: 243 [2019-09-07 09:42:28,817 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 09:42:28,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 09:42:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 09:42:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-07 09:42:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-07 09:42:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2019-09-07 09:42:28,823 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 151 [2019-09-07 09:42:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:42:28,823 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2019-09-07 09:42:28,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-07 09:42:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2019-09-07 09:42:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 09:42:28,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:42:28,824 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:42:28,824 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:42:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:42:28,825 INFO L82 PathProgramCache]: Analyzing trace with hash -404562662, now seen corresponding path program 47 times [2019-09-07 09:42:28,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:42:28,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:42:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:28,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:42:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:42:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-07 09:42:29,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:42:29,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:42:29,425 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1