java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_04.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:34:01,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:34:01,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:34:01,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:34:01,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:34:01,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:34:01,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:34:01,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:34:01,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:34:01,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:34:01,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:34:01,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:34:01,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:34:01,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:34:01,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:34:01,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:34:01,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:34:01,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:34:01,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:34:01,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:34:01,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:34:01,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:34:01,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:34:01,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:34:01,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:34:01,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:34:01,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:34:01,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:34:01,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:34:01,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:34:01,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:34:01,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:34:01,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:34:01,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:34:01,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:34:01,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:34:01,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:34:01,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:34:01,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:34:01,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:34:01,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:34:01,148 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:34:01,163 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:34:01,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:34:01,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:34:01,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:34:01,165 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:34:01,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:34:01,166 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:34:01,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:34:01,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:34:01,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:34:01,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:34:01,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:34:01,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:34:01,167 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:34:01,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:34:01,168 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:34:01,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:34:01,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:34:01,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:34:01,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:34:01,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:34:01,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:34:01,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:34:01,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:34:01,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:34:01,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:34:01,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:34:01,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:34:01,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:34:01,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:34:01,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:34:01,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:34:01,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:34:01,220 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:34:01,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_04.i [2019-09-07 10:34:01,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a339638a/1a034ab42dfa45cca00047366add60b0/FLAG78bc5ad78 [2019-09-07 10:34:01,727 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:34:01,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_04.i [2019-09-07 10:34:01,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a339638a/1a034ab42dfa45cca00047366add60b0/FLAG78bc5ad78 [2019-09-07 10:34:02,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a339638a/1a034ab42dfa45cca00047366add60b0 [2019-09-07 10:34:02,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:34:02,155 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:34:02,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:34:02,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:34:02,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:34:02,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a070ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02, skipping insertion in model container [2019-09-07 10:34:02,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,175 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:34:02,193 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:34:02,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:34:02,405 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:34:02,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:34:02,447 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:34:02,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02 WrapperNode [2019-09-07 10:34:02,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:34:02,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:34:02,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:34:02,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:34:02,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (1/1) ... [2019-09-07 10:34:02,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:34:02,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:34:02,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:34:02,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:34:02,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (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:34:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:34:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:34:02,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:34:02,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:34:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:34:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:34:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:34:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:34:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:34:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:34:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:34:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:34:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:34:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:34:02,878 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:34:02,878 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:34:02,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:34:02 BoogieIcfgContainer [2019-09-07 10:34:02,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:34:02,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:34:02,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:34:02,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:34:02,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:34:02" (1/3) ... [2019-09-07 10:34:02,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b61268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:34:02, skipping insertion in model container [2019-09-07 10:34:02,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:02" (2/3) ... [2019-09-07 10:34:02,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b61268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:34:02, skipping insertion in model container [2019-09-07 10:34:02,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:34:02" (3/3) ... [2019-09-07 10:34:02,889 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_04.i [2019-09-07 10:34:02,902 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:34:02,910 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:34:02,934 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:34:02,973 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:34:02,974 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:34:02,974 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:34:02,974 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:34:02,974 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:34:02,975 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:34:02,975 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:34:02,975 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:34:02,975 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:34:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-07 10:34:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:34:03,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:03,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:03,009 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2019-09-07 10:34:03,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:03,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:03,170 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:34:03,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:34:03,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:34:03,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:34:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:34:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:34:03,190 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-07 10:34:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:03,216 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-09-07 10:34:03,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:34:03,218 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:34:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:03,227 INFO L225 Difference]: With dead ends: 41 [2019-09-07 10:34:03,227 INFO L226 Difference]: Without dead ends: 19 [2019-09-07 10:34:03,231 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:34:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-07 10:34:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-07 10:34:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-07 10:34:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-07 10:34:03,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-09-07 10:34:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:03,278 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-07 10:34:03,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:34:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-07 10:34:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:34:03,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:03,279 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:03,280 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:03,280 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2019-09-07 10:34:03,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:03,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:03,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:03,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:03,350 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:34:03,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:34:03,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:34:03,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:34:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:34:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:34:03,353 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-09-07 10:34:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:03,416 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-07 10:34:03,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:34:03,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:34:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:03,418 INFO L225 Difference]: With dead ends: 32 [2019-09-07 10:34:03,418 INFO L226 Difference]: Without dead ends: 20 [2019-09-07 10:34:03,419 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:34:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-07 10:34:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-07 10:34:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-07 10:34:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-07 10:34:03,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2019-09-07 10:34:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:03,426 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-07 10:34:03,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:34:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-07 10:34:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 10:34:03,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:03,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:03,428 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:03,429 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2019-09-07 10:34:03,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:34:03,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:34:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:34:03,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:34:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:34:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:34:03,493 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-09-07 10:34:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:03,555 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-07 10:34:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:34:03,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 10:34:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:03,559 INFO L225 Difference]: With dead ends: 34 [2019-09-07 10:34:03,560 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 10:34:03,562 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:34:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 10:34:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-07 10:34:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-07 10:34:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-07 10:34:03,585 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-09-07 10:34:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:03,592 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-07 10:34:03,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:34:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-07 10:34:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 10:34:03,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:03,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:03,595 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2019-09-07 10:34:03,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:03,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:03,721 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:34:03,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:03,721 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) [2019-09-07 10:34:03,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:03,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:34:03,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:03,822 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:34:03,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:03,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:34:03,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:34:03,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:34:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:34:03,831 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2019-09-07 10:34:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:03,890 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-07 10:34:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:34:03,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-07 10:34:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:03,893 INFO L225 Difference]: With dead ends: 38 [2019-09-07 10:34:03,893 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 10:34:03,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:34:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 10:34:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-09-07 10:34:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:34:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-07 10:34:03,899 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2019-09-07 10:34:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:03,900 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-07 10:34:03,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:34:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-07 10:34:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 10:34:03,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:03,901 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:03,901 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1302144745, now seen corresponding path program 2 times [2019-09-07 10:34:03,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:03,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:03,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:03,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:34:03,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:03,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:04,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:34:04,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:34:04,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:04,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:34:04,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:34:04,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:04,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:34:04,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:34:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:34:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:34:04,077 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-09-07 10:34:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:04,158 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-09-07 10:34:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:34:04,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-09-07 10:34:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:04,160 INFO L225 Difference]: With dead ends: 39 [2019-09-07 10:34:04,160 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 10:34:04,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:34:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 10:34:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-07 10:34:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 10:34:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-07 10:34:04,166 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-07 10:34:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:04,167 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-07 10:34:04,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:34:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-07 10:34:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:34:04,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:04,168 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:04,168 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash 561287237, now seen corresponding path program 3 times [2019-09-07 10:34:04,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:04,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:34:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:04,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:04,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:34:04,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 10:34:04,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:04,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:34:04,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:34:04,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:04,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-09-07 10:34:04,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:34:04,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:34:04,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:34:04,322 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2019-09-07 10:34:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:04,438 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-07 10:34:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:34:04,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-07 10:34:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:04,440 INFO L225 Difference]: With dead ends: 45 [2019-09-07 10:34:04,440 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 10:34:04,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:34:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 10:34:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-09-07 10:34:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 10:34:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-07 10:34:04,452 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2019-09-07 10:34:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:04,453 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-07 10:34:04,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:34:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-07 10:34:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 10:34:04,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:04,456 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:04,456 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash 53593642, now seen corresponding path program 4 times [2019-09-07 10:34:04,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:04,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:04,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:04,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:34:04,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:04,550 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:34:04,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:34:04,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:34:04,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:04,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:34:04,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:34:04,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:04,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:34:04,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:34:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:34:04,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:34:04,628 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2019-09-07 10:34:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:04,717 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-09-07 10:34:04,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:34:04,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-07 10:34:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:04,718 INFO L225 Difference]: With dead ends: 47 [2019-09-07 10:34:04,719 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 10:34:04,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:34:04,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 10:34:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-09-07 10:34:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 10:34:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-07 10:34:04,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2019-09-07 10:34:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:04,725 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-07 10:34:04,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:34:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-07 10:34:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:34:04,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:04,726 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:04,727 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:04,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash -532864634, now seen corresponding path program 5 times [2019-09-07 10:34:04,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:04,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:04,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:34:04,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:04,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:04,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:34:04,878 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-07 10:34:04,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:04,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:34:04,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:34:04,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:04,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:34:04,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:34:04,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:34:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:34:04,910 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 10 states. [2019-09-07 10:34:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:04,984 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-09-07 10:34:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:34:04,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-09-07 10:34:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:04,985 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:34:04,986 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 10:34:04,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 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:34:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 10:34:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-09-07 10:34:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:34:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-07 10:34:04,992 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-09-07 10:34:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:04,992 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-07 10:34:04,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:34:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-07 10:34:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 10:34:04,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:04,994 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:04,994 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1533202006, now seen corresponding path program 6 times [2019-09-07 10:34:04,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:04,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:04,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:04,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:04,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:34:05,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:05,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:34:05,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:05,180 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-09-07 10:34:05,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:05,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:34:05,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:34:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2019-09-07 10:34:05,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:34:05,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:34:05,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:34:05,217 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 11 states. [2019-09-07 10:34:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:05,361 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-07 10:34:05,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:34:05,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-07 10:34:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:05,363 INFO L225 Difference]: With dead ends: 54 [2019-09-07 10:34:05,363 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 10:34:05,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:34:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 10:34:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-09-07 10:34:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 10:34:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-07 10:34:05,370 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2019-09-07 10:34:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:05,370 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-07 10:34:05,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:34:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-07 10:34:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:34:05,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:05,371 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:05,372 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:05,372 INFO L82 PathProgramCache]: Analyzing trace with hash 73394789, now seen corresponding path program 7 times [2019-09-07 10:34:05,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:05,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:05,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:05,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:05,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:34:05,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:05,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:05,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:05,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:34:05,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:34:05,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:05,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:34:05,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:34:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:34:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:34:05,619 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 13 states. [2019-09-07 10:34:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:05,702 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-09-07 10:34:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:34:05,703 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-09-07 10:34:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:05,704 INFO L225 Difference]: With dead ends: 56 [2019-09-07 10:34:05,704 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 10:34:05,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:34:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 10:34:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-09-07 10:34:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:34:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-07 10:34:05,710 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2019-09-07 10:34:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:05,710 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-07 10:34:05,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:34:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-07 10:34:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 10:34:05,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:05,712 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:05,712 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2083735689, now seen corresponding path program 8 times [2019-09-07 10:34:05,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:05,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:05,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:34:05,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:05,846 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:34:05,876 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:34:05,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:34:05,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:05,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:34:05,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:34:05,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:05,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:34:05,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:34:05,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:34:05,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:34:05,938 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 14 states. [2019-09-07 10:34:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:06,042 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-09-07 10:34:06,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:34:06,043 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-09-07 10:34:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:06,044 INFO L225 Difference]: With dead ends: 57 [2019-09-07 10:34:06,044 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:34:06,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:34:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:34:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-09-07 10:34:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 10:34:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-07 10:34:06,050 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2019-09-07 10:34:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:06,050 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-07 10:34:06,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:34:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-07 10:34:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 10:34:06,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:06,051 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:06,052 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash -20205851, now seen corresponding path program 9 times [2019-09-07 10:34:06,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:06,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:06,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:34:06,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:06,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:06,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:34:06,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:34:06,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:06,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:34:06,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:34:06,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:06,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 15 [2019-09-07 10:34:06,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:34:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:34:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:34:06,324 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 15 states. [2019-09-07 10:34:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:06,446 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-09-07 10:34:06,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:34:06,449 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-09-07 10:34:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:06,449 INFO L225 Difference]: With dead ends: 63 [2019-09-07 10:34:06,449 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:34:06,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:34:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:34:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2019-09-07 10:34:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-07 10:34:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-07 10:34:06,461 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2019-09-07 10:34:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:06,461 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-07 10:34:06,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:34:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-07 10:34:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 10:34:06,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:06,467 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:06,467 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash 527833994, now seen corresponding path program 10 times [2019-09-07 10:34:06,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:06,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:06,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:34:06,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:06,683 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:34:06,702 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:34:06,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:34:06,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:06,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:34:06,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 10 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:34:06,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:06,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:34:06,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:34:06,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:34:06,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:34:06,760 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 17 states. [2019-09-07 10:34:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:06,886 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-09-07 10:34:06,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:34:06,888 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-09-07 10:34:06,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:06,888 INFO L225 Difference]: With dead ends: 65 [2019-09-07 10:34:06,889 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 10:34:06,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 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:34:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 10:34:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2019-09-07 10:34:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 10:34:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-09-07 10:34:06,895 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2019-09-07 10:34:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:06,895 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-09-07 10:34:06,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:34:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-09-07 10:34:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 10:34:06,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:06,896 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:06,897 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:06,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:06,897 INFO L82 PathProgramCache]: Analyzing trace with hash 947647462, now seen corresponding path program 11 times [2019-09-07 10:34:06,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:06,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:06,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:06,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:34:07,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:07,109 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:34:07,131 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:34:07,479 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 10:34:07,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:07,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:34:07,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:34:07,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:07,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:34:07,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:34:07,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:34:07,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:34:07,520 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 18 states. [2019-09-07 10:34:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:07,633 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-09-07 10:34:07,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:34:07,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-09-07 10:34:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:07,635 INFO L225 Difference]: With dead ends: 66 [2019-09-07 10:34:07,635 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 10:34:07,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 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:34:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 10:34:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-09-07 10:34:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-07 10:34:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-07 10:34:07,641 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2019-09-07 10:34:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:07,641 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-07 10:34:07,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:34:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-07 10:34:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 10:34:07,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:07,643 INFO L399 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:07,643 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:07,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1076963082, now seen corresponding path program 12 times [2019-09-07 10:34:07,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:07,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:07,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:07,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:07,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:34:07,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:07,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:07,861 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:34:07,896 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 10:34:07,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:07,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:34:07,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:34:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:07,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 19 [2019-09-07 10:34:07,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:34:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:34:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:34:07,928 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 19 states. [2019-09-07 10:34:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:08,066 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-09-07 10:34:08,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:34:08,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-09-07 10:34:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:08,068 INFO L225 Difference]: With dead ends: 72 [2019-09-07 10:34:08,068 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 10:34:08,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:34:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 10:34:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-09-07 10:34:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 10:34:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-09-07 10:34:08,074 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2019-09-07 10:34:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:08,074 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-09-07 10:34:08,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:34:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-09-07 10:34:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 10:34:08,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:08,076 INFO L399 BasicCegarLoop]: trace histogram [17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:08,076 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash 777453829, now seen corresponding path program 13 times [2019-09-07 10:34:08,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:08,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:08,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:34:08,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:08,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:08,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:08,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:34:08,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:34:08,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:08,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:34:08,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:34:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:34:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:34:08,408 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 21 states. [2019-09-07 10:34:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:08,558 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-09-07 10:34:08,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:34:08,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-09-07 10:34:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:08,560 INFO L225 Difference]: With dead ends: 74 [2019-09-07 10:34:08,561 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 10:34:08,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:34:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 10:34:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2019-09-07 10:34:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 10:34:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-07 10:34:08,572 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2019-09-07 10:34:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:08,572 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-07 10:34:08,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:34:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-07 10:34:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 10:34:08,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:08,575 INFO L399 BasicCegarLoop]: trace histogram [18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:08,576 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:08,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash 607519273, now seen corresponding path program 14 times [2019-09-07 10:34:08,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:08,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:08,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:08,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:08,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:34:08,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:08,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:08,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:34:08,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:34:08,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:08,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:34:08,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:34:08,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:08,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:34:08,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:34:08,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:34:08,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:34:08,884 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 22 states. [2019-09-07 10:34:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:09,022 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-09-07 10:34:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:34:09,024 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-09-07 10:34:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:09,025 INFO L225 Difference]: With dead ends: 75 [2019-09-07 10:34:09,025 INFO L226 Difference]: Without dead ends: 58 [2019-09-07 10:34:09,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 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:34:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-07 10:34:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2019-09-07 10:34:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 10:34:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-09-07 10:34:09,031 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2019-09-07 10:34:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:09,031 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-09-07 10:34:09,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:34:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-09-07 10:34:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:34:09,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:09,032 INFO L399 BasicCegarLoop]: trace histogram [19, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:09,032 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -365484667, now seen corresponding path program 15 times [2019-09-07 10:34:09,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:09,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:09,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:09,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:09,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 10:34:09,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:09,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:09,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:34:09,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:34:09,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:09,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:34:09,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:34:09,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:09,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 23 [2019-09-07 10:34:09,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:34:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:34:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:34:09,439 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 23 states. [2019-09-07 10:34:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:09,610 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-09-07 10:34:09,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:34:09,613 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-09-07 10:34:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:09,614 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:34:09,614 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 10:34:09,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:34:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 10:34:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2019-09-07 10:34:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 10:34:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-07 10:34:09,620 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2019-09-07 10:34:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:09,620 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-07 10:34:09,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:34:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-07 10:34:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 10:34:09,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:09,622 INFO L399 BasicCegarLoop]: trace histogram [21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:09,622 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:09,622 INFO L82 PathProgramCache]: Analyzing trace with hash 657004778, now seen corresponding path program 16 times [2019-09-07 10:34:09,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:09,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:09,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:09,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:09,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:34:09,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:09,917 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:34:09,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:34:09,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:34:09,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:09,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:34:09,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:34:10,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:10,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:34:10,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:34:10,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:34:10,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:34:10,021 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 25 states. [2019-09-07 10:34:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:10,185 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-09-07 10:34:10,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:34:10,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-09-07 10:34:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:10,186 INFO L225 Difference]: With dead ends: 83 [2019-09-07 10:34:10,186 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 10:34:10,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 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:34:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 10:34:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-09-07 10:34:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 10:34:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-09-07 10:34:10,192 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2019-09-07 10:34:10,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:10,192 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-09-07 10:34:10,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:34:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-09-07 10:34:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:34:10,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:10,194 INFO L399 BasicCegarLoop]: trace histogram [22, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:10,194 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:10,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:10,194 INFO L82 PathProgramCache]: Analyzing trace with hash -151966138, now seen corresponding path program 17 times [2019-09-07 10:34:10,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:10,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:10,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:10,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:10,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:34:10,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:10,486 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:34:10,496 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:34:12,930 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-07 10:34:12,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:12,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:34:12,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:34:12,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:12,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:34:12,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:34:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:34:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:34:12,975 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 26 states. [2019-09-07 10:34:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:13,098 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-09-07 10:34:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:34:13,099 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2019-09-07 10:34:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:13,100 INFO L225 Difference]: With dead ends: 84 [2019-09-07 10:34:13,100 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 10:34:13,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 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:34:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 10:34:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2019-09-07 10:34:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:34:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-07 10:34:13,107 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 43 [2019-09-07 10:34:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:13,108 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-07 10:34:13,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:34:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-07 10:34:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 10:34:13,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:13,109 INFO L399 BasicCegarLoop]: trace histogram [23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:13,109 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 539739242, now seen corresponding path program 18 times [2019-09-07 10:34:13,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:13,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:13,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:13,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:34:13,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:13,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:34:13,586 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:34:13,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:13,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:34:13,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 10:34:13,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:13,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 27 [2019-09-07 10:34:13,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:34:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:34:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:34:13,644 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 27 states. [2019-09-07 10:34:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:13,857 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-09-07 10:34:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:34:13,858 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2019-09-07 10:34:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:13,859 INFO L225 Difference]: With dead ends: 90 [2019-09-07 10:34:13,859 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 10:34:13,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:34:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 10:34:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2019-09-07 10:34:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 10:34:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-09-07 10:34:13,865 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 44 [2019-09-07 10:34:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:13,865 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-09-07 10:34:13,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:34:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-09-07 10:34:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:34:13,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:13,866 INFO L399 BasicCegarLoop]: trace histogram [25, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:13,867 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash 79982501, now seen corresponding path program 19 times [2019-09-07 10:34:13,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:13,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:13,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:34:14,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:14,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:14,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:14,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:34:14,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:34:14,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:14,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:34:14,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:34:14,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:34:14,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:34:14,407 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 29 states. [2019-09-07 10:34:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:14,572 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2019-09-07 10:34:14,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:34:14,575 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2019-09-07 10:34:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:14,576 INFO L225 Difference]: With dead ends: 92 [2019-09-07 10:34:14,576 INFO L226 Difference]: Without dead ends: 73 [2019-09-07 10:34:14,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 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:34:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-07 10:34:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2019-09-07 10:34:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:34:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-07 10:34:14,583 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2019-09-07 10:34:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:14,583 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-07 10:34:14,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:34:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-07 10:34:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 10:34:14,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:14,584 INFO L399 BasicCegarLoop]: trace histogram [26, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:14,584 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:14,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1153389513, now seen corresponding path program 20 times [2019-09-07 10:34:14,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:14,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:14,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:14,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:34:14,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:14,959 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:34:14,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:34:15,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:34:15,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:15,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:34:15,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:34:15,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:15,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:34:15,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:34:15,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:34:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:34:15,057 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 30 states. [2019-09-07 10:34:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:15,265 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2019-09-07 10:34:15,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:34:15,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2019-09-07 10:34:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:15,267 INFO L225 Difference]: With dead ends: 93 [2019-09-07 10:34:15,267 INFO L226 Difference]: Without dead ends: 74 [2019-09-07 10:34:15,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 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:34:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-07 10:34:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2019-09-07 10:34:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 10:34:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-09-07 10:34:15,273 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2019-09-07 10:34:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:15,273 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-09-07 10:34:15,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:34:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-09-07 10:34:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 10:34:15,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:15,274 INFO L399 BasicCegarLoop]: trace histogram [27, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:15,274 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:15,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:15,275 INFO L82 PathProgramCache]: Analyzing trace with hash 69268517, now seen corresponding path program 21 times [2019-09-07 10:34:15,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:15,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:15,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:15,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:15,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 10:34:15,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:15,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:15,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:34:15,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 10:34:15,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:15,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:34:15,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-07 10:34:15,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:15,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 31 [2019-09-07 10:34:15,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:34:15,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:34:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:34:15,961 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 31 states. [2019-09-07 10:34:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:16,193 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2019-09-07 10:34:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:34:16,194 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2019-09-07 10:34:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:16,195 INFO L225 Difference]: With dead ends: 99 [2019-09-07 10:34:16,195 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 10:34:16,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:34:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 10:34:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2019-09-07 10:34:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:34:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-07 10:34:16,201 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 49 [2019-09-07 10:34:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:16,201 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-07 10:34:16,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:34:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-07 10:34:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 10:34:16,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:16,202 INFO L399 BasicCegarLoop]: trace histogram [29, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:16,203 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1323254198, now seen corresponding path program 22 times [2019-09-07 10:34:16,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:16,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:16,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:16,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:16,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:34:16,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:16,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:16,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:34:16,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:34:16,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:16,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:34:16,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:34:16,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:16,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:34:16,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:34:16,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:34:16,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:34:16,747 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 33 states. [2019-09-07 10:34:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:16,972 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-09-07 10:34:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:34:16,973 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2019-09-07 10:34:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:16,974 INFO L225 Difference]: With dead ends: 101 [2019-09-07 10:34:16,974 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 10:34:16,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:34:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 10:34:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2019-09-07 10:34:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-07 10:34:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-09-07 10:34:16,980 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 52 [2019-09-07 10:34:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:16,981 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-09-07 10:34:16,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:34:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-09-07 10:34:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 10:34:16,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:16,982 INFO L399 BasicCegarLoop]: trace histogram [30, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:16,982 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1413295962, now seen corresponding path program 23 times [2019-09-07 10:34:16,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:16,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:16,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:16,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:16,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:34:17,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:17,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:34:17,571 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:31,797 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-07 10:34:31,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:31,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:34:31,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:34:31,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:34:31,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:34:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:34:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:34:31,850 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 34 states. [2019-09-07 10:34:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:32,095 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2019-09-07 10:34:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:34:32,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2019-09-07 10:34:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:32,097 INFO L225 Difference]: With dead ends: 102 [2019-09-07 10:34:32,098 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 10:34:32,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 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:34:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 10:34:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-09-07 10:34:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 10:34:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-07 10:34:32,104 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 53 [2019-09-07 10:34:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:32,104 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-07 10:34:32,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:34:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-07 10:34:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 10:34:32,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:32,105 INFO L399 BasicCegarLoop]: trace histogram [31, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:32,105 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:32,106 INFO L82 PathProgramCache]: Analyzing trace with hash 90376650, now seen corresponding path program 24 times [2019-09-07 10:34:32,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:32,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:32,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:32,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:32,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:34:32,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:32,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:34:32,705 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:33,689 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 10:34:33,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:33,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:34:33,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-07 10:34:33,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:33,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 35 [2019-09-07 10:34:33,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:34:33,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:34:33,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:34:33,744 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 35 states. [2019-09-07 10:34:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:34,009 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2019-09-07 10:34:34,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:34:34,009 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 54 [2019-09-07 10:34:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:34,011 INFO L225 Difference]: With dead ends: 108 [2019-09-07 10:34:34,011 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 10:34:34,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:34:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 10:34:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61. [2019-09-07 10:34:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 10:34:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-07 10:34:34,016 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 54 [2019-09-07 10:34:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:34,017 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-07 10:34:34,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:34:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-07 10:34:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 10:34:34,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:34,018 INFO L399 BasicCegarLoop]: trace histogram [33, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:34,018 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:34,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:34,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2006070853, now seen corresponding path program 25 times [2019-09-07 10:34:34,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:34,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:34,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:34,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:34,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:34:34,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:34,609 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:34:34,626 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:34:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:34,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:34:34,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:34:34,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:34,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-07 10:34:34,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:34:34,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:34:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:34:34,727 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 37 states. [2019-09-07 10:34:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:35,071 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2019-09-07 10:34:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:34:35,072 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2019-09-07 10:34:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:35,073 INFO L225 Difference]: With dead ends: 110 [2019-09-07 10:34:35,073 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 10:34:35,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:34:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 10:34:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2019-09-07 10:34:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 10:34:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-07 10:34:35,078 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 57 [2019-09-07 10:34:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:35,078 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-07 10:34:35,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:34:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-07 10:34:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 10:34:35,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:35,079 INFO L399 BasicCegarLoop]: trace histogram [34, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:35,080 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 644431209, now seen corresponding path program 26 times [2019-09-07 10:34:35,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:35,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:35,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:34:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:34:35,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:35,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:34:35,785 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:34:35,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:34:35,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:35,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:34:35,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:34:35,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:35,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 10:34:35,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:34:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:34:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:34:35,874 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 38 states. [2019-09-07 10:34:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:36,205 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-09-07 10:34:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:34:36,207 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 58 [2019-09-07 10:34:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:36,209 INFO L225 Difference]: With dead ends: 111 [2019-09-07 10:34:36,209 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 10:34:36,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:34:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 10:34:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2019-09-07 10:34:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 10:34:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-09-07 10:34:36,220 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-09-07 10:34:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:36,221 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-09-07 10:34:36,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:34:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-09-07 10:34:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:34:36,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:36,222 INFO L399 BasicCegarLoop]: trace histogram [35, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:36,222 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1383275205, now seen corresponding path program 27 times [2019-09-07 10:34:36,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:36,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:36,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:36,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:34:36,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:36,847 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:34:36,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:34:37,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:34:37,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:37,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:34:37,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-07 10:34:37,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:37,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 12] total 39 [2019-09-07 10:34:37,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:34:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:34:37,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:34:37,244 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 39 states. [2019-09-07 10:34:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:37,577 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2019-09-07 10:34:37,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:34:37,577 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 59 [2019-09-07 10:34:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:37,579 INFO L225 Difference]: With dead ends: 117 [2019-09-07 10:34:37,579 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 10:34:37,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:34:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 10:34:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-09-07 10:34:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 10:34:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-07 10:34:37,584 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2019-09-07 10:34:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:37,585 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-07 10:34:37,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:34:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-07 10:34:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 10:34:37,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:37,586 INFO L399 BasicCegarLoop]: trace histogram [37, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:37,586 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1632433238, now seen corresponding path program 28 times [2019-09-07 10:34:37,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:37,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:37,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:37,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:34:38,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:38,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:34:38,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:34:38,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:34:38,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:34:38,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:34:38,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:34:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:34:38,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:34:38,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 10:34:38,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:34:38,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:34:38,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:34:38,499 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 41 states. [2019-09-07 10:34:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:34:38,817 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-09-07 10:34:38,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:34:38,818 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 62 [2019-09-07 10:34:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:34:38,820 INFO L225 Difference]: With dead ends: 119 [2019-09-07 10:34:38,820 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 10:34:38,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:34:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 10:34:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2019-09-07 10:34:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 10:34:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2019-09-07 10:34:38,827 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 62 [2019-09-07 10:34:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:34:38,827 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2019-09-07 10:34:38,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:34:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2019-09-07 10:34:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:34:38,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:34:38,829 INFO L399 BasicCegarLoop]: trace histogram [38, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:34:38,829 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:34:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:34:38,829 INFO L82 PathProgramCache]: Analyzing trace with hash -845751546, now seen corresponding path program 29 times [2019-09-07 10:34:38,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:34:38,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:34:38,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:38,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:34:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:34:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:34:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:34:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:34:39,780 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:34:39,793 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:35:20,601 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-07 10:35:20,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:20,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:35:20,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:35:20,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:20,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-07 10:35:20,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 10:35:20,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 10:35:20,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:35:20,657 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 42 states. [2019-09-07 10:35:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:20,925 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-09-07 10:35:20,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 10:35:20,926 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 63 [2019-09-07 10:35:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:20,927 INFO L225 Difference]: With dead ends: 120 [2019-09-07 10:35:20,928 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 10:35:20,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:35:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 10:35:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2019-09-07 10:35:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 10:35:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-07 10:35:20,933 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2019-09-07 10:35:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:20,934 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-07 10:35:20,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 10:35:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-07 10:35:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 10:35:20,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:20,935 INFO L399 BasicCegarLoop]: trace histogram [39, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:20,935 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2066544426, now seen corresponding path program 30 times [2019-09-07 10:35:20,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:20,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:20,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:20,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 10:35:21,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:21,618 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:35:21,629 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:35:27,508 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 10:35:27,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:27,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:35:27,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-07 10:35:27,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:27,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 13] total 43 [2019-09-07 10:35:27,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:35:27,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:35:27,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:35:27,570 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 43 states. [2019-09-07 10:35:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:27,886 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2019-09-07 10:35:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:35:27,887 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2019-09-07 10:35:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:27,888 INFO L225 Difference]: With dead ends: 126 [2019-09-07 10:35:27,888 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 10:35:27,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:35:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 10:35:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2019-09-07 10:35:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 10:35:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-09-07 10:35:27,896 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 64 [2019-09-07 10:35:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:27,896 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-09-07 10:35:27,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:35:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-09-07 10:35:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:35:27,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:27,897 INFO L399 BasicCegarLoop]: trace histogram [41, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:27,897 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:27,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2083149029, now seen corresponding path program 31 times [2019-09-07 10:35:27,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:27,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:27,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:35:28,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:28,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:28,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:35:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:28,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 10:35:28,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:35:28,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:28,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-07 10:35:28,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:35:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:35:28,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:35:28,716 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 45 states. [2019-09-07 10:35:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:29,029 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2019-09-07 10:35:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:35:29,030 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 67 [2019-09-07 10:35:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:29,031 INFO L225 Difference]: With dead ends: 128 [2019-09-07 10:35:29,031 INFO L226 Difference]: Without dead ends: 105 [2019-09-07 10:35:29,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:35:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-07 10:35:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2019-09-07 10:35:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 10:35:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-07 10:35:29,037 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 67 [2019-09-07 10:35:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:29,037 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-07 10:35:29,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:35:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-07 10:35:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 10:35:29,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:29,038 INFO L399 BasicCegarLoop]: trace histogram [42, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:29,039 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:29,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:29,039 INFO L82 PathProgramCache]: Analyzing trace with hash -78790903, now seen corresponding path program 32 times [2019-09-07 10:35:29,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:29,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:29,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:35:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:35:29,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:29,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:29,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:35:29,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:35:29,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:29,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:35:29,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:35:29,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:29,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-07 10:35:29,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:35:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:35:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:35:29,888 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 46 states. [2019-09-07 10:35:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:30,266 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2019-09-07 10:35:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:35:30,267 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2019-09-07 10:35:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:30,268 INFO L225 Difference]: With dead ends: 129 [2019-09-07 10:35:30,269 INFO L226 Difference]: Without dead ends: 106 [2019-09-07 10:35:30,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:35:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-07 10:35:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2019-09-07 10:35:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-07 10:35:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-09-07 10:35:30,275 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 68 [2019-09-07 10:35:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:30,275 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-09-07 10:35:30,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:35:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-09-07 10:35:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 10:35:30,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:30,276 INFO L399 BasicCegarLoop]: trace histogram [43, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:30,276 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1620547941, now seen corresponding path program 33 times [2019-09-07 10:35:30,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:30,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:30,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:30,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:35:31,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:31,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:31,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:35:31,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 10:35:31,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:31,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:35:31,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-07 10:35:31,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:31,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 14] total 47 [2019-09-07 10:35:31,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:35:31,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:35:31,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:35:31,781 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-09-07 10:35:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:32,107 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2019-09-07 10:35:32,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:35:32,107 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 69 [2019-09-07 10:35:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:32,109 INFO L225 Difference]: With dead ends: 135 [2019-09-07 10:35:32,109 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 10:35:32,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:35:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 10:35:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 76. [2019-09-07 10:35:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:35:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-07 10:35:32,115 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2019-09-07 10:35:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:32,115 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-07 10:35:32,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:35:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-07 10:35:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 10:35:32,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:32,116 INFO L399 BasicCegarLoop]: trace histogram [45, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:32,116 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2075525386, now seen corresponding path program 34 times [2019-09-07 10:35:32,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:32,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:32,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:32,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:32,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:35:33,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:33,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:35:33,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:35:33,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:33,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:35:33,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:35:33,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:33,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 10:35:33,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:35:33,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:35:33,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:35:33,400 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 49 states. [2019-09-07 10:35:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:33,732 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2019-09-07 10:35:33,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:35:33,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2019-09-07 10:35:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:33,733 INFO L225 Difference]: With dead ends: 137 [2019-09-07 10:35:33,733 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 10:35:33,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:35:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 10:35:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2019-09-07 10:35:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 10:35:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-09-07 10:35:33,738 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2019-09-07 10:35:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:33,738 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-09-07 10:35:33,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:35:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-09-07 10:35:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 10:35:33,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:33,739 INFO L399 BasicCegarLoop]: trace histogram [46, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:33,739 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash 429084006, now seen corresponding path program 35 times [2019-09-07 10:35:33,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:33,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:33,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:33,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:35:34,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:34,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:34,620 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:36:31,677 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-07 10:36:31,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:31,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:36:31,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:36:31,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:31,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 10:36:31,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 10:36:31,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 10:36:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:36:31,751 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 50 states. [2019-09-07 10:36:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:32,130 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2019-09-07 10:36:32,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:36:32,131 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 73 [2019-09-07 10:36:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:32,133 INFO L225 Difference]: With dead ends: 138 [2019-09-07 10:36:32,133 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 10:36:32,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:36:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 10:36:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 78. [2019-09-07 10:36:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 10:36:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-07 10:36:32,140 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 73 [2019-09-07 10:36:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:32,141 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-07 10:36:32,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 10:36:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-07 10:36:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 10:36:32,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:32,142 INFO L399 BasicCegarLoop]: trace histogram [47, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:32,142 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:32,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:32,143 INFO L82 PathProgramCache]: Analyzing trace with hash 929008778, now seen corresponding path program 36 times [2019-09-07 10:36:32,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:32,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:32,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:32,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:32,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 10:36:33,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:33,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:33,262 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:36:42,378 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:36:42,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:42,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:36:42,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-09-07 10:36:42,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:42,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 15] total 51 [2019-09-07 10:36:42,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:36:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:36:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:36:42,464 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 51 states. [2019-09-07 10:36:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:42,970 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2019-09-07 10:36:42,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:36:42,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 74 [2019-09-07 10:36:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:42,972 INFO L225 Difference]: With dead ends: 144 [2019-09-07 10:36:42,972 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 10:36:42,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:36:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 10:36:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 81. [2019-09-07 10:36:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 10:36:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-09-07 10:36:42,977 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 74 [2019-09-07 10:36:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:42,978 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-09-07 10:36:42,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:36:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-09-07 10:36:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 10:36:42,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:42,979 INFO L399 BasicCegarLoop]: trace histogram [49, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:42,979 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:42,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1384723579, now seen corresponding path program 37 times [2019-09-07 10:36:42,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:42,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:42,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:42,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:36:44,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:44,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:44,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:36:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:44,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:36:44,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:36:44,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:44,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-07 10:36:44,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:36:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:36:44,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:36:44,112 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 53 states. [2019-09-07 10:36:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:44,619 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2019-09-07 10:36:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:36:44,619 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 77 [2019-09-07 10:36:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:44,621 INFO L225 Difference]: With dead ends: 146 [2019-09-07 10:36:44,621 INFO L226 Difference]: Without dead ends: 121 [2019-09-07 10:36:44,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:36:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-07 10:36:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2019-09-07 10:36:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 10:36:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-09-07 10:36:44,627 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 77 [2019-09-07 10:36:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:44,627 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-09-07 10:36:44,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:36:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-09-07 10:36:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 10:36:44,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:44,628 INFO L399 BasicCegarLoop]: trace histogram [50, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:44,628 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:44,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:44,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2131155113, now seen corresponding path program 38 times [2019-09-07 10:36:44,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:44,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:44,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:44,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:36:44,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:36:45,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:45,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:45,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:36:45,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:36:45,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:45,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:36:45,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:36:45,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:45,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-07 10:36:45,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 10:36:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 10:36:45,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:36:45,757 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 54 states. [2019-09-07 10:36:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:46,057 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2019-09-07 10:36:46,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 10:36:46,058 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-09-07 10:36:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:46,059 INFO L225 Difference]: With dead ends: 147 [2019-09-07 10:36:46,059 INFO L226 Difference]: Without dead ends: 122 [2019-09-07 10:36:46,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:36:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-07 10:36:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 83. [2019-09-07 10:36:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 10:36:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-09-07 10:36:46,066 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 78 [2019-09-07 10:36:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:46,066 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-09-07 10:36:46,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 10:36:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-09-07 10:36:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:36:46,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:46,070 INFO L399 BasicCegarLoop]: trace histogram [51, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:46,070 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -545755131, now seen corresponding path program 39 times [2019-09-07 10:36:46,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:46,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 10:36:47,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:47,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:47,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:36:49,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 10:36:49,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:49,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:36:49,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-09-07 10:36:49,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:49,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 16] total 55 [2019-09-07 10:36:49,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:36:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:36:49,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:36:49,659 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 55 states. [2019-09-07 10:36:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:50,184 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2019-09-07 10:36:50,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:36:50,185 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 79 [2019-09-07 10:36:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:50,186 INFO L225 Difference]: With dead ends: 153 [2019-09-07 10:36:50,186 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 10:36:50,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:36:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 10:36:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 86. [2019-09-07 10:36:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 10:36:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-09-07 10:36:50,192 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 79 [2019-09-07 10:36:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:50,192 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-09-07 10:36:50,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:36:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-09-07 10:36:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 10:36:50,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:50,193 INFO L399 BasicCegarLoop]: trace histogram [53, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:50,194 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash -562061718, now seen corresponding path program 40 times [2019-09-07 10:36:50,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:50,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:50,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:36:51,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:51,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:51,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:36:51,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:36:51,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:51,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 10:36:51,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:36:51,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:51,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-07 10:36:51,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 10:36:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 10:36:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:36:51,756 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 57 states. [2019-09-07 10:36:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:52,133 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2019-09-07 10:36:52,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:36:52,134 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 82 [2019-09-07 10:36:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:52,135 INFO L225 Difference]: With dead ends: 155 [2019-09-07 10:36:52,136 INFO L226 Difference]: Without dead ends: 129 [2019-09-07 10:36:52,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:36:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-07 10:36:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 87. [2019-09-07 10:36:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 10:36:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-09-07 10:36:52,141 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82 [2019-09-07 10:36:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:52,142 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-09-07 10:36:52,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 10:36:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-09-07 10:36:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:36:52,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:52,143 INFO L399 BasicCegarLoop]: trace histogram [54, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:52,143 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:52,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash -211933242, now seen corresponding path program 41 times [2019-09-07 10:36:52,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:52,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:52,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:52,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:52,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1590 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:36:53,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:53,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:53,293 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:38:14,820 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-07 10:38:14,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:14,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 10:38:14,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1590 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:38:14,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:14,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-07 10:38:14,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 10:38:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 10:38:14,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:38:14,897 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 58 states. [2019-09-07 10:38:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:15,266 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2019-09-07 10:38:15,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 10:38:15,266 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 83 [2019-09-07 10:38:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:15,268 INFO L225 Difference]: With dead ends: 156 [2019-09-07 10:38:15,268 INFO L226 Difference]: Without dead ends: 130 [2019-09-07 10:38:15,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:38:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-07 10:38:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2019-09-07 10:38:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:38:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-07 10:38:15,286 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 83 [2019-09-07 10:38:15,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:15,286 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-07 10:38:15,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 10:38:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-07 10:38:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 10:38:15,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:15,287 INFO L399 BasicCegarLoop]: trace histogram [55, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:15,287 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2052114922, now seen corresponding path program 42 times [2019-09-07 10:38:15,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:15,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:15,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1645 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:38:16,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:16,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:16,581 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:38:28,052 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-07 10:38:28,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:28,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:38:28,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1645 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-09-07 10:38:28,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:28,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 17] total 59 [2019-09-07 10:38:28,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 10:38:28,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 10:38:28,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:38:28,124 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 59 states. [2019-09-07 10:38:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:28,644 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2019-09-07 10:38:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 10:38:28,645 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 84 [2019-09-07 10:38:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:28,646 INFO L225 Difference]: With dead ends: 162 [2019-09-07 10:38:28,646 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 10:38:28,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:38:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 10:38:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2019-09-07 10:38:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 10:38:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2019-09-07 10:38:28,652 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 84 [2019-09-07 10:38:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:28,652 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2019-09-07 10:38:28,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 10:38:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2019-09-07 10:38:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:38:28,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:28,653 INFO L399 BasicCegarLoop]: trace histogram [57, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:28,653 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash -337536475, now seen corresponding path program 43 times [2019-09-07 10:38:28,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:28,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:38:29,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:29,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:29,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:38:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:30,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 10:38:30,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:38:30,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:30,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-09-07 10:38:30,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 10:38:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 10:38:30,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:38:30,038 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 61 states. [2019-09-07 10:38:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:30,551 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2019-09-07 10:38:30,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 10:38:30,551 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 87 [2019-09-07 10:38:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:30,553 INFO L225 Difference]: With dead ends: 164 [2019-09-07 10:38:30,553 INFO L226 Difference]: Without dead ends: 137 [2019-09-07 10:38:30,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:38:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-07 10:38:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 92. [2019-09-07 10:38:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-07 10:38:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-07 10:38:30,560 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2019-09-07 10:38:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:30,560 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-07 10:38:30,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 10:38:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-07 10:38:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 10:38:30,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:30,562 INFO L399 BasicCegarLoop]: trace histogram [58, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:30,562 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1766946231, now seen corresponding path program 44 times [2019-09-07 10:38:30,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:30,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:30,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:30,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:38:30,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:38:32,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:32,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:32,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:38:32,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:38:32,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:32,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 10:38:32,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:38:32,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:32,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-09-07 10:38:32,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 10:38:32,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 10:38:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:38:32,142 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 62 states. [2019-09-07 10:38:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:32,604 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2019-09-07 10:38:32,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 10:38:32,605 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 88 [2019-09-07 10:38:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:32,606 INFO L225 Difference]: With dead ends: 165 [2019-09-07 10:38:32,606 INFO L226 Difference]: Without dead ends: 138 [2019-09-07 10:38:32,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:38:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-07 10:38:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 93. [2019-09-07 10:38:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-07 10:38:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-09-07 10:38:32,613 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 88 [2019-09-07 10:38:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:32,613 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-09-07 10:38:32,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 10:38:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-09-07 10:38:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 10:38:32,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:32,614 INFO L399 BasicCegarLoop]: trace histogram [59, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:32,614 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1165991589, now seen corresponding path program 45 times [2019-09-07 10:38:32,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:32,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:32,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:32,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:38:33,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:33,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:34,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:38:44,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:38:44,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:44,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:38:44,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-09-07 10:38:44,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:44,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 18] total 63 [2019-09-07 10:38:44,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:38:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:38:44,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:38:44,528 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 63 states. [2019-09-07 10:38:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:45,131 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2019-09-07 10:38:45,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 10:38:45,131 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 89 [2019-09-07 10:38:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:45,133 INFO L225 Difference]: With dead ends: 171 [2019-09-07 10:38:45,133 INFO L226 Difference]: Without dead ends: 144 [2019-09-07 10:38:45,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:38:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-07 10:38:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 96. [2019-09-07 10:38:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 10:38:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-07 10:38:45,139 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 89 [2019-09-07 10:38:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:45,140 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-07 10:38:45,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:38:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-07 10:38:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 10:38:45,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:45,141 INFO L399 BasicCegarLoop]: trace histogram [61, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:45,141 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:45,141 INFO L82 PathProgramCache]: Analyzing trace with hash -941235254, now seen corresponding path program 46 times [2019-09-07 10:38:45,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:45,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:45,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:45,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:45,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-07 10:38:46,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:46,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:46,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:38:46,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:38:46,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:38:46,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-07 10:38:46,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:38:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-07 10:38:46,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:38:46,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-09-07 10:38:46,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 10:38:46,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 10:38:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:38:46,723 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 65 states. [2019-09-07 10:38:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:38:47,684 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2019-09-07 10:38:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 10:38:47,684 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 92 [2019-09-07 10:38:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:38:47,685 INFO L225 Difference]: With dead ends: 173 [2019-09-07 10:38:47,685 INFO L226 Difference]: Without dead ends: 145 [2019-09-07 10:38:47,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:38:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-07 10:38:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2019-09-07 10:38:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-07 10:38:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2019-09-07 10:38:47,693 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 92 [2019-09-07 10:38:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:38:47,695 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2019-09-07 10:38:47,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 10:38:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2019-09-07 10:38:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 10:38:47,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:38:47,696 INFO L399 BasicCegarLoop]: trace histogram [62, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:38:47,696 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:38:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:38:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash -987928026, now seen corresponding path program 47 times [2019-09-07 10:38:47,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:38:47,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:38:47,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:47,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:38:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:38:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-07 10:38:49,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:49,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:38:49,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:40:16,500 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-07 10:40:16,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:40:16,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-07 10:40:16,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:40:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-07 10:40:16,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:40:16,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-09-07 10:40:16,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-07 10:40:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-07 10:40:16,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 10:40:16,584 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 66 states. [2019-09-07 10:40:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:40:17,101 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2019-09-07 10:40:17,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 10:40:17,101 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 93 [2019-09-07 10:40:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:40:17,103 INFO L225 Difference]: With dead ends: 174 [2019-09-07 10:40:17,103 INFO L226 Difference]: Without dead ends: 146 [2019-09-07 10:40:17,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 10:40:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-07 10:40:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2019-09-07 10:40:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 10:40:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-07 10:40:17,109 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-09-07 10:40:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:40:17,110 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-07 10:40:17,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-07 10:40:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-07 10:40:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 10:40:17,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:40:17,111 INFO L399 BasicCegarLoop]: trace histogram [63, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:40:17,111 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:40:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:40:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1859563338, now seen corresponding path program 48 times [2019-09-07 10:40:17,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:40:17,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:40:17,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:17,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:40:17,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:40:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:40:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-07 10:40:18,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:40:18,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:40:18,647 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:41:31,300 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-07 10:41:31,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:31,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:41:31,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-09-07 10:41:31,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:31,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 19] total 67 [2019-09-07 10:41:31,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 10:41:31,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 10:41:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 10:41:31,446 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 67 states. [2019-09-07 10:41:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:32,226 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2019-09-07 10:41:32,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 10:41:32,226 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 94 [2019-09-07 10:41:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:32,227 INFO L225 Difference]: With dead ends: 180 [2019-09-07 10:41:32,227 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 10:41:32,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 10:41:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 10:41:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 101. [2019-09-07 10:41:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 10:41:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-09-07 10:41:32,237 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 94 [2019-09-07 10:41:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:32,237 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-09-07 10:41:32,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 10:41:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-09-07 10:41:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 10:41:32,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:32,239 INFO L399 BasicCegarLoop]: trace histogram [65, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:32,240 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:32,241 INFO L82 PathProgramCache]: Analyzing trace with hash -44777275, now seen corresponding path program 49 times [2019-09-07 10:41:32,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:32,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:32,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:32,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:32,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:41:33,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:33,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:41:33,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:41:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:34,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-07 10:41:34,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:41:34,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:34,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 69 [2019-09-07 10:41:34,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 10:41:34,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 10:41:34,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:41:34,104 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 69 states. [2019-09-07 10:41:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:34,815 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2019-09-07 10:41:34,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-07 10:41:34,823 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 97 [2019-09-07 10:41:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:34,825 INFO L225 Difference]: With dead ends: 182 [2019-09-07 10:41:34,825 INFO L226 Difference]: Without dead ends: 153 [2019-09-07 10:41:34,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:41:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-07 10:41:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 102. [2019-09-07 10:41:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-07 10:41:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-09-07 10:41:34,829 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 97 [2019-09-07 10:41:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:34,830 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-09-07 10:41:34,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 10:41:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-09-07 10:41:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 10:41:34,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:34,831 INFO L399 BasicCegarLoop]: trace histogram [66, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:34,831 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:34,831 INFO L82 PathProgramCache]: Analyzing trace with hash -253832215, now seen corresponding path program 50 times [2019-09-07 10:41:34,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:34,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:34,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:41:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:41:36,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:36,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:41:36,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:41:36,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:41:36,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:36,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-07 10:41:36,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:41:36,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:36,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 70 [2019-09-07 10:41:36,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-07 10:41:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-07 10:41:36,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:41:36,674 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 70 states. [2019-09-07 10:41:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:37,412 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2019-09-07 10:41:37,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 10:41:37,413 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 98 [2019-09-07 10:41:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:37,414 INFO L225 Difference]: With dead ends: 183 [2019-09-07 10:41:37,414 INFO L226 Difference]: Without dead ends: 154 [2019-09-07 10:41:37,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:41:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-07 10:41:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2019-09-07 10:41:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-07 10:41:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2019-09-07 10:41:37,419 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 98 [2019-09-07 10:41:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:37,420 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2019-09-07 10:41:37,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-07 10:41:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2019-09-07 10:41:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:41:37,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:37,421 INFO L399 BasicCegarLoop]: trace histogram [67, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:37,421 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:37,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:37,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1855399237, now seen corresponding path program 51 times [2019-09-07 10:41:37,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:37,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:37,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2431 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-07 10:41:39,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:39,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:41:39,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:41:42,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 10:41:42,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:42,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:41:42,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2431 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-09-07 10:41:43,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:43,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 20] total 71 [2019-09-07 10:41:43,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 10:41:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 10:41:43,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:41:43,026 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 71 states. [2019-09-07 10:41:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:43,787 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2019-09-07 10:41:43,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 10:41:43,787 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 99 [2019-09-07 10:41:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:43,789 INFO L225 Difference]: With dead ends: 189 [2019-09-07 10:41:43,789 INFO L226 Difference]: Without dead ends: 160 [2019-09-07 10:41:43,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:41:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-07 10:41:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 106. [2019-09-07 10:41:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-07 10:41:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-09-07 10:41:43,795 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 99 [2019-09-07 10:41:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:43,795 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-09-07 10:41:43,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 10:41:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-09-07 10:41:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 10:41:43,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:43,796 INFO L399 BasicCegarLoop]: trace histogram [69, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:43,796 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash 54448426, now seen corresponding path program 52 times [2019-09-07 10:41:43,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:43,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:43,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:43,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2586 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:41:45,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:45,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:41:45,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:41:45,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:41:45,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:45,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-07 10:41:45,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2586 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:41:45,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:45,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 73 [2019-09-07 10:41:45,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 10:41:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 10:41:45,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:41:45,782 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 73 states. [2019-09-07 10:41:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:46,586 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2019-09-07 10:41:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 10:41:46,586 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 102 [2019-09-07 10:41:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:46,591 INFO L225 Difference]: With dead ends: 191 [2019-09-07 10:41:46,591 INFO L226 Difference]: Without dead ends: 161 [2019-09-07 10:41:46,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:41:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-07 10:41:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 107. [2019-09-07 10:41:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-07 10:41:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-09-07 10:41:46,597 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 102 [2019-09-07 10:41:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:46,597 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2019-09-07 10:41:46,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 10:41:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2019-09-07 10:41:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 10:41:46,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:46,598 INFO L399 BasicCegarLoop]: trace histogram [70, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:46,598 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1601639558, now seen corresponding path program 53 times [2019-09-07 10:41:46,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:46,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:46,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:46,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:46,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:41:48,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:48,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:41:48,525 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:43:54,326 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-07 10:43:54,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:54,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-07 10:43:54,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:43:54,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:54,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 74 [2019-09-07 10:43:54,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 10:43:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 10:43:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 10:43:54,424 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 74 states. [2019-09-07 10:43:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:55,191 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2019-09-07 10:43:55,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-07 10:43:55,192 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 103 [2019-09-07 10:43:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:55,193 INFO L225 Difference]: With dead ends: 192 [2019-09-07 10:43:55,193 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 10:43:55,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 10:43:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 10:43:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2019-09-07 10:43:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-07 10:43:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-07 10:43:55,200 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 103 [2019-09-07 10:43:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:55,200 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-07 10:43:55,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 10:43:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-07 10:43:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 10:43:55,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:55,201 INFO L399 BasicCegarLoop]: trace histogram [71, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:55,201 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1975042902, now seen corresponding path program 54 times [2019-09-07 10:43:55,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:55,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:55,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2727 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 10:43:57,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:57,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:57,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:44:57,520 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:44:57,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:57,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:44:57,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2727 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-09-07 10:44:57,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:57,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 21] total 75 [2019-09-07 10:44:57,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-07 10:44:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-07 10:44:57,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 10:44:57,611 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 75 states. [2019-09-07 10:44:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:58,250 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2019-09-07 10:44:58,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 10:44:58,250 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 104 [2019-09-07 10:44:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:58,252 INFO L225 Difference]: With dead ends: 198 [2019-09-07 10:44:58,252 INFO L226 Difference]: Without dead ends: 168 [2019-09-07 10:44:58,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 10:44:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-07 10:44:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 111. [2019-09-07 10:44:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-07 10:44:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2019-09-07 10:44:58,258 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 104 [2019-09-07 10:44:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:58,258 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2019-09-07 10:44:58,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-07 10:44:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2019-09-07 10:44:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:44:58,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:58,259 INFO L399 BasicCegarLoop]: trace histogram [73, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:58,259 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:58,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash 758792037, now seen corresponding path program 55 times [2019-09-07 10:44:58,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:58,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2891 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:45:00,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:00,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:45:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:00,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-07 10:45:00,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2891 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:45:00,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:00,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 77 [2019-09-07 10:45:00,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-07 10:45:00,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-07 10:45:00,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 10:45:00,398 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 77 states. [2019-09-07 10:45:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:01,231 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2019-09-07 10:45:01,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 10:45:01,231 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 107 [2019-09-07 10:45:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:01,233 INFO L225 Difference]: With dead ends: 200 [2019-09-07 10:45:01,233 INFO L226 Difference]: Without dead ends: 169 [2019-09-07 10:45:01,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 10:45:01,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-07 10:45:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2019-09-07 10:45:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 10:45:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-09-07 10:45:01,239 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-09-07 10:45:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:01,239 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-09-07 10:45:01,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-07 10:45:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-09-07 10:45:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 10:45:01,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:01,240 INFO L399 BasicCegarLoop]: trace histogram [74, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:01,240 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:01,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1515080311, now seen corresponding path program 56 times [2019-09-07 10:45:01,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:01,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:01,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:01,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:45:01,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:45:03,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:03,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:03,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:45:03,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:45:03,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:03,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-07 10:45:03,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:45:03,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:03,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 78 [2019-09-07 10:45:03,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-07 10:45:03,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-07 10:45:03,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-07 10:45:03,802 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 78 states. [2019-09-07 10:45:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:04,421 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2019-09-07 10:45:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-07 10:45:04,421 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 108 [2019-09-07 10:45:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:04,423 INFO L225 Difference]: With dead ends: 201 [2019-09-07 10:45:04,423 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 10:45:04,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-07 10:45:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 10:45:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 113. [2019-09-07 10:45:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-07 10:45:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2019-09-07 10:45:04,429 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 108 [2019-09-07 10:45:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:04,430 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2019-09-07 10:45:04,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-07 10:45:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2019-09-07 10:45:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 10:45:04,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:04,431 INFO L399 BasicCegarLoop]: trace histogram [75, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:04,431 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1009320933, now seen corresponding path program 57 times [2019-09-07 10:45:04,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:04,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:04,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:04,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 10:45:06,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:06,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:06,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:45:19,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 10:45:19,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:19,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:45:19,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-09-07 10:45:19,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:19,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 22] total 79 [2019-09-07 10:45:19,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-07 10:45:19,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-07 10:45:19,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 10:45:19,453 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 79 states. [2019-09-07 10:45:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:20,358 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2019-09-07 10:45:20,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 10:45:20,358 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 109 [2019-09-07 10:45:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:20,360 INFO L225 Difference]: With dead ends: 207 [2019-09-07 10:45:20,360 INFO L226 Difference]: Without dead ends: 176 [2019-09-07 10:45:20,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 10:45:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-07 10:45:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 116. [2019-09-07 10:45:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 10:45:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-09-07 10:45:20,365 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 109 [2019-09-07 10:45:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:20,366 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-09-07 10:45:20,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-07 10:45:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-09-07 10:45:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 10:45:20,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:20,366 INFO L399 BasicCegarLoop]: trace histogram [77, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:20,367 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2040502646, now seen corresponding path program 58 times [2019-09-07 10:45:20,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:20,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3213 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:45:22,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:22,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:22,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:45:22,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:45:22,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:22,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-07 10:45:22,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3213 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (59)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:45:22,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:22,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 81 [2019-09-07 10:45:22,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-07 10:45:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-07 10:45:22,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 10:45:22,731 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 81 states. [2019-09-07 10:45:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:23,682 INFO L93 Difference]: Finished difference Result 209 states and 233 transitions. [2019-09-07 10:45:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-07 10:45:23,682 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 112 [2019-09-07 10:45:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:23,683 INFO L225 Difference]: With dead ends: 209 [2019-09-07 10:45:23,684 INFO L226 Difference]: Without dead ends: 177 [2019-09-07 10:45:23,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 10:45:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-07 10:45:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 117. [2019-09-07 10:45:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-07 10:45:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2019-09-07 10:45:23,689 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 112 [2019-09-07 10:45:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:23,689 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2019-09-07 10:45:23,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-07 10:45:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2019-09-07 10:45:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 10:45:23,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:23,690 INFO L399 BasicCegarLoop]: trace histogram [78, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:23,691 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1502684902, now seen corresponding path program 59 times [2019-09-07 10:45:23,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:23,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:23,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:45:25,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:25,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:47:56,353 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-09-07 10:47:56,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:56,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-07 10:47:56,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:47:56,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:56,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 82 [2019-09-07 10:47:56,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-07 10:47:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-07 10:47:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-07 10:47:56,465 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 82 states. [2019-09-07 10:47:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:57,425 INFO L93 Difference]: Finished difference Result 210 states and 234 transitions. [2019-09-07 10:47:57,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-07 10:47:57,426 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 113 [2019-09-07 10:47:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:57,428 INFO L225 Difference]: With dead ends: 210 [2019-09-07 10:47:57,428 INFO L226 Difference]: Without dead ends: 178 [2019-09-07 10:47:57,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-07 10:47:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-07 10:47:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 118. [2019-09-07 10:47:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-07 10:47:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-09-07 10:47:57,433 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 113 [2019-09-07 10:47:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:57,434 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-09-07 10:47:57,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-07 10:47:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-09-07 10:47:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 10:47:57,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:57,435 INFO L399 BasicCegarLoop]: trace histogram [79, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:57,435 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -327650806, now seen corresponding path program 60 times [2019-09-07 10:47:57,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:57,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:57,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:57,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3370 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:47:59,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:59,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:59,768 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE