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_two_index_01.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:40:46,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:40:46,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:40:46,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:40:46,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:40:46,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:40:46,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:40:46,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:40:46,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:40:46,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:40:46,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:40:46,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:40:46,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:40:46,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:40:46,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:40:46,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:40:46,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:40:46,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:40:46,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:40:46,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:40:46,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:40:46,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:40:46,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:40:46,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:40:46,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:40:46,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:40:46,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:40:46,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:40:46,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:40:46,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:40:46,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:40:46,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:40:46,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:40:46,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:40:46,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:40:46,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:40:46,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:40:46,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:40:46,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:40:46,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:40:46,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:40:46,300 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-10-01 23:40:46,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:40:46,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:40:46,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:40:46,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:40:46,318 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:40:46,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:40:46,318 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:40:46,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:40:46,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:40:46,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:40:46,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:40:46,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:40:46,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:40:46,320 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:40:46,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:40:46,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:40:46,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:40:46,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:40:46,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:40:46,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:40:46,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:40:46,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:40:46,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:40:46,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:40:46,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:40:46,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:40:46,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:40:46,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:40:46,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:40:46,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:40:46,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:40:46,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:40:46,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:40:46,378 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:40:46,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_01.i [2019-10-01 23:40:46,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d604949a/df9e0cdfe63246fb96e81039d0f4a0f4/FLAG5d680c8be [2019-10-01 23:40:46,932 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:40:46,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_01.i [2019-10-01 23:40:46,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d604949a/df9e0cdfe63246fb96e81039d0f4a0f4/FLAG5d680c8be [2019-10-01 23:40:47,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d604949a/df9e0cdfe63246fb96e81039d0f4a0f4 [2019-10-01 23:40:47,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:40:47,424 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:40:47,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:40:47,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:40:47,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:40:47,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35da1448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47, skipping insertion in model container [2019-10-01 23:40:47,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,442 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:40:47,460 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:40:47,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:40:47,665 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:40:47,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:40:47,791 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:40:47,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47 WrapperNode [2019-10-01 23:40:47,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:40:47,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:40:47,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:40:47,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:40:47,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (1/1) ... [2019-10-01 23:40:47,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:40:47,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:40:47,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:40:47,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:40:47,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (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-10-01 23:40:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:40:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:40:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:40:47,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:40:47,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:40:47,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:40:47,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:40:47,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:40:47,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:40:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:40:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:40:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:40:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:40:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:40:48,163 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:40:48,167 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:40:48,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:40:48 BoogieIcfgContainer [2019-10-01 23:40:48,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:40:48,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:40:48,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:40:48,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:40:48,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:40:47" (1/3) ... [2019-10-01 23:40:48,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e06bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:40:48, skipping insertion in model container [2019-10-01 23:40:48,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:47" (2/3) ... [2019-10-01 23:40:48,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e06bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:40:48, skipping insertion in model container [2019-10-01 23:40:48,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:40:48" (3/3) ... [2019-10-01 23:40:48,191 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_01.i [2019-10-01 23:40:48,213 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:40:48,221 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:40:48,241 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:40:48,277 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:40:48,278 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:40:48,278 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:40:48,278 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:40:48,278 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:40:48,278 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:40:48,279 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:40:48,279 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:40:48,279 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:40:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-01 23:40:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:40:48,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:48,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:48,309 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:48,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2019-10-01 23:40:48,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:48,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:48,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:48,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:48,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:40:48,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:40:48,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:40:48,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:40:48,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:40:48,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:40:48,475 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-10-01 23:40:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:48,501 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-10-01 23:40:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:40:48,503 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 23:40:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:48,512 INFO L225 Difference]: With dead ends: 41 [2019-10-01 23:40:48,513 INFO L226 Difference]: Without dead ends: 19 [2019-10-01 23:40:48,516 INFO L640 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-10-01 23:40:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-01 23:40:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-01 23:40:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-01 23:40:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-01 23:40:48,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-10-01 23:40:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:48,560 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-01 23:40:48,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:40:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-01 23:40:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:40:48,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:48,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:48,562 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2019-10-01 23:40:48,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:48,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:48,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:40:48,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:40:48,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:40:48,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:40:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:40:48,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:40:48,644 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-10-01 23:40:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:48,740 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-10-01 23:40:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:40:48,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:40:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:48,748 INFO L225 Difference]: With dead ends: 36 [2019-10-01 23:40:48,748 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 23:40:48,749 INFO L640 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-10-01 23:40:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 23:40:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-01 23:40:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-01 23:40:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-01 23:40:48,767 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2019-10-01 23:40:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:48,768 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-01 23:40:48,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:40:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-01 23:40:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 23:40:48,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:48,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:48,770 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:48,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2019-10-01 23:40:48,771 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:48,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:48,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:48,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:40:48,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:48,896 INFO L224 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-10-01 23:40:48,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:48,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:40:48,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:40:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:40:49,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:40:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:40:49,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:40:49,022 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2019-10-01 23:40:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:49,095 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-10-01 23:40:49,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:40:49,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-01 23:40:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:49,097 INFO L225 Difference]: With dead ends: 42 [2019-10-01 23:40:49,097 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 23:40:49,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-10-01 23:40:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 23:40:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-10-01 23:40:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-01 23:40:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-01 23:40:49,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2019-10-01 23:40:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:49,104 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-01 23:40:49,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:40:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-01 23:40:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 23:40:49,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:49,106 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:49,106 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:49,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash -406079354, now seen corresponding path program 2 times [2019-10-01 23:40:49,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:49,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:49,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:49,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:49,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:40:49,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:49,180 INFO L224 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) [2019-10-01 23:40:49,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:49,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:49,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:49,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:40:49,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:40:49,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:49,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:40:49,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:40:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:40:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:40:49,278 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2019-10-01 23:40:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:49,408 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-10-01 23:40:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:40:49,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-01 23:40:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:49,412 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:40:49,412 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 23:40:49,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-10-01 23:40:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 23:40:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-01 23:40:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-01 23:40:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-01 23:40:49,425 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2019-10-01 23:40:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:49,426 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-01 23:40:49,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:40:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-01 23:40:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 23:40:49,427 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:49,427 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:49,428 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:49,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:49,428 INFO L82 PathProgramCache]: Analyzing trace with hash -820912923, now seen corresponding path program 3 times [2019-10-01 23:40:49,428 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:49,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:49,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 23:40:49,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:49,548 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:40:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:49,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:40:49,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:49,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:40:49,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 23:40:49,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:49,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:40:49,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:40:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:40:49,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:40:49,640 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2019-10-01 23:40:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:49,749 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-10-01 23:40:49,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:40:49,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-01 23:40:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:49,752 INFO L225 Difference]: With dead ends: 54 [2019-10-01 23:40:49,752 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 23:40:49,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-10-01 23:40:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 23:40:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-10-01 23:40:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 23:40:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-01 23:40:49,765 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2019-10-01 23:40:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:49,765 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-01 23:40:49,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:40:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-01 23:40:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 23:40:49,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:49,767 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:49,767 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1912151398, now seen corresponding path program 4 times [2019-10-01 23:40:49,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:49,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:49,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:49,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:40:49,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:49,901 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:49,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:40:49,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:40:49,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:49,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:40:49,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:40:49,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:49,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:40:49,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:40:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:40:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:40:49,984 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2019-10-01 23:40:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:50,067 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-10-01 23:40:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:40:50,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-10-01 23:40:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:50,069 INFO L225 Difference]: With dead ends: 60 [2019-10-01 23:40:50,069 INFO L226 Difference]: Without dead ends: 44 [2019-10-01 23:40:50,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:40:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-01 23:40:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2019-10-01 23:40:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:40:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-01 23:40:50,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 23 [2019-10-01 23:40:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:50,076 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-01 23:40:50,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:40:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-01 23:40:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:40:50,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:50,078 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:50,078 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:50,079 INFO L82 PathProgramCache]: Analyzing trace with hash 378570245, now seen corresponding path program 5 times [2019-10-01 23:40:50,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:50,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:50,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:40:50,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:50,159 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:40:50,301 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-01 23:40:50,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:50,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:40:50,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:40:50,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:50,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:40:50,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:40:50,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:40:50,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:40:50,334 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2019-10-01 23:40:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:50,456 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-10-01 23:40:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:40:50,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-01 23:40:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:50,458 INFO L225 Difference]: With dead ends: 66 [2019-10-01 23:40:50,458 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 23:40:50,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 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-10-01 23:40:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 23:40:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2019-10-01 23:40:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 23:40:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-01 23:40:50,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2019-10-01 23:40:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:50,468 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-01 23:40:50,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:40:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-10-01 23:40:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 23:40:50,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:50,469 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:50,469 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:50,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1539667386, now seen corresponding path program 6 times [2019-10-01 23:40:50,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:50,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:50,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:50,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:40:50,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:50,584 INFO L224 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-10-01 23:40:50,614 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-10-01 23:40:50,702 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-01 23:40:50,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:50,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:40:50,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:40:50,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:50,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:40:50,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:40:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:40:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:40:50,736 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2019-10-01 23:40:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:50,857 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-10-01 23:40:50,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:40:50,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-01 23:40:50,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:50,858 INFO L225 Difference]: With dead ends: 72 [2019-10-01 23:40:50,858 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 23:40:50,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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-10-01 23:40:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 23:40:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-10-01 23:40:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 23:40:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-01 23:40:50,872 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2019-10-01 23:40:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:50,873 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-01 23:40:50,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:40:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-01 23:40:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 23:40:50,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:50,878 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:50,878 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash -411883739, now seen corresponding path program 7 times [2019-10-01 23:40:50,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:50,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:50,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 23:40:50,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:50,992 INFO L224 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-10-01 23:40:51,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:51,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:40:51,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 23:40:51,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:51,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:40:51,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:40:51,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:40:51,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:40:51,087 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 11 states. [2019-10-01 23:40:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:51,218 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2019-10-01 23:40:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:40:51,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-10-01 23:40:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:51,220 INFO L225 Difference]: With dead ends: 78 [2019-10-01 23:40:51,220 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 23:40:51,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 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-10-01 23:40:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 23:40:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2019-10-01 23:40:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 23:40:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-01 23:40:51,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 29 [2019-10-01 23:40:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:51,240 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-01 23:40:51,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:40:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-01 23:40:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 23:40:51,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:51,243 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:51,245 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:51,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash -959578330, now seen corresponding path program 8 times [2019-10-01 23:40:51,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:51,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:51,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:51,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:51,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 23:40:51,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:51,426 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:51,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:51,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:51,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:51,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:40:51,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:40:51,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:51,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:40:51,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:40:51,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:40:51,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:40:51,526 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2019-10-01 23:40:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:51,653 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2019-10-01 23:40:51,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:40:51,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-10-01 23:40:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:51,655 INFO L225 Difference]: With dead ends: 84 [2019-10-01 23:40:51,655 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 23:40:51,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:40:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 23:40:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2019-10-01 23:40:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 23:40:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-01 23:40:51,668 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 31 [2019-10-01 23:40:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:51,669 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-01 23:40:51,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:40:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-01 23:40:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 23:40:51,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:51,670 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:51,670 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:51,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1380204475, now seen corresponding path program 9 times [2019-10-01 23:40:51,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:51,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:51,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:51,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:51,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-01 23:40:51,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:51,826 INFO L224 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-10-01 23:40:51,853 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-10-01 23:40:52,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:40:52,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:52,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:40:52,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-01 23:40:52,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:52,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:40:52,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:40:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:40:52,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:40:52,301 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 13 states. [2019-10-01 23:40:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:52,431 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2019-10-01 23:40:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:40:52,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-10-01 23:40:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:52,432 INFO L225 Difference]: With dead ends: 90 [2019-10-01 23:40:52,433 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 23:40:52,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:40:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 23:40:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2019-10-01 23:40:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 23:40:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-01 23:40:52,441 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-10-01 23:40:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:52,441 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-01 23:40:52,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:40:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-01 23:40:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 23:40:52,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:52,442 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:52,443 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2054257670, now seen corresponding path program 10 times [2019-10-01 23:40:52,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:52,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:52,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:52,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:40:52,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:52,568 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:52,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:40:52,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:40:52,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:52,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:40:52,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:40:52,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:52,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:40:52,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:40:52,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:40:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:40:52,688 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 14 states. [2019-10-01 23:40:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:52,863 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2019-10-01 23:40:52,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:40:52,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-10-01 23:40:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:52,864 INFO L225 Difference]: With dead ends: 96 [2019-10-01 23:40:52,864 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 23:40:52,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:40:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 23:40:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2019-10-01 23:40:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 23:40:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-01 23:40:52,873 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 35 [2019-10-01 23:40:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:52,873 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-01 23:40:52,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:40:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-01 23:40:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 23:40:52,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:52,874 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:52,875 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1290555749, now seen corresponding path program 11 times [2019-10-01 23:40:52,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:52,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:52,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 23:40:52,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:52,997 INFO L224 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-10-01 23:40:53,028 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:40:54,695 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 23:40:54,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:54,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:40:54,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 23:40:54,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:54,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:40:54,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:40:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:40:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:40:54,732 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 15 states. [2019-10-01 23:40:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:54,923 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2019-10-01 23:40:54,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:40:54,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-10-01 23:40:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:54,925 INFO L225 Difference]: With dead ends: 102 [2019-10-01 23:40:54,925 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 23:40:54,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 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-10-01 23:40:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 23:40:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 43. [2019-10-01 23:40:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 23:40:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-01 23:40:54,933 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 37 [2019-10-01 23:40:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:54,933 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-01 23:40:54,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:40:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-01 23:40:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 23:40:54,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:54,934 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:54,935 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1738342170, now seen corresponding path program 12 times [2019-10-01 23:40:54,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:54,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:54,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-01 23:40:55,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:55,136 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:55,176 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:40:56,556 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:40:56,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:56,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:40:56,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-01 23:40:56,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:56,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:40:56,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:40:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:40:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:40:56,592 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 16 states. [2019-10-01 23:40:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:56,763 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2019-10-01 23:40:56,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:40:56,764 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-10-01 23:40:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:56,765 INFO L225 Difference]: With dead ends: 108 [2019-10-01 23:40:56,765 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 23:40:56,766 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 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-10-01 23:40:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 23:40:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 45. [2019-10-01 23:40:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-01 23:40:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-10-01 23:40:56,774 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 39 [2019-10-01 23:40:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:56,774 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-10-01 23:40:56,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:40:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-10-01 23:40:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 23:40:56,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:56,776 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:56,776 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1074190981, now seen corresponding path program 13 times [2019-10-01 23:40:56,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:56,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-01 23:40:56,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:56,959 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:56,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:57,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:40:57,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-01 23:40:57,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:57,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:40:57,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:40:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:40:57,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:40:57,036 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 17 states. [2019-10-01 23:40:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:57,264 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2019-10-01 23:40:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:40:57,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-10-01 23:40:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:57,267 INFO L225 Difference]: With dead ends: 114 [2019-10-01 23:40:57,267 INFO L226 Difference]: Without dead ends: 89 [2019-10-01 23:40:57,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:40:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-01 23:40:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 47. [2019-10-01 23:40:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 23:40:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-10-01 23:40:57,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 41 [2019-10-01 23:40:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:57,274 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-10-01 23:40:57,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:40:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-10-01 23:40:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 23:40:57,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:57,275 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:57,275 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash 308317638, now seen corresponding path program 14 times [2019-10-01 23:40:57,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:57,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:57,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:40:57,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:57,442 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:57,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:57,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:57,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:57,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:40:57,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:40:57,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:57,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:40:57,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:40:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:40:57,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:40:57,573 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 18 states. [2019-10-01 23:40:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:57,837 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2019-10-01 23:40:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:40:57,838 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2019-10-01 23:40:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:57,840 INFO L225 Difference]: With dead ends: 120 [2019-10-01 23:40:57,840 INFO L226 Difference]: Without dead ends: 94 [2019-10-01 23:40:57,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 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-10-01 23:40:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-01 23:40:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 49. [2019-10-01 23:40:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 23:40:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-10-01 23:40:57,862 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 43 [2019-10-01 23:40:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:57,863 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-10-01 23:40:57,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:40:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-10-01 23:40:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 23:40:57,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:57,864 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:57,865 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:57,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1181918299, now seen corresponding path program 15 times [2019-10-01 23:40:57,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:57,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:57,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:57,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 23:40:58,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:58,086 INFO L224 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) [2019-10-01 23:40:58,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:03,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:41:03,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:03,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:41:03,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 23:41:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:41:03,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:41:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:41:03,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:41:03,751 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 19 states. [2019-10-01 23:41:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:03,963 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2019-10-01 23:41:03,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:41:03,964 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-10-01 23:41:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:03,965 INFO L225 Difference]: With dead ends: 126 [2019-10-01 23:41:03,965 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 23:41:03,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 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-10-01 23:41:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 23:41:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2019-10-01 23:41:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 23:41:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-10-01 23:41:03,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 45 [2019-10-01 23:41:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:03,972 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-10-01 23:41:03,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:41:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-10-01 23:41:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 23:41:03,973 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:03,973 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:03,973 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:03,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:03,973 INFO L82 PathProgramCache]: Analyzing trace with hash -760733018, now seen corresponding path program 16 times [2019-10-01 23:41:03,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:03,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:03,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:03,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:03,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:41:04,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:04,159 INFO L224 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-10-01 23:41:04,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:41:04,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:41:04,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:04,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:41:04,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:41:04,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:04,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:41:04,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:41:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:41:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:41:04,256 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 20 states. [2019-10-01 23:41:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:04,496 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2019-10-01 23:41:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:41:04,498 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-10-01 23:41:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:04,500 INFO L225 Difference]: With dead ends: 132 [2019-10-01 23:41:04,500 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 23:41:04,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:41:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 23:41:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 53. [2019-10-01 23:41:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 23:41:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-01 23:41:04,506 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 47 [2019-10-01 23:41:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:04,507 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-01 23:41:04,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:41:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-01 23:41:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-01 23:41:04,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:04,508 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:04,508 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1014901563, now seen corresponding path program 17 times [2019-10-01 23:41:04,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:04,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:04,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-01 23:41:04,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:04,702 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:41:36,310 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-10-01 23:41:36,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:36,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:41:36,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-01 23:41:36,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:36,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:41:36,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:41:36,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:41:36,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:41:36,378 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 21 states. [2019-10-01 23:41:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:36,607 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2019-10-01 23:41:36,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:41:36,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-10-01 23:41:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:36,608 INFO L225 Difference]: With dead ends: 138 [2019-10-01 23:41:36,609 INFO L226 Difference]: Without dead ends: 109 [2019-10-01 23:41:36,614 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:41:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-01 23:41:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2019-10-01 23:41:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 23:41:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-10-01 23:41:36,623 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 49 [2019-10-01 23:41:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:36,624 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-10-01 23:41:36,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:41:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-10-01 23:41:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 23:41:36,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:36,626 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:36,626 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:36,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1678262394, now seen corresponding path program 18 times [2019-10-01 23:41:36,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:36,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:36,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:36,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-01 23:41:36,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:36,876 INFO L224 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-10-01 23:41:36,900 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:41:49,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 23:41:49,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:49,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:41:49,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-01 23:41:49,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:49,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:41:49,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:41:49,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:41:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:41:49,451 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 22 states. [2019-10-01 23:41:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:49,716 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2019-10-01 23:41:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:41:49,716 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-10-01 23:41:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:49,717 INFO L225 Difference]: With dead ends: 144 [2019-10-01 23:41:49,717 INFO L226 Difference]: Without dead ends: 114 [2019-10-01 23:41:49,718 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:41:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-01 23:41:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 57. [2019-10-01 23:41:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-01 23:41:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-10-01 23:41:49,723 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 51 [2019-10-01 23:41:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:49,723 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-10-01 23:41:49,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:41:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-10-01 23:41:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 23:41:49,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:49,724 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:49,724 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1600538085, now seen corresponding path program 19 times [2019-10-01 23:41:49,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:49,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:49,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:49,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:49,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-01 23:41:49,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:49,984 INFO L224 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-10-01 23:41:50,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:50,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:41:50,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:41:50,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:50,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:41:50,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:41:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:41:50,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:41:50,086 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 23 states. [2019-10-01 23:41:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:50,369 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2019-10-01 23:41:50,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:41:50,370 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-10-01 23:41:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:50,371 INFO L225 Difference]: With dead ends: 150 [2019-10-01 23:41:50,371 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 23:41:50,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:41:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 23:41:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 59. [2019-10-01 23:41:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 23:41:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-01 23:41:50,377 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 53 [2019-10-01 23:41:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:50,377 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-01 23:41:50,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:41:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-01 23:41:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 23:41:50,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:50,378 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:50,378 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash -376609690, now seen corresponding path program 20 times [2019-10-01 23:41:50,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:50,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:50,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:41:50,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:50,669 INFO L224 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-10-01 23:41:50,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:41:50,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:41:50,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:50,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:41:50,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:41:50,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:50,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:41:50,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:41:50,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:41:50,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:41:50,782 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 24 states. [2019-10-01 23:41:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:51,052 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2019-10-01 23:41:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:41:51,054 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2019-10-01 23:41:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:51,056 INFO L225 Difference]: With dead ends: 156 [2019-10-01 23:41:51,056 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 23:41:51,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 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-10-01 23:41:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 23:41:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 61. [2019-10-01 23:41:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 23:41:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-01 23:41:51,066 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 55 [2019-10-01 23:41:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:51,066 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-01 23:41:51,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:41:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-01 23:41:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 23:41:51,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:51,067 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:51,068 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1505972475, now seen corresponding path program 21 times [2019-10-01 23:41:51,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:51,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:51,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-01 23:41:51,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:51,425 INFO L224 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-10-01 23:41:51,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:42:33,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:42:33,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:33,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:42:33,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-01 23:42:33,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:33,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:42:33,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:42:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:42:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:42:33,776 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 25 states. [2019-10-01 23:42:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:34,108 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2019-10-01 23:42:34,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:42:34,108 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2019-10-01 23:42:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:34,110 INFO L225 Difference]: With dead ends: 162 [2019-10-01 23:42:34,110 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 23:42:34,110 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 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-10-01 23:42:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 23:42:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 63. [2019-10-01 23:42:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 23:42:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-10-01 23:42:34,116 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 57 [2019-10-01 23:42:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:34,116 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-10-01 23:42:34,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:42:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-10-01 23:42:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 23:42:34,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:34,118 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:34,118 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash -819523258, now seen corresponding path program 22 times [2019-10-01 23:42:34,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:34,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:34,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 23:42:34,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:34,452 INFO L224 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-10-01 23:42:34,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:42:34,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:42:34,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:34,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:42:34,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 23:42:34,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:34,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:42:34,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:42:34,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:42:34,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:42:34,569 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 26 states. [2019-10-01 23:42:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:34,978 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2019-10-01 23:42:34,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:42:34,979 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2019-10-01 23:42:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:34,980 INFO L225 Difference]: With dead ends: 168 [2019-10-01 23:42:34,981 INFO L226 Difference]: Without dead ends: 134 [2019-10-01 23:42:34,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:42:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-01 23:42:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 65. [2019-10-01 23:42:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-01 23:42:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-10-01 23:42:34,987 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 59 [2019-10-01 23:42:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:34,987 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-10-01 23:42:34,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:42:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-10-01 23:42:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-01 23:42:34,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:34,988 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:34,988 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:34,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:34,989 INFO L82 PathProgramCache]: Analyzing trace with hash -393801691, now seen corresponding path program 23 times [2019-10-01 23:42:34,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:34,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:34,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:34,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 23:42:35,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:35,301 INFO L224 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-10-01 23:42:35,336 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:43:38,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 23:43:38,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:38,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:43:38,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 23:43:38,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:38,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:43:38,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:43:38,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:43:38,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:43:38,771 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 27 states. [2019-10-01 23:43:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:39,219 INFO L93 Difference]: Finished difference Result 174 states and 203 transitions. [2019-10-01 23:43:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:43:39,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2019-10-01 23:43:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:39,221 INFO L225 Difference]: With dead ends: 174 [2019-10-01 23:43:39,221 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 23:43:39,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:43:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 23:43:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 67. [2019-10-01 23:43:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 23:43:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2019-10-01 23:43:39,228 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 61 [2019-10-01 23:43:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:39,228 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2019-10-01 23:43:39,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:43:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2019-10-01 23:43:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 23:43:39,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:39,229 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:39,230 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash -654129626, now seen corresponding path program 24 times [2019-10-01 23:43:39,230 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:39,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:39,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:39,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:39,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-01 23:43:39,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:39,635 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:39,675 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:44:29,623 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:44:29,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:29,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:44:29,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-01 23:44:29,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:29,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:44:29,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:44:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:44:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:44:29,678 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 28 states. [2019-10-01 23:44:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:30,282 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2019-10-01 23:44:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:44:30,283 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2019-10-01 23:44:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:30,284 INFO L225 Difference]: With dead ends: 180 [2019-10-01 23:44:30,285 INFO L226 Difference]: Without dead ends: 144 [2019-10-01 23:44:30,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:44:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-01 23:44:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 69. [2019-10-01 23:44:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 23:44:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-10-01 23:44:30,291 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 63 [2019-10-01 23:44:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:30,291 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-10-01 23:44:30,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:44:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-10-01 23:44:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 23:44:30,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:30,292 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:30,292 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:30,293 INFO L82 PathProgramCache]: Analyzing trace with hash -834180795, now seen corresponding path program 25 times [2019-10-01 23:44:30,293 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:30,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:30,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:44:30,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:30,785 INFO L224 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-10-01 23:44:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:30,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:44:30,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:44:30,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:30,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:44:30,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:44:30,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:44:30,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:44:30,895 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 29 states. [2019-10-01 23:44:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:31,330 INFO L93 Difference]: Finished difference Result 186 states and 217 transitions. [2019-10-01 23:44:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:44:31,330 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2019-10-01 23:44:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:31,332 INFO L225 Difference]: With dead ends: 186 [2019-10-01 23:44:31,332 INFO L226 Difference]: Without dead ends: 149 [2019-10-01 23:44:31,333 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 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-10-01 23:44:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-01 23:44:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 71. [2019-10-01 23:44:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 23:44:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-10-01 23:44:31,345 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 65 [2019-10-01 23:44:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:31,346 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-10-01 23:44:31,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:44:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-10-01 23:44:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 23:44:31,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:31,347 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:31,347 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:31,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:31,348 INFO L82 PathProgramCache]: Analyzing trace with hash -337739002, now seen corresponding path program 26 times [2019-10-01 23:44:31,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:31,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:31,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:44:31,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:31,876 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:44:31,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:44:32,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:44:32,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:32,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:44:32,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:44:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:32,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:44:32,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:44:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:44:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:44:32,069 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 30 states. [2019-10-01 23:44:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:32,568 INFO L93 Difference]: Finished difference Result 192 states and 224 transitions. [2019-10-01 23:44:32,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:44:32,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-10-01 23:44:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:32,570 INFO L225 Difference]: With dead ends: 192 [2019-10-01 23:44:32,570 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 23:44:32,571 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 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-10-01 23:44:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 23:44:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 73. [2019-10-01 23:44:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-01 23:44:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-10-01 23:44:32,577 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 67 [2019-10-01 23:44:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:32,577 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-10-01 23:44:32,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:44:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-10-01 23:44:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 23:44:32,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:32,578 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:32,578 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1996470885, now seen corresponding path program 27 times [2019-10-01 23:44:32,579 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:32,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:32,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:32,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:32,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-10-01 23:44:33,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:33,027 INFO L224 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-10-01 23:44:33,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:45:27,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:45:27,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:27,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:45:27,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-10-01 23:45:27,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:27,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:45:27,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:45:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:45:27,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:45:27,648 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 31 states. [2019-10-01 23:45:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:28,093 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2019-10-01 23:45:28,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:45:28,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2019-10-01 23:45:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:28,096 INFO L225 Difference]: With dead ends: 198 [2019-10-01 23:45:28,096 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 23:45:28,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 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-10-01 23:45:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 23:45:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2019-10-01 23:45:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 23:45:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2019-10-01 23:45:28,104 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 69 [2019-10-01 23:45:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:28,104 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2019-10-01 23:45:28,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:45:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2019-10-01 23:45:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 23:45:28,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:28,105 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:28,105 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:28,106 INFO L82 PathProgramCache]: Analyzing trace with hash 620251110, now seen corresponding path program 28 times [2019-10-01 23:45:28,106 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:28,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:28,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:28,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:28,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-10-01 23:45:28,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:28,631 INFO L224 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-10-01 23:45:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:45:28,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:45:28,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:28,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:45:28,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:45:28,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:28,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:45:28,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:45:28,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:45:28,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:45:28,765 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 32 states. [2019-10-01 23:45:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:29,298 INFO L93 Difference]: Finished difference Result 204 states and 238 transitions. [2019-10-01 23:45:29,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:45:29,298 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-10-01 23:45:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:29,300 INFO L225 Difference]: With dead ends: 204 [2019-10-01 23:45:29,300 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 23:45:29,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:45:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 23:45:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 77. [2019-10-01 23:45:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 23:45:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-10-01 23:45:29,307 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 71 [2019-10-01 23:45:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:29,307 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-10-01 23:45:29,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:45:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-10-01 23:45:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-01 23:45:29,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:29,308 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:29,308 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:29,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1716386939, now seen corresponding path program 29 times [2019-10-01 23:45:29,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:29,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:29,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:29,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:29,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-01 23:45:29,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:29,728 INFO L224 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-10-01 23:45:29,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:47:08,921 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-10-01 23:47:08,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:08,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:47:08,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-01 23:47:09,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:09,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:47:09,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:47:09,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:47:09,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:47:09,027 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 33 states. [2019-10-01 23:47:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:09,576 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2019-10-01 23:47:09,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:47:09,577 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2019-10-01 23:47:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:09,579 INFO L225 Difference]: With dead ends: 210 [2019-10-01 23:47:09,579 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:47:09,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:47:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:47:09,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 79. [2019-10-01 23:47:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:47:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-10-01 23:47:09,585 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 73 [2019-10-01 23:47:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:09,586 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-10-01 23:47:09,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:47:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-10-01 23:47:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 23:47:09,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:09,587 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:09,587 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1173482298, now seen corresponding path program 30 times [2019-10-01 23:47:09,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:09,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:09,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:47:10,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:10,065 INFO L224 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-10-01 23:47:10,101 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:48:44,827 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 23:48:44,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:44,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:48:44,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:48:44,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:44,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 23:48:44,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:48:44,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:48:44,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:48:44,907 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 34 states. [2019-10-01 23:48:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:45,448 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2019-10-01 23:48:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:48:45,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-10-01 23:48:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:45,450 INFO L225 Difference]: With dead ends: 216 [2019-10-01 23:48:45,450 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 23:48:45,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 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-10-01 23:48:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 23:48:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 81. [2019-10-01 23:48:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 23:48:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-10-01 23:48:45,460 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 75 [2019-10-01 23:48:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:45,460 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-10-01 23:48:45,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:48:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-10-01 23:48:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 23:48:45,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:45,461 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:45,461 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1528806235, now seen corresponding path program 31 times [2019-10-01 23:48:45,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:45,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:45,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:45,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-01 23:48:46,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:46,235 INFO L224 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-10-01 23:48:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:48:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:46,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:48:46,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-01 23:48:46,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:46,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:48:46,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:48:46,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:48:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:48:46,435 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 35 states. [2019-10-01 23:48:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:47,071 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2019-10-01 23:48:47,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:48:47,072 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2019-10-01 23:48:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:47,073 INFO L225 Difference]: With dead ends: 222 [2019-10-01 23:48:47,073 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 23:48:47,074 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:48:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 23:48:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 83. [2019-10-01 23:48:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-01 23:48:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-10-01 23:48:47,081 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 77 [2019-10-01 23:48:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:47,081 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-10-01 23:48:47,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:48:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-10-01 23:48:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-01 23:48:47,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:47,082 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:47,083 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash -648156762, now seen corresponding path program 32 times [2019-10-01 23:48:47,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:47,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:47,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:48:47,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-01 23:48:47,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:47,900 INFO L224 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-10-01 23:48:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:48:48,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:48:48,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:48:48,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:48:48,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:48:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-01 23:48:48,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:48:48,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:48:48,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:48:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:48:48,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:48:48,072 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 36 states. [2019-10-01 23:48:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:48:48,779 INFO L93 Difference]: Finished difference Result 228 states and 266 transitions. [2019-10-01 23:48:48,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:48:48,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2019-10-01 23:48:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:48:48,781 INFO L225 Difference]: With dead ends: 228 [2019-10-01 23:48:48,781 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 23:48:48,782 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:48:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 23:48:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 85. [2019-10-01 23:48:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 23:48:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2019-10-01 23:48:48,788 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 79 [2019-10-01 23:48:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:48:48,788 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2019-10-01 23:48:48,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:48:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2019-10-01 23:48:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 23:48:48,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:48:48,789 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:48:48,789 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:48:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:48:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash -561218107, now seen corresponding path program 33 times [2019-10-01 23:48:48,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:48:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:48:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:48,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:48:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:48:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:48:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-10-01 23:48:49,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:48:49,592 INFO L224 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-10-01 23:48:49,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:50:10,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-01 23:50:10,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:50:10,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:50:10,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-10-01 23:50:10,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 23:50:10,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:50:10,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:50:10,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:50:10,706 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 37 states. [2019-10-01 23:50:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:11,325 INFO L93 Difference]: Finished difference Result 234 states and 273 transitions. [2019-10-01 23:50:11,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:50:11,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2019-10-01 23:50:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:11,327 INFO L225 Difference]: With dead ends: 234 [2019-10-01 23:50:11,327 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 23:50:11,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:50:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 23:50:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 87. [2019-10-01 23:50:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 23:50:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-10-01 23:50:11,334 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 81 [2019-10-01 23:50:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:11,334 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-10-01 23:50:11,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:50:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-10-01 23:50:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 23:50:11,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:11,335 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:11,335 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1985624442, now seen corresponding path program 34 times [2019-10-01 23:50:11,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:11,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:11,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:50:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-01 23:50:12,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:12,070 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:50:12,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:50:12,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:50:12,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:50:12,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:50:12,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-01 23:50:12,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:12,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:50:12,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:50:12,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:50:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:50:12,218 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 38 states. [2019-10-01 23:50:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:12,922 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2019-10-01 23:50:12,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:50:12,922 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-10-01 23:50:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:12,924 INFO L225 Difference]: With dead ends: 240 [2019-10-01 23:50:12,924 INFO L226 Difference]: Without dead ends: 194 [2019-10-01 23:50:12,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:50:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-01 23:50:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 89. [2019-10-01 23:50:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 23:50:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-10-01 23:50:12,933 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 83 [2019-10-01 23:50:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:12,934 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-10-01 23:50:12,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:50:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-10-01 23:50:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 23:50:12,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:12,936 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:12,936 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2076659995, now seen corresponding path program 35 times [2019-10-01 23:50:12,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:12,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:12,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:50:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-01 23:50:13,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:13,879 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:50:13,935 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:52:33,315 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-10-01 23:52:33,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:52:33,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:52:33,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:52:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-01 23:52:33,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:52:33,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 23:52:33,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:52:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:52:33,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:52:33,420 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 39 states. [2019-10-01 23:52:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:52:34,160 INFO L93 Difference]: Finished difference Result 246 states and 287 transitions. [2019-10-01 23:52:34,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:52:34,160 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2019-10-01 23:52:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:52:34,161 INFO L225 Difference]: With dead ends: 246 [2019-10-01 23:52:34,161 INFO L226 Difference]: Without dead ends: 199 [2019-10-01 23:52:34,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:52:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-01 23:52:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 91. [2019-10-01 23:52:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 23:52:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2019-10-01 23:52:34,167 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 85 [2019-10-01 23:52:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:52:34,167 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2019-10-01 23:52:34,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:52:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2019-10-01 23:52:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-01 23:52:34,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:52:34,168 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:52:34,168 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:52:34,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:52:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1977373850, now seen corresponding path program 36 times [2019-10-01 23:52:34,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:52:34,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:52:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:52:34,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:52:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:52:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:52:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:52:34,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:52:34,751 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:52:34,796 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:54:22,953 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:54:22,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:22,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:54:22,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:54:23,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:23,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-01 23:54:23,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 23:54:23,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 23:54:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 23:54:23,048 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 40 states. [2019-10-01 23:54:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:23,787 INFO L93 Difference]: Finished difference Result 252 states and 294 transitions. [2019-10-01 23:54:23,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 23:54:23,788 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 87 [2019-10-01 23:54:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:23,789 INFO L225 Difference]: With dead ends: 252 [2019-10-01 23:54:23,789 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 23:54:23,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 23:54:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 23:54:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 93. [2019-10-01 23:54:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 23:54:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-10-01 23:54:23,796 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 87 [2019-10-01 23:54:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:23,796 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-10-01 23:54:23,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 23:54:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-10-01 23:54:23,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-01 23:54:23,797 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:23,797 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:23,797 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:23,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:23,798 INFO L82 PathProgramCache]: Analyzing trace with hash -353970171, now seen corresponding path program 37 times [2019-10-01 23:54:23,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:23,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:23,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:23,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:23,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 23:54:24,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:24,745 INFO L224 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-10-01 23:54:24,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:54:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:24,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:54:24,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 23:54:24,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:24,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:54:24,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:54:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:54:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:54:24,914 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 41 states. [2019-10-01 23:54:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:25,601 INFO L93 Difference]: Finished difference Result 258 states and 301 transitions. [2019-10-01 23:54:25,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:54:25,601 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 89 [2019-10-01 23:54:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:25,603 INFO L225 Difference]: With dead ends: 258 [2019-10-01 23:54:25,603 INFO L226 Difference]: Without dead ends: 209 [2019-10-01 23:54:25,604 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:54:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-01 23:54:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 95. [2019-10-01 23:54:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 23:54:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-10-01 23:54:25,610 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 89 [2019-10-01 23:54:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:25,610 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2019-10-01 23:54:25,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:54:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2019-10-01 23:54:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 23:54:25,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:25,611 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:25,611 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 848664646, now seen corresponding path program 38 times [2019-10-01 23:54:25,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:25,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:25,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:25,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:54:25,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-01 23:54:26,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:26,295 INFO L224 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-10-01 23:54:26,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:54:26,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:54:26,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:26,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:54:26,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:54:26,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:26,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 23:54:26,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:54:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:54:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:54:26,477 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 42 states. [2019-10-01 23:54:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:27,254 INFO L93 Difference]: Finished difference Result 264 states and 308 transitions. [2019-10-01 23:54:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:54:27,255 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 91 [2019-10-01 23:54:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:27,257 INFO L225 Difference]: With dead ends: 264 [2019-10-01 23:54:27,257 INFO L226 Difference]: Without dead ends: 214 [2019-10-01 23:54:27,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:54:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-01 23:54:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 97. [2019-10-01 23:54:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 23:54:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2019-10-01 23:54:27,268 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 91 [2019-10-01 23:54:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:27,268 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2019-10-01 23:54:27,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:54:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2019-10-01 23:54:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 23:54:27,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:27,270 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:27,270 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1625753307, now seen corresponding path program 39 times [2019-10-01 23:54:27,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:27,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:27,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:27,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-10-01 23:54:28,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:28,172 INFO L224 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-10-01 23:54:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2