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_vector_difference_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:42:19,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:42:19,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:42:19,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:42:19,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:42:19,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:42:19,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:42:19,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:42:19,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:42:19,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:42:19,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:42:19,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:42:19,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:42:19,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:42:19,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:42:19,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:42:19,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:42:19,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:42:19,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:42:19,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:42:19,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:42:19,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:42:19,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:42:19,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:42:19,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:42:19,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:42:19,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:42:19,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:42:19,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:42:19,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:42:19,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:42:19,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:42:19,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:42:19,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:42:19,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:42:19,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:42:19,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:42:19,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:42:19,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:42:19,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:42:19,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:42:19,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:42:19,384 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:42:19,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:42:19,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:42:19,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:42:19,386 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:42:19,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:42:19,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:42:19,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:42:19,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:42:19,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:42:19,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:42:19,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:42:19,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:42:19,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:42:19,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:42:19,388 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:42:19,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:42:19,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:42:19,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:42:19,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:42:19,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:42:19,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:42:19,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:42:19,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:42:19,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:42:19,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:42:19,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:42:19,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:42:19,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:42:19,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:42:19,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:42:19,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:42:19,442 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:42:19,442 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:42:19,443 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_vector_difference_ground.i [2019-09-07 10:42:19,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f448dde9/cb7f9fa952384f0986daa85cd23eff1b/FLAG06b5c7b1e [2019-09-07 10:42:19,958 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:42:19,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_vector_difference_ground.i [2019-09-07 10:42:19,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f448dde9/cb7f9fa952384f0986daa85cd23eff1b/FLAG06b5c7b1e [2019-09-07 10:42:20,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f448dde9/cb7f9fa952384f0986daa85cd23eff1b [2019-09-07 10:42:20,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:42:20,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:42:20,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:42:20,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:42:20,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:42:20,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad31ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20, skipping insertion in model container [2019-09-07 10:42:20,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,408 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:42:20,427 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:42:20,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:42:20,607 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:42:20,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:42:20,647 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:42:20,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20 WrapperNode [2019-09-07 10:42:20,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:42:20,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:42:20,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:42:20,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:42:20,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (1/1) ... [2019-09-07 10:42:20,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:42:20,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:42:20,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:42:20,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:42:20,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:42:20,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:42:20,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:42:20,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:42:20,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:42:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:42:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:42:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:42:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:42:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:42:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:42:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:42:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:42:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:42:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:42:21,069 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:42:21,070 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:42:21,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:42:21 BoogieIcfgContainer [2019-09-07 10:42:21,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:42:21,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:42:21,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:42:21,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:42:21,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:42:20" (1/3) ... [2019-09-07 10:42:21,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d09f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:42:21, skipping insertion in model container [2019-09-07 10:42:21,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:20" (2/3) ... [2019-09-07 10:42:21,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d09f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:42:21, skipping insertion in model container [2019-09-07 10:42:21,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:42:21" (3/3) ... [2019-09-07 10:42:21,080 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_vector_difference_ground.i [2019-09-07 10:42:21,090 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:42:21,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:42:21,115 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:42:21,149 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:42:21,150 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:42:21,150 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:42:21,150 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:42:21,150 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:42:21,150 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:42:21,151 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:42:21,151 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:42:21,151 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:42:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-07 10:42:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:42:21,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:21,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:21,179 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1498727252, now seen corresponding path program 1 times [2019-09-07 10:42:21,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:21,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:42:21,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:42:21,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:42:21,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:42:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:42:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:42:21,333 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-09-07 10:42:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:21,361 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-09-07 10:42:21,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:42:21,363 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:42:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:21,375 INFO L225 Difference]: With dead ends: 44 [2019-09-07 10:42:21,375 INFO L226 Difference]: Without dead ends: 21 [2019-09-07 10:42:21,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:42:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-07 10:42:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-07 10:42:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-07 10:42:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-07 10:42:21,437 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2019-09-07 10:42:21,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:21,437 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-07 10:42:21,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:42:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-07 10:42:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:42:21,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:21,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:21,442 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash 756064934, now seen corresponding path program 1 times [2019-09-07 10:42:21,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:21,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:42:21,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:42:21,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:42:21,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:42:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:42:21,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:42:21,569 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2019-09-07 10:42:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:21,665 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-09-07 10:42:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:42:21,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:42:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:21,669 INFO L225 Difference]: With dead ends: 37 [2019-09-07 10:42:21,669 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 10:42:21,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:42:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 10:42:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-07 10:42:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 10:42:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-07 10:42:21,677 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-09-07 10:42:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:21,677 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-07 10:42:21,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:42:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-07 10:42:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 10:42:21,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:21,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:21,680 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash 434016106, now seen corresponding path program 1 times [2019-09-07 10:42:21,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:21,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:42:21,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:21,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:21,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:21,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:42:21,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:42:21,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:21,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:42:21,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:42:21,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:42:21,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:42:21,962 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2019-09-07 10:42:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:22,027 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-09-07 10:42:22,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:42:22,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-07 10:42:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:22,029 INFO L225 Difference]: With dead ends: 41 [2019-09-07 10:42:22,029 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 10:42:22,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:42:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 10:42:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-07 10:42:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 10:42:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-07 10:42:22,039 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2019-09-07 10:42:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:22,039 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-07 10:42:22,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:42:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-07 10:42:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 10:42:22,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:22,041 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:22,041 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:22,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1099220258, now seen corresponding path program 2 times [2019-09-07 10:42:22,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:22,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:22,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:42:22,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:22,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:22,160 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-09-07 10:42:22,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:42:22,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:22,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:42:22,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:42:22,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:22,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:42:22,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:42:22,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:42:22,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:42:22,221 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-09-07 10:42:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:22,282 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-07 10:42:22,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:42:22,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-07 10:42:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:22,284 INFO L225 Difference]: With dead ends: 45 [2019-09-07 10:42:22,284 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 10:42:22,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:42:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 10:42:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-07 10:42:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 10:42:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-07 10:42:22,291 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2019-09-07 10:42:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:22,292 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-07 10:42:22,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:42:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-07 10:42:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 10:42:22,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:22,294 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:22,294 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:22,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1323870958, now seen corresponding path program 3 times [2019-09-07 10:42:22,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:22,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:22,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:22,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:42:22,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:22,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:22,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:22,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:42:22,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:22,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:42:22,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:42:22,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:22,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:42:22,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:42:22,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:42:22,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:42:22,489 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2019-09-07 10:42:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:22,576 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-07 10:42:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:42:22,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-07 10:42:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:22,578 INFO L225 Difference]: With dead ends: 49 [2019-09-07 10:42:22,578 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 10:42:22,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:42:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 10:42:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-07 10:42:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:42:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-07 10:42:22,587 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2019-09-07 10:42:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:22,587 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-07 10:42:22,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:42:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-07 10:42:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:42:22,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:22,589 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:22,589 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1351588766, now seen corresponding path program 4 times [2019-09-07 10:42:22,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:22,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:42:22,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:22,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:42:22,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:42:22,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:22,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:42:22,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:42:22,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:22,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:42:22,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:42:22,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:42:22,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:42:22,802 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2019-09-07 10:42:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:22,874 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-09-07 10:42:22,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:42:22,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-09-07 10:42:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:22,876 INFO L225 Difference]: With dead ends: 53 [2019-09-07 10:42:22,876 INFO L226 Difference]: Without dead ends: 36 [2019-09-07 10:42:22,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:42:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-07 10:42:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-07 10:42:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 10:42:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-09-07 10:42:22,883 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 27 [2019-09-07 10:42:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:22,883 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-09-07 10:42:22,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:42:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-09-07 10:42:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 10:42:22,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:22,884 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:22,885 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2074456690, now seen corresponding path program 5 times [2019-09-07 10:42:22,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:22,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:22,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:42:23,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:23,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:23,029 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:23,317 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 10:42:23,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:23,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:42:23,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:42:23,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:23,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:42:23,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:42:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:42:23,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:42:23,348 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 9 states. [2019-09-07 10:42:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:23,405 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-09-07 10:42:23,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:42:23,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-09-07 10:42:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:23,407 INFO L225 Difference]: With dead ends: 57 [2019-09-07 10:42:23,407 INFO L226 Difference]: Without dead ends: 39 [2019-09-07 10:42:23,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:42:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-07 10:42:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-07 10:42:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-07 10:42:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-07 10:42:23,414 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2019-09-07 10:42:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:23,415 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-07 10:42:23,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:42:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-07 10:42:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 10:42:23,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:23,416 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:23,416 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1266817510, now seen corresponding path program 6 times [2019-09-07 10:42:23,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:23,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:23,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:23,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:23,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:42:23,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:23,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:23,543 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:42:23,720 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:42:23,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:23,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:42:23,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:42:23,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:23,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:42:23,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:42:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:42:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:42:23,754 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 10 states. [2019-09-07 10:42:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:23,835 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-09-07 10:42:23,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:42:23,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-09-07 10:42:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:23,841 INFO L225 Difference]: With dead ends: 61 [2019-09-07 10:42:23,841 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:42:23,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:42:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:42:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-07 10:42:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 10:42:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-09-07 10:42:23,847 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 33 [2019-09-07 10:42:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:23,848 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-09-07 10:42:23,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:42:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-09-07 10:42:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 10:42:23,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:23,849 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:23,850 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1266096650, now seen corresponding path program 7 times [2019-09-07 10:42:23,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:23,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:23,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:23,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:23,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:42:23,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:23,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:23,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:24,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:42:24,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:42:24,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:24,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:42:24,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:42:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:42:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:42:24,053 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 11 states. [2019-09-07 10:42:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:24,135 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-07 10:42:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:42:24,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-09-07 10:42:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:24,144 INFO L225 Difference]: With dead ends: 65 [2019-09-07 10:42:24,145 INFO L226 Difference]: Without dead ends: 45 [2019-09-07 10:42:24,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:42:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-07 10:42:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-07 10:42:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 10:42:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-07 10:42:24,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2019-09-07 10:42:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:24,155 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-07 10:42:24,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:42:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-07 10:42:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:42:24,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:24,157 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:24,157 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:24,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:24,158 INFO L82 PathProgramCache]: Analyzing trace with hash -786668394, now seen corresponding path program 8 times [2019-09-07 10:42:24,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:24,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:42:24,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:24,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:24,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:24,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:42:24,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:24,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:42:24,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:42:24,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:24,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 10:42:24,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:42:24,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:42:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:42:24,391 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2019-09-07 10:42:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:24,472 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-09-07 10:42:24,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:42:24,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-09-07 10:42:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:24,474 INFO L225 Difference]: With dead ends: 69 [2019-09-07 10:42:24,474 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:42:24,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:42:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:42:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-07 10:42:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 10:42:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-09-07 10:42:24,487 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2019-09-07 10:42:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:24,488 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-09-07 10:42:24,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:42:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-09-07 10:42:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 10:42:24,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:24,491 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:24,491 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:24,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1232763526, now seen corresponding path program 9 times [2019-09-07 10:42:24,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:24,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:24,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:42:24,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:24,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:24,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:25,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:42:25,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:25,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:42:25,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 10:42:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:25,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:42:25,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:42:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:42:25,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:42:25,317 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 13 states. [2019-09-07 10:42:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:25,386 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-09-07 10:42:25,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:42:25,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2019-09-07 10:42:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:25,387 INFO L225 Difference]: With dead ends: 73 [2019-09-07 10:42:25,388 INFO L226 Difference]: Without dead ends: 51 [2019-09-07 10:42:25,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:42:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-07 10:42:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-07 10:42:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 10:42:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-07 10:42:25,400 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 42 [2019-09-07 10:42:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:25,401 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-07 10:42:25,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:42:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-07 10:42:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 10:42:25,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:25,404 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:25,404 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1346906350, now seen corresponding path program 10 times [2019-09-07 10:42:25,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:25,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:25,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:42:25,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:25,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:25,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:25,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:42:25,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:25,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:42:25,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:42:25,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:25,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:42:25,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:42:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:42:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:42:25,673 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2019-09-07 10:42:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:25,765 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-09-07 10:42:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:42:25,765 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-09-07 10:42:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:25,766 INFO L225 Difference]: With dead ends: 77 [2019-09-07 10:42:25,767 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 10:42:25,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:42:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 10:42:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-07 10:42:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 10:42:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-09-07 10:42:25,773 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 45 [2019-09-07 10:42:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:25,774 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-09-07 10:42:25,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:42:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-09-07 10:42:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 10:42:25,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:25,775 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:25,775 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:25,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1259262206, now seen corresponding path program 11 times [2019-09-07 10:42:25,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:25,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:25,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:42:25,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:25,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:53,845 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-07 10:42:53,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:53,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:42:53,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:42:53,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:53,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:42:53,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:42:53,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:42:53,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:42:53,912 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 15 states. [2019-09-07 10:42:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:53,991 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-09-07 10:42:53,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:42:53,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-09-07 10:42:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:53,992 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:42:53,992 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 10:42:53,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:42:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 10:42:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-07 10:42:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:42:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-07 10:42:54,003 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 48 [2019-09-07 10:42:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:54,003 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-07 10:42:54,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:42:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-07 10:42:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:42:54,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:54,004 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:54,005 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1692598898, now seen corresponding path program 12 times [2019-09-07 10:42:54,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:54,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:42:54,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:54,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:54,201 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:10,496 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:43:10,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:10,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:43:10,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:43:10,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:10,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:43:10,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:43:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:43:10,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:43:10,548 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 16 states. [2019-09-07 10:43:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:10,640 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-09-07 10:43:10,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:43:10,641 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-09-07 10:43:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:10,642 INFO L225 Difference]: With dead ends: 85 [2019-09-07 10:43:10,642 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 10:43:10,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:43:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 10:43:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-07 10:43:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-07 10:43:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-09-07 10:43:10,648 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 51 [2019-09-07 10:43:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:10,649 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-09-07 10:43:10,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:43:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-09-07 10:43:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 10:43:10,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:10,650 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:10,650 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:10,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1407711102, now seen corresponding path program 13 times [2019-09-07 10:43:10,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:10,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:10,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:10,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:10,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:43:10,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:10,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:43:10,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:10,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:43:10,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream Closed [2019-09-07 10:43:10,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:10,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:43:10,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:43:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:43:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:43:10,921 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 17 states. [2019-09-07 10:43:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:11,013 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-09-07 10:43:11,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:43:11,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-09-07 10:43:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:11,016 INFO L225 Difference]: With dead ends: 89 [2019-09-07 10:43:11,016 INFO L226 Difference]: Without dead ends: 63 [2019-09-07 10:43:11,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:43:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-07 10:43:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-07 10:43:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 10:43:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-07 10:43:11,021 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 54 [2019-09-07 10:43:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:11,022 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-07 10:43:11,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:43:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-07 10:43:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 10:43:11,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:11,023 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:11,023 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:11,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1147627510, now seen corresponding path program 14 times [2019-09-07 10:43:11,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:11,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:11,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:43:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:43:11,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:11,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:43:11,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:11,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:43:11,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:11,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:43:11,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:43:11,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:11,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:43:11,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:43:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:43:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:43:11,309 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 18 states. [2019-09-07 10:43:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:11,409 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-09-07 10:43:11,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:43:11,410 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-09-07 10:43:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:11,410 INFO L225 Difference]: With dead ends: 93 [2019-09-07 10:43:11,410 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 10:43:11,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:43:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 10:43:11,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-07 10:43:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 10:43:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-09-07 10:43:11,422 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 57 [2019-09-07 10:43:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:11,423 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-09-07 10:43:11,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:43:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-09-07 10:43:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 10:43:11,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:11,424 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:11,424 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -401314810, now seen corresponding path program 15 times [2019-09-07 10:43:11,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:11,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:11,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:11,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:43:11,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:11,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:43:11,645 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-09-07 10:43:16,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:43:16,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:16,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:43:16,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 29 proven. 120 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:43:16,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:16,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 21 [2019-09-07 10:43:16,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:43:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:43:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:43:16,395 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 21 states. [2019-09-07 10:43:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:16,524 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-09-07 10:43:16,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:43:16,525 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-09-07 10:43:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:16,525 INFO L225 Difference]: With dead ends: 99 [2019-09-07 10:43:16,526 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 10:43:16,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:43:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 10:43:16,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-09-07 10:43:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 10:43:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-09-07 10:43:16,531 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 60 [2019-09-07 10:43:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:16,532 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-09-07 10:43:16,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:43:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-09-07 10:43:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 10:43:16,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:16,533 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:16,533 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:16,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:16,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1173830538, now seen corresponding path program 16 times [2019-09-07 10:43:16,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:16,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:16,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:16,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:16,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:43:16,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:16,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:16,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:43:16,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:43:16,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:16,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:43:16,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:43:16,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:16,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:43:16,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:43:16,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:43:16,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:43:16,876 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 21 states. [2019-09-07 10:43:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:16,993 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2019-09-07 10:43:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:43:16,994 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-09-07 10:43:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:16,995 INFO L225 Difference]: With dead ends: 105 [2019-09-07 10:43:16,995 INFO L226 Difference]: Without dead ends: 75 [2019-09-07 10:43:16,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:43:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-07 10:43:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-09-07 10:43:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 10:43:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-09-07 10:43:17,003 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 66 [2019-09-07 10:43:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:17,003 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-09-07 10:43:17,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:43:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-09-07 10:43:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 10:43:17,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:17,004 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:17,004 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash 948316418, now seen corresponding path program 17 times [2019-09-07 10:43:17,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:17,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:17,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:17,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:43:17,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:17,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:17,285 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:44:31,891 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 10:44:31,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:31,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:44:31,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:44:31,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:31,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:44:31,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:44:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:44:31,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:44:31,991 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 22 states. [2019-09-07 10:44:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:32,121 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-09-07 10:44:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:44:32,121 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2019-09-07 10:44:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:32,122 INFO L225 Difference]: With dead ends: 109 [2019-09-07 10:44:32,122 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 10:44:32,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:44:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 10:44:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-07 10:44:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 10:44:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-09-07 10:44:32,127 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 69 [2019-09-07 10:44:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:32,128 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-09-07 10:44:32,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:44:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-09-07 10:44:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 10:44:32,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:32,129 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:32,129 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1456228594, now seen corresponding path program 18 times [2019-09-07 10:44:32,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:32,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:32,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:44:32,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:32,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:32,387 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:45:58,063 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-07 10:45:58,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:58,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:45:58,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 10:45:58,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:58,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:45:58,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:45:58,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:45:58,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:45:58,136 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 23 states. [2019-09-07 10:45:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:58,221 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-09-07 10:45:58,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:45:58,221 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-09-07 10:45:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:58,222 INFO L225 Difference]: With dead ends: 113 [2019-09-07 10:45:58,222 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 10:45:58,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:45:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 10:45:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-09-07 10:45:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 10:45:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-09-07 10:45:58,226 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-09-07 10:45:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:58,226 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-09-07 10:45:58,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:45:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-09-07 10:45:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:45:58,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:58,227 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:58,228 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1257136258, now seen corresponding path program 19 times [2019-09-07 10:45:58,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:58,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:58,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:58,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:45:58,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:58,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:58,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:45:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:58,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:45:58,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:45:58,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:58,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:45:58,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:45:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:45:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:45:58,685 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 24 states. [2019-09-07 10:45:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:58,833 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-09-07 10:45:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:45:58,833 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-07 10:45:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:58,834 INFO L225 Difference]: With dead ends: 117 [2019-09-07 10:45:58,835 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 10:45:58,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:45:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 10:45:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-07 10:45:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 10:45:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-09-07 10:45:58,839 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 75 [2019-09-07 10:45:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:58,840 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-09-07 10:45:58,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:45:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-09-07 10:45:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 10:45:58,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:58,841 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:58,841 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash -172155246, now seen corresponding path program 20 times [2019-09-07 10:45:58,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:58,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:58,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:45:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-07 10:45:59,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:59,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:59,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:45:59,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:45:59,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:59,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:45:59,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-07 10:45:59,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:59,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:45:59,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:45:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:45:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:45:59,257 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 25 states. [2019-09-07 10:45:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:59,380 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-09-07 10:45:59,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:45:59,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2019-09-07 10:45:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:59,384 INFO L225 Difference]: With dead ends: 121 [2019-09-07 10:45:59,385 INFO L226 Difference]: Without dead ends: 87 [2019-09-07 10:45:59,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:45:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-07 10:45:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-09-07 10:45:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 10:45:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-09-07 10:45:59,389 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 78 [2019-09-07 10:45:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:59,389 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-09-07 10:45:59,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:45:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-09-07 10:45:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 10:45:59,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:59,391 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:59,391 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash -555316742, now seen corresponding path program 21 times [2019-09-07 10:45:59,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:59,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 10:45:59,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:59,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:59,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:46:19,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:46:19,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:19,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:46:19,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 10:46:19,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:19,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:46:19,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:46:19,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:46:19,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:46:19,659 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 26 states. [2019-09-07 10:46:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:19,799 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-09-07 10:46:19,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:46:19,801 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2019-09-07 10:46:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:19,802 INFO L225 Difference]: With dead ends: 125 [2019-09-07 10:46:19,802 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 10:46:19,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:46:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 10:46:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-07 10:46:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 10:46:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-09-07 10:46:19,807 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 81 [2019-09-07 10:46:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:19,808 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-09-07 10:46:19,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:46:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-09-07 10:46:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 10:46:19,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:19,809 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:19,809 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1946595862, now seen corresponding path program 22 times [2019-09-07 10:46:19,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:19,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:19,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 10:46:20,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:20,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:20,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:20,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:20,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:20,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:46:20,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 10:46:20,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:46:20,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:46:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:46:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:46:20,256 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 27 states. [2019-09-07 10:46:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:20,408 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-09-07 10:46:20,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:46:20,411 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2019-09-07 10:46:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:20,412 INFO L225 Difference]: With dead ends: 129 [2019-09-07 10:46:20,412 INFO L226 Difference]: Without dead ends: 93 [2019-09-07 10:46:20,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:46:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-07 10:46:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-07 10:46:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-07 10:46:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-07 10:46:20,418 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 84 [2019-09-07 10:46:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:20,418 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-07 10:46:20,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:46:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-07 10:46:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:46:20,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:20,419 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:20,420 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1439803510, now seen corresponding path program 23 times [2019-09-07 10:46:20,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:20,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:20,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:20,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:20,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 10:46:20,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:20,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:20,802 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:48:36,184 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-07 10:48:36,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:48:36,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:48:36,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 10:48:36,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:36,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:48:36,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:48:36,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:48:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:48:36,287 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 28 states. [2019-09-07 10:48:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:36,465 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-09-07 10:48:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:48:36,470 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2019-09-07 10:48:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:36,471 INFO L225 Difference]: With dead ends: 133 [2019-09-07 10:48:36,471 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 10:48:36,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:48:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 10:48:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-07 10:48:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 10:48:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-09-07 10:48:36,479 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 87 [2019-09-07 10:48:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:36,479 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2019-09-07 10:48:36,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:48:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2019-09-07 10:48:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 10:48:36,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:36,480 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:36,480 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash 889434522, now seen corresponding path program 24 times [2019-09-07 10:48:36,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:36,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:36,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:48:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-07 10:48:36,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:36,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:48:36,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:51:16,679 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-09-07 10:51:16,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:16,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:51:16,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 10:51:16,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:16,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:51:16,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:51:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:51:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:51:16,762 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 29 states. [2019-09-07 10:51:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:16,930 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2019-09-07 10:51:16,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:51:16,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2019-09-07 10:51:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:16,937 INFO L225 Difference]: With dead ends: 137 [2019-09-07 10:51:16,937 INFO L226 Difference]: Without dead ends: 99 [2019-09-07 10:51:16,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:51:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-07 10:51:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-09-07 10:51:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 10:51:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-07 10:51:16,944 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 90 [2019-09-07 10:51:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:16,945 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-07 10:51:16,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:51:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-07 10:51:16,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 10:51:16,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:16,946 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:16,946 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1059044082, now seen corresponding path program 25 times [2019-09-07 10:51:16,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:16,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:16,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:16,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:16,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-09-07 10:51:17,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:17,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:51:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:17,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:51:17,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-09-07 10:51:17,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:17,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:51:17,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:51:17,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:51:17,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:51:17,466 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 30 states. [2019-09-07 10:51:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:17,655 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2019-09-07 10:51:17,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:51:17,655 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2019-09-07 10:51:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:17,656 INFO L225 Difference]: With dead ends: 141 [2019-09-07 10:51:17,656 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 10:51:17,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:51:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 10:51:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-07 10:51:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 10:51:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-09-07 10:51:17,662 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 93 [2019-09-07 10:51:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:17,662 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-09-07 10:51:17,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:51:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-09-07 10:51:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 10:51:17,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:17,663 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:17,664 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:17,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1982291230, now seen corresponding path program 26 times [2019-09-07 10:51:17,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:17,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:17,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:51:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-07 10:51:18,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:18,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:51:18,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:18,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:51:18,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:18,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:51:18,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:51:18,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:18,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:51:18,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:51:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:51:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:51:18,392 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 31 states. [2019-09-07 10:51:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:18,590 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2019-09-07 10:51:18,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:51:18,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 96 [2019-09-07 10:51:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:18,591 INFO L225 Difference]: With dead ends: 145 [2019-09-07 10:51:18,591 INFO L226 Difference]: Without dead ends: 105 [2019-09-07 10:51:18,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:51:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-07 10:51:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-07 10:51:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 10:51:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-07 10:51:18,597 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 96 [2019-09-07 10:51:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:18,597 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-07 10:51:18,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:51:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-07 10:51:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:51:18,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:18,598 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:18,598 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash -509771410, now seen corresponding path program 27 times [2019-09-07 10:51:18,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:18,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:18,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-09-07 10:51:19,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:19,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:19,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:52:18,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:52:18,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:52:18,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:52:18,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:52:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 55 proven. 406 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 10:52:18,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:52:18,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 34 [2019-09-07 10:52:18,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:52:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:52:18,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:52:18,201 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 34 states. [2019-09-07 10:52:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:52:18,446 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2019-09-07 10:52:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:52:18,446 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2019-09-07 10:52:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:52:18,447 INFO L225 Difference]: With dead ends: 151 [2019-09-07 10:52:18,447 INFO L226 Difference]: Without dead ends: 110 [2019-09-07 10:52:18,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:52:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-07 10:52:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-09-07 10:52:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-07 10:52:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-09-07 10:52:18,456 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 99 [2019-09-07 10:52:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:52:18,456 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-09-07 10:52:18,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:52:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-09-07 10:52:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 10:52:18,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:52:18,457 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:52:18,457 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:52:18,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:52:18,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1100463082, now seen corresponding path program 28 times [2019-09-07 10:52:18,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:52:18,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:52:18,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:18,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:52:18,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:52:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-07 10:52:19,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:52:19,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:52:19,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:52:19,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:52:19,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:52:19,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:52:19,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:52:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-07 10:52:19,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:52:19,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:52:19,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:52:19,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:52:19,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:52:19,194 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 34 states. [2019-09-07 10:52:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:52:19,403 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2019-09-07 10:52:19,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:52:19,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 105 [2019-09-07 10:52:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:52:19,409 INFO L225 Difference]: With dead ends: 157 [2019-09-07 10:52:19,409 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 10:52:19,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:52:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 10:52:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-07 10:52:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-07 10:52:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2019-09-07 10:52:19,414 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 105 [2019-09-07 10:52:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:52:19,415 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2019-09-07 10:52:19,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:52:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2019-09-07 10:52:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 10:52:19,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:52:19,416 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:52:19,416 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:52:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:52:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1523599322, now seen corresponding path program 29 times [2019-09-07 10:52:19,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:52:19,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:52:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:19,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:52:19,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:52:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-07 10:52:19,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:52:19,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:52:20,025 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:55:25,179 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-07 10:55:25,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:55:25,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:55:25,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:55:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-07 10:55:25,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:55:25,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:55:25,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:55:25,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:55:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:55:25,323 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 35 states. [2019-09-07 10:55:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:55:25,526 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2019-09-07 10:55:25,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:55:25,526 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2019-09-07 10:55:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:55:25,528 INFO L225 Difference]: With dead ends: 161 [2019-09-07 10:55:25,528 INFO L226 Difference]: Without dead ends: 117 [2019-09-07 10:55:25,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:55:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-07 10:55:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-09-07 10:55:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 10:55:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-09-07 10:55:25,533 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 108 [2019-09-07 10:55:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:55:25,533 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-09-07 10:55:25,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:55:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-09-07 10:55:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:55:25,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:55:25,534 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:55:25,535 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:55:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:55:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1126487450, now seen corresponding path program 30 times [2019-09-07 10:55:25,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:55:25,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:55:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:55:25,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:55:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:55:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:55:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-07 10:55:26,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:55:26,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:55:26,180 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE