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_08.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:41:44,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:41:44,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:41:44,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:41:44,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:41:44,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:41:44,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:41:44,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:41:44,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:41:44,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:41:44,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:41:44,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:41:44,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:41:44,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:41:44,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:41:44,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:41:44,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:41:44,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:41:44,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:41:44,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:41:44,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:41:44,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:41:44,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:41:44,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:41:44,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:41:44,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:41:44,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:41:44,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:41:44,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:41:44,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:41:44,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:41:44,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:41:44,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:41:44,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:41:44,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:41:44,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:41:44,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:41:44,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:41:44,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:41:44,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:41:44,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:41:44,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 23:41:44,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:41:44,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:41:44,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:41:44,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:41:44,189 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:41:44,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:41:44,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:41:44,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:41:44,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:41:44,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:41:44,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:41:44,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:41:44,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:41:44,191 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:41:44,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:41:44,191 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:41:44,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:41:44,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:41:44,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:41:44,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:41:44,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:41:44,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:41:44,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:41:44,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:41:44,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:41:44,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:41:44,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:41:44,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:41:44,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:41:44,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:41:44,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:41:44,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:41:44,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:41:44,241 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:41:44,242 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_08.i [2019-10-01 23:41:44,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc2eb3be/81c40e333738476395cdec987c418dff/FLAG07ac3ccf4 [2019-10-01 23:41:44,760 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:41:44,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_08.i [2019-10-01 23:41:44,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc2eb3be/81c40e333738476395cdec987c418dff/FLAG07ac3ccf4 [2019-10-01 23:41:45,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc2eb3be/81c40e333738476395cdec987c418dff [2019-10-01 23:41:45,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:41:45,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:41:45,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:41:45,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:41:45,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:41:45,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36edca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45, skipping insertion in model container [2019-10-01 23:41:45,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,176 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:41:45,195 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:41:45,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:41:45,398 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:41:45,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:41:45,529 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:41:45,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45 WrapperNode [2019-10-01 23:41:45,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:41:45,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:41:45,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:41:45,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:41:45,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (1/1) ... [2019-10-01 23:41:45,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:41:45,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:41:45,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:41:45,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:41:45,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:41:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:41:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:41:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:41:45,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:41:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:41:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:41:45,927 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:41:45,927 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:41:45,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:41:45 BoogieIcfgContainer [2019-10-01 23:41:45,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:41:45,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:41:45,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:41:45,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:41:45,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:41:45" (1/3) ... [2019-10-01 23:41:45,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6850048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:41:45, skipping insertion in model container [2019-10-01 23:41:45,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:45" (2/3) ... [2019-10-01 23:41:45,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6850048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:41:45, skipping insertion in model container [2019-10-01 23:41:45,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:41:45" (3/3) ... [2019-10-01 23:41:45,954 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_08.i [2019-10-01 23:41:45,967 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:41:45,978 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:41:45,996 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:41:46,024 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:41:46,024 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:41:46,024 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:41:46,025 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:41:46,025 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:41:46,025 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:41:46,025 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:41:46,025 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:41:46,025 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:41:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-01 23:41:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:41:46,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:46,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:46,050 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:46,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:46,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2019-10-01 23:41:46,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:46,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:46,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:41:46,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:41:46,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:41:46,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:41:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:41:46,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:41:46,208 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-10-01 23:41:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:46,232 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-10-01 23:41:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:41:46,233 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 23:41:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:46,242 INFO L225 Difference]: With dead ends: 41 [2019-10-01 23:41:46,242 INFO L226 Difference]: Without dead ends: 19 [2019-10-01 23:41:46,246 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:41:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-01 23:41:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-01 23:41:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-01 23:41:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-01 23:41:46,284 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-10-01 23:41:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:46,285 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-01 23:41:46,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:41:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-01 23:41:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:41:46,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:46,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:46,287 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2019-10-01 23:41:46,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:46,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:46,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:46,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:41:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:41:46,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:41:46,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:41:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:41:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:41:46,372 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-10-01 23:41:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:46,410 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-10-01 23:41:46,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:41:46,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:41:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:46,412 INFO L225 Difference]: With dead ends: 32 [2019-10-01 23:41:46,412 INFO L226 Difference]: Without dead ends: 20 [2019-10-01 23:41:46,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:41:46,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-01 23:41:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-01 23:41:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-01 23:41:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-01 23:41:46,419 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2019-10-01 23:41:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:46,419 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-01 23:41:46,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:41:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-01 23:41:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 23:41:46,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:46,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:46,421 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2019-10-01 23:41:46,421 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:46,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:41:46,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:41:46,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:41:46,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:41:46,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:41:46,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:41:46,487 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-10-01 23:41:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:46,540 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-01 23:41:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:41:46,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 23:41:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:46,543 INFO L225 Difference]: With dead ends: 34 [2019-10-01 23:41:46,544 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 23:41:46,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:41:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 23:41:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-01 23:41:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-01 23:41:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-01 23:41:46,555 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-10-01 23:41:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:46,555 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-01 23:41:46,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:41:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-01 23:41:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 23:41:46,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:46,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:46,557 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:46,557 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2019-10-01 23:41:46,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:46,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:46,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:41:46,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:46,626 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:46,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:46,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:41:46,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:46,736 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): Broken pipe [2019-10-01 23:41:46,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:46,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-01 23:41:46,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:41:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:41:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:41:46,749 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-10-01 23:41:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:46,842 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-10-01 23:41:46,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:41:46,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-01 23:41:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:46,843 INFO L225 Difference]: With dead ends: 43 [2019-10-01 23:41:46,843 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 23:41:46,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:41:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 23:41:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-01 23:41:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 23:41:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-01 23:41:46,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-01 23:41:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:46,850 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-01 23:41:46,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:41:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-01 23:41:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:41:46,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:46,851 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:46,852 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:46,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1897825622, now seen corresponding path program 2 times [2019-10-01 23:41:46,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:46,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 23:41:46,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:46,949 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:46,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:41:47,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:41:47,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:47,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:41:47,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:41:47,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:47,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-10-01 23:41:47,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:41:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:41:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:41:47,094 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 9 states. [2019-10-01 23:41:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:47,186 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-10-01 23:41:47,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:41:47,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-01 23:41:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:47,188 INFO L225 Difference]: With dead ends: 51 [2019-10-01 23:41:47,188 INFO L226 Difference]: Without dead ends: 37 [2019-10-01 23:41:47,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:41:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-01 23:41:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-10-01 23:41:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:41:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-01 23:41:47,197 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2019-10-01 23:41:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:47,197 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-01 23:41:47,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:41:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-01 23:41:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 23:41:47,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:47,199 INFO L411 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:47,199 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1456795255, now seen corresponding path program 3 times [2019-10-01 23:41:47,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:47,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:47,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:47,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:41:47,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:47,348 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:41:47,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:47,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:41:47,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:47,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:41:47,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:41:47,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:47,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:41:47,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:41:47,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:41:47,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:41:47,455 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-10-01 23:41:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:47,525 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-10-01 23:41:47,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:41:47,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-01 23:41:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:47,527 INFO L225 Difference]: With dead ends: 51 [2019-10-01 23:41:47,527 INFO L226 Difference]: Without dead ends: 41 [2019-10-01 23:41:47,527 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:41:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-01 23:41:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-10-01 23:41:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:41:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-01 23:41:47,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-10-01 23:41:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:47,534 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-01 23:41:47,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:41:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-01 23:41:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:41:47,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:47,536 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:47,536 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:47,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:47,536 INFO L82 PathProgramCache]: Analyzing trace with hash -33873434, now seen corresponding path program 4 times [2019-10-01 23:41:47,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:47,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:47,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:41:47,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:47,617 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:47,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:41:47,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:41:47,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:47,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:41:47,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:41:47,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:47,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-10-01 23:41:47,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:41:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:41:47,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:41:47,759 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 14 states. [2019-10-01 23:41:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:47,900 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2019-10-01 23:41:47,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:41:47,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-10-01 23:41:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:47,903 INFO L225 Difference]: With dead ends: 66 [2019-10-01 23:41:47,903 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 23:41:47,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:41:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 23:41:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-10-01 23:41:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 23:41:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-01 23:41:47,922 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 25 [2019-10-01 23:41:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:47,922 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-01 23:41:47,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:41:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-01 23:41:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 23:41:47,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:47,925 INFO L411 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:47,925 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1290022011, now seen corresponding path program 5 times [2019-10-01 23:41:47,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:47,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:47,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:47,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:47,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 23:41:48,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:48,099 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:41:48,129 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:48,569 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 23:41:48,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:48,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:41:48,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:41:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 19 [2019-10-01 23:41:48,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:41:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:41:48,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:41:48,694 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 19 states. [2019-10-01 23:41:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:48,885 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2019-10-01 23:41:48,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:41:48,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-10-01 23:41:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:48,887 INFO L225 Difference]: With dead ends: 76 [2019-10-01 23:41:48,887 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 23:41:48,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:41:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 23:41:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2019-10-01 23:41:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 23:41:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-01 23:41:48,895 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 31 [2019-10-01 23:41:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:48,895 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-01 23:41:48,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:41:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-01 23:41:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 23:41:48,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:48,897 INFO L411 BasicCegarLoop]: trace histogram [16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:48,897 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:48,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash 678305990, now seen corresponding path program 6 times [2019-10-01 23:41:48,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:48,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:48,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:41:49,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:49,023 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:49,057 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:41:49,278 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:41:49,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:49,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:41:49,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:41:49,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:49,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:41:49,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:41:49,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:41:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:41:49,303 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2019-10-01 23:41:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:49,428 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-10-01 23:41:49,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:41:49,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-10-01 23:41:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:49,430 INFO L225 Difference]: With dead ends: 73 [2019-10-01 23:41:49,430 INFO L226 Difference]: Without dead ends: 63 [2019-10-01 23:41:49,431 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:41:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-01 23:41:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-10-01 23:41:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 23:41:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-01 23:41:49,439 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2019-10-01 23:41:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:49,440 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-01 23:41:49,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:41:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-01 23:41:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 23:41:49,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:49,441 INFO L411 BasicCegarLoop]: trace histogram [16, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:49,441 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1729755721, now seen corresponding path program 7 times [2019-10-01 23:41:49,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:49,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:49,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:41:49,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:49,571 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:49,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:49,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:41:49,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 23:41:49,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:49,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 26 [2019-10-01 23:41:49,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:41:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:41:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:41:49,816 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 26 states. [2019-10-01 23:41:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:49,976 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2019-10-01 23:41:49,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:41:49,977 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-10-01 23:41:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:49,978 INFO L225 Difference]: With dead ends: 93 [2019-10-01 23:41:49,978 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 23:41:49,979 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:41:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 23:41:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-10-01 23:41:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 23:41:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-01 23:41:49,987 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 38 [2019-10-01 23:41:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:49,987 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-01 23:41:49,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:41:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-01 23:41:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 23:41:49,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:49,989 INFO L411 BasicCegarLoop]: trace histogram [23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:49,989 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash -53699638, now seen corresponding path program 8 times [2019-10-01 23:41:49,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:49,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:49,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 23:41:50,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:50,178 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:50,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:41:50,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:41:50,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:50,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:41:50,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:41:50,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:50,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 26] total 33 [2019-10-01 23:41:50,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:41:50,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:41:50,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:41:50,477 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 33 states. [2019-10-01 23:41:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:50,721 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2019-10-01 23:41:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:41:50,722 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2019-10-01 23:41:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:50,723 INFO L225 Difference]: With dead ends: 105 [2019-10-01 23:41:50,723 INFO L226 Difference]: Without dead ends: 85 [2019-10-01 23:41:50,724 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:41:50,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-01 23:41:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2019-10-01 23:41:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 23:41:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-01 23:41:50,734 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 46 [2019-10-01 23:41:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:50,734 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-01 23:41:50,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:41:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-01 23:41:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 23:41:50,735 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:50,736 INFO L411 BasicCegarLoop]: trace histogram [30, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:50,736 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1314604649, now seen corresponding path program 9 times [2019-10-01 23:41:50,736 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:50,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:50,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:50,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:50,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:41:50,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:50,877 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:41:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:51,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:41:51,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:51,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:41:51,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:41:51,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:51,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:41:51,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:41:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:41:51,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:41:51,380 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 13 states. [2019-10-01 23:41:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:51,524 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-10-01 23:41:51,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:41:51,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-10-01 23:41:51,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:51,526 INFO L225 Difference]: With dead ends: 99 [2019-10-01 23:41:51,526 INFO L226 Difference]: Without dead ends: 89 [2019-10-01 23:41:51,527 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:41:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-01 23:41:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-10-01 23:41:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 23:41:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-01 23:41:51,536 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2019-10-01 23:41:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:51,536 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-01 23:41:51,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:41:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-01 23:41:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 23:41:51,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:51,537 INFO L411 BasicCegarLoop]: trace histogram [30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:51,538 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash -19822330, now seen corresponding path program 10 times [2019-10-01 23:41:51,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:51,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:51,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:51,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:41:51,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:51,682 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:41:51,706 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-10-01 23:41:51,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:41:51,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:51,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:41:51,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:41:52,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:52,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 33] total 41 [2019-10-01 23:41:52,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:41:52,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:41:52,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:41:52,063 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 41 states. [2019-10-01 23:41:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:52,316 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2019-10-01 23:41:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:41:52,316 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 55 [2019-10-01 23:41:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:52,318 INFO L225 Difference]: With dead ends: 123 [2019-10-01 23:41:52,319 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 23:41:52,320 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:41:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 23:41:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 68. [2019-10-01 23:41:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 23:41:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-10-01 23:41:52,330 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 55 [2019-10-01 23:41:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:52,330 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-10-01 23:41:52,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:41:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-10-01 23:41:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 23:41:52,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:52,332 INFO L411 BasicCegarLoop]: trace histogram [38, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:52,332 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1728612361, now seen corresponding path program 11 times [2019-10-01 23:41:52,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:52,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:52,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:52,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:52,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-01 23:41:52,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:52,516 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:52,544 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:42:33,172 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-10-01 23:42:33,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:33,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:42:33,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 23:42:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:33,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 41] total 49 [2019-10-01 23:42:33,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 23:42:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 23:42:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:42:33,568 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 49 states. [2019-10-01 23:42:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:33,931 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2019-10-01 23:42:33,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:42:33,931 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 64 [2019-10-01 23:42:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:33,932 INFO L225 Difference]: With dead ends: 136 [2019-10-01 23:42:33,932 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 23:42:33,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:42:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 23:42:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2019-10-01 23:42:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 23:42:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2019-10-01 23:42:33,959 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 64 [2019-10-01 23:42:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:33,960 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2019-10-01 23:42:33,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 23:42:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2019-10-01 23:42:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-01 23:42:33,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:33,962 INFO L411 BasicCegarLoop]: trace histogram [46, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:33,963 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:33,966 INFO L82 PathProgramCache]: Analyzing trace with hash 429084006, now seen corresponding path program 12 times [2019-10-01 23:42:33,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:33,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:33,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 23:42:34,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:34,178 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:34,226 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:42:58,699 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:42:58,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:58,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:42:58,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 23:42:58,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:58,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:42:58,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:42:58,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:42:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:42:58,742 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 16 states. [2019-10-01 23:42:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:58,925 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2019-10-01 23:42:58,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:42:58,926 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2019-10-01 23:42:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:58,930 INFO L225 Difference]: With dead ends: 127 [2019-10-01 23:42:58,930 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 23:42:58,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:42:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 23:42:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 78. [2019-10-01 23:42:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 23:42:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-01 23:42:58,949 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 73 [2019-10-01 23:42:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:58,950 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-01 23:42:58,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:42:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-01 23:42:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 23:42:58,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:58,954 INFO L411 BasicCegarLoop]: trace histogram [46, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:58,954 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1701158487, now seen corresponding path program 13 times [2019-10-01 23:42:58,954 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:58,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:58,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 23:42:59,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:59,181 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:59,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:59,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 23:42:59,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-01 23:42:59,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:59,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 49] total 58 [2019-10-01 23:42:59,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 23:42:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 23:42:59,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:42:59,677 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 58 states. [2019-10-01 23:43:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:00,139 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2019-10-01 23:43:00,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 23:43:00,142 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2019-10-01 23:43:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:00,143 INFO L225 Difference]: With dead ends: 155 [2019-10-01 23:43:00,143 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 23:43:00,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:43:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 23:43:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2019-10-01 23:43:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 23:43:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-10-01 23:43:00,154 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 74 [2019-10-01 23:43:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:00,155 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-10-01 23:43:00,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 23:43:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-10-01 23:43:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 23:43:00,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:00,156 INFO L411 BasicCegarLoop]: trace histogram [55, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:00,157 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2052114922, now seen corresponding path program 14 times [2019-10-01 23:43:00,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:00,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:00,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:00,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:43:00,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1645 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-01 23:43:00,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:00,388 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:00,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:43:00,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:43:00,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:00,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 23:43:00,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1645 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:43:01,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:01,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 58] total 67 [2019-10-01 23:43:01,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:43:01,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:43:01,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:43:01,034 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 67 states. [2019-10-01 23:43:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:01,444 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2019-10-01 23:43:01,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 23:43:01,444 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 84 [2019-10-01 23:43:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:01,447 INFO L225 Difference]: With dead ends: 169 [2019-10-01 23:43:01,447 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 23:43:01,449 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:43:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 23:43:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2019-10-01 23:43:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 23:43:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-10-01 23:43:01,457 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 84 [2019-10-01 23:43:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:01,457 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-10-01 23:43:01,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:43:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-10-01 23:43:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-01 23:43:01,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:01,459 INFO L411 BasicCegarLoop]: trace histogram [64, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:01,459 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:01,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:01,460 INFO L82 PathProgramCache]: Analyzing trace with hash -210793271, now seen corresponding path program 15 times [2019-10-01 23:43:01,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:01,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:01,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:01,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:01,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-10-01 23:43:01,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:01,690 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:01,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:43:06,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:43:06,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:06,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:43:06,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:43:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:06,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:43:06,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:43:06,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:43:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:43:06,664 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 19 states. [2019-10-01 23:43:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:06,885 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2019-10-01 23:43:06,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:43:06,889 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2019-10-01 23:43:06,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:06,891 INFO L225 Difference]: With dead ends: 157 [2019-10-01 23:43:06,891 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 23:43:06,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:43:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 23:43:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2019-10-01 23:43:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 23:43:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-10-01 23:43:06,898 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 94 [2019-10-01 23:43:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:06,899 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-10-01 23:43:06,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:43:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-10-01 23:43:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 23:43:06,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:06,900 INFO L411 BasicCegarLoop]: trace histogram [64, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:06,901 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash -62517594, now seen corresponding path program 16 times [2019-10-01 23:43:06,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:06,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:06,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-10-01 23:43:07,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:07,162 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:07,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:43:07,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:43:07,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:07,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 23:43:07,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:43:08,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:08,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 67] total 77 [2019-10-01 23:43:08,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 23:43:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 23:43:08,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:43:08,097 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 77 states. [2019-10-01 23:43:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:08,708 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2019-10-01 23:43:08,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 23:43:08,709 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 95 [2019-10-01 23:43:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:08,710 INFO L225 Difference]: With dead ends: 189 [2019-10-01 23:43:08,710 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 23:43:08,712 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:43:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 23:43:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2019-10-01 23:43:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 23:43:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-10-01 23:43:08,719 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 95 [2019-10-01 23:43:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:08,719 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-10-01 23:43:08,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 23:43:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-10-01 23:43:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-01 23:43:08,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:08,721 INFO L411 BasicCegarLoop]: trace histogram [74, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:08,721 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:08,722 INFO L82 PathProgramCache]: Analyzing trace with hash 851067369, now seen corresponding path program 17 times [2019-10-01 23:43:08,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:08,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:08,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:43:09,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:09,037 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:09,075 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:44:55,978 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-10-01 23:44:55,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:56,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:44:56,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:44:56,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:56,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:44:56,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:44:56,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:44:56,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:44:56,063 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 21 states. [2019-10-01 23:44:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:56,318 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2019-10-01 23:44:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:44:56,318 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-10-01 23:44:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:56,320 INFO L225 Difference]: With dead ends: 175 [2019-10-01 23:44:56,321 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 23:44:56,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:44:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 23:44:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 111. [2019-10-01 23:44:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 23:44:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2019-10-01 23:44:56,329 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 106 [2019-10-01 23:44:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:56,329 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2019-10-01 23:44:56,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:44:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2019-10-01 23:44:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 23:44:56,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:56,331 INFO L411 BasicCegarLoop]: trace histogram [74, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:56,331 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:56,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1504576122, now seen corresponding path program 18 times [2019-10-01 23:44:56,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:56,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:56,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:56,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:56,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2946 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:44:56,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:56,609 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:44:56,644 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:46:22,482 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:46:22,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:22,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:46:22,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2946 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:46:22,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:22,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:46:22,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:46:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:46:22,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:46:22,547 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 22 states. [2019-10-01 23:46:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:22,819 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2019-10-01 23:46:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:46:22,821 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2019-10-01 23:46:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:22,823 INFO L225 Difference]: With dead ends: 179 [2019-10-01 23:46:22,823 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:46:22,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:46:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:46:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2019-10-01 23:46:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 23:46:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-10-01 23:46:22,830 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-10-01 23:46:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:22,830 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-10-01 23:46:22,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:46:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-10-01 23:46:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 23:46:22,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:22,831 INFO L411 BasicCegarLoop]: trace histogram [74, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:22,831 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:22,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1515080311, now seen corresponding path program 19 times [2019-10-01 23:46:22,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:22,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:22,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:22,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:46:23,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:23,246 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:23,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:46:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:23,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-01 23:46:23,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-01 23:46:24,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:24,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 77] total 88 [2019-10-01 23:46:24,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-10-01 23:46:24,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-10-01 23:46:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=3829, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 23:46:24,295 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 88 states. [2019-10-01 23:46:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:24,908 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2019-10-01 23:46:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-01 23:46:24,912 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 108 [2019-10-01 23:46:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:24,914 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:46:24,914 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 23:46:24,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5737 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3827, Invalid=3829, Unknown=0, NotChecked=0, Total=7656 [2019-10-01 23:46:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 23:46:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 124. [2019-10-01 23:46:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-01 23:46:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-10-01 23:46:24,928 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 108 [2019-10-01 23:46:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:24,928 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-10-01 23:46:24,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-10-01 23:46:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-10-01 23:46:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-01 23:46:24,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:24,929 INFO L411 BasicCegarLoop]: trace histogram [85, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:24,929 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:24,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:24,930 INFO L82 PathProgramCache]: Analyzing trace with hash 883119242, now seen corresponding path program 20 times [2019-10-01 23:46:24,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:24,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:24,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:46:24,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3865 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-10-01 23:46:25,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:25,369 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:25,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:46:25,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:46:25,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:25,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 87 conjunts are in the unsatisfiable core [2019-10-01 23:46:25,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3865 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:46:26,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:26,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 88] total 99 [2019-10-01 23:46:26,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-01 23:46:26,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-01 23:46:26,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4850, Invalid=4852, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 23:46:26,464 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 99 states. [2019-10-01 23:46:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:27,265 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2019-10-01 23:46:27,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-01 23:46:27,265 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 120 [2019-10-01 23:46:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:27,267 INFO L225 Difference]: With dead ends: 231 [2019-10-01 23:46:27,268 INFO L226 Difference]: Without dead ends: 199 [2019-10-01 23:46:27,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7417 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=4850, Invalid=4852, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 23:46:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-01 23:46:27,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 136. [2019-10-01 23:46:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-01 23:46:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-10-01 23:46:27,278 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 120 [2019-10-01 23:46:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:27,278 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-10-01 23:46:27,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-01 23:46:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-10-01 23:46:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 23:46:27,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:27,279 INFO L411 BasicCegarLoop]: trace histogram [96, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:27,280 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1660633175, now seen corresponding path program 21 times [2019-10-01 23:46:27,280 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:27,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:27,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:27,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:27,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4887 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-10-01 23:46:27,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:27,644 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:27,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:47:15,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:47:15,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:15,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:47:15,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4887 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-10-01 23:47:15,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:15,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:47:15,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:47:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:47:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:47:15,322 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 25 states. [2019-10-01 23:47:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:15,686 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2019-10-01 23:47:15,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:47:15,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-10-01 23:47:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:15,689 INFO L225 Difference]: With dead ends: 213 [2019-10-01 23:47:15,690 INFO L226 Difference]: Without dead ends: 203 [2019-10-01 23:47:15,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:47:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-01 23:47:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 137. [2019-10-01 23:47:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-01 23:47:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2019-10-01 23:47:15,698 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 132 [2019-10-01 23:47:15,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:15,699 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2019-10-01 23:47:15,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:47:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2019-10-01 23:47:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-01 23:47:15,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:15,700 INFO L411 BasicCegarLoop]: trace histogram [96, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:15,700 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2057881658, now seen corresponding path program 22 times [2019-10-01 23:47:15,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:15,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:15,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:15,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:15,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4909 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-10-01 23:47:16,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:16,131 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:16,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:47:16,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:47:16,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:16,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-01 23:47:16,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4909 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 23:47:17,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:17,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 99] total 111 [2019-10-01 23:47:17,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-01 23:47:17,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-01 23:47:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6104, Invalid=6106, Unknown=0, NotChecked=0, Total=12210 [2019-10-01 23:47:17,580 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 111 states. [2019-10-01 23:47:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:18,616 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2019-10-01 23:47:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-01 23:47:18,617 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 133 [2019-10-01 23:47:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:18,619 INFO L225 Difference]: With dead ends: 253 [2019-10-01 23:47:18,619 INFO L226 Difference]: Without dead ends: 219 [2019-10-01 23:47:18,621 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9465 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=6104, Invalid=6106, Unknown=0, NotChecked=0, Total=12210 [2019-10-01 23:47:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-01 23:47:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 150. [2019-10-01 23:47:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-01 23:47:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-10-01 23:47:18,628 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 133 [2019-10-01 23:47:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:18,629 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-10-01 23:47:18,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-01 23:47:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-10-01 23:47:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 23:47:18,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:18,630 INFO L411 BasicCegarLoop]: trace histogram [108, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:18,630 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:18,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:18,631 INFO L82 PathProgramCache]: Analyzing trace with hash -860805047, now seen corresponding path program 23 times [2019-10-01 23:47:18,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:18,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:18,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:18,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:18,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 5886 trivial. 0 not checked. [2019-10-01 23:47:19,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:19,224 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:19,290 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:51:41,620 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-10-01 23:51:41,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:41,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 110 conjunts are in the unsatisfiable core [2019-10-01 23:51:41,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 23:51:42,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:42,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 111] total 122 [2019-10-01 23:51:42,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-10-01 23:51:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-10-01 23:51:42,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7380, Invalid=7382, Unknown=0, NotChecked=0, Total=14762 [2019-10-01 23:51:42,715 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 122 states. [2019-10-01 23:51:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:43,839 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2019-10-01 23:51:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-10-01 23:51:43,845 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 146 [2019-10-01 23:51:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:43,846 INFO L225 Difference]: With dead ends: 269 [2019-10-01 23:51:43,847 INFO L226 Difference]: Without dead ends: 234 [2019-10-01 23:51:43,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11593 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7380, Invalid=7382, Unknown=0, NotChecked=0, Total=14762 [2019-10-01 23:51:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-01 23:51:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 162. [2019-10-01 23:51:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-01 23:51:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2019-10-01 23:51:43,856 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 146 [2019-10-01 23:51:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:43,857 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2019-10-01 23:51:43,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-10-01 23:51:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2019-10-01 23:51:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-01 23:51:43,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:43,858 INFO L411 BasicCegarLoop]: trace histogram [119, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:43,858 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:43,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1908416202, now seen corresponding path program 24 times [2019-10-01 23:51:43,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:43,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:43,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:43,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:43,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7440 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2019-10-01 23:51:44,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:44,364 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:44,420 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:54:42,292 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:54:42,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:42,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:54:42,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7440 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2019-10-01 23:54:42,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:42,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:54:42,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:54:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:54:42,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:54:42,409 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 28 states. [2019-10-01 23:54:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:42,724 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2019-10-01 23:54:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:54:42,725 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 158 [2019-10-01 23:54:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:42,727 INFO L225 Difference]: With dead ends: 248 [2019-10-01 23:54:42,727 INFO L226 Difference]: Without dead ends: 238 [2019-10-01 23:54:42,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:54:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-01 23:54:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 163. [2019-10-01 23:54:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 23:54:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2019-10-01 23:54:42,737 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 158 [2019-10-01 23:54:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:42,738 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2019-10-01 23:54:42,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:54:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2019-10-01 23:54:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-01 23:54:42,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:42,739 INFO L411 BasicCegarLoop]: trace histogram [119, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:42,739 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:42,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:42,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1208466629, now seen corresponding path program 25 times [2019-10-01 23:54:42,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:42,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:42,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7465 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2019-10-01 23:54:43,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:43,211 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:54:43,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:54:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:43,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 121 conjunts are in the unsatisfiable core [2019-10-01 23:54:43,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7465 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:54:44,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:44,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 122] total 134 [2019-10-01 23:54:44,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-10-01 23:54:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-10-01 23:54:44,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8910, Invalid=8912, Unknown=0, NotChecked=0, Total=17822 [2019-10-01 23:54:44,647 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 134 states. [2019-10-01 23:54:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:46,286 INFO L93 Difference]: Finished difference Result 291 states and 333 transitions. [2019-10-01 23:54:46,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-10-01 23:54:46,286 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 159 [2019-10-01 23:54:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:46,288 INFO L225 Difference]: With dead ends: 291 [2019-10-01 23:54:46,288 INFO L226 Difference]: Without dead ends: 254 [2019-10-01 23:54:46,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14129 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=8910, Invalid=8912, Unknown=0, NotChecked=0, Total=17822 [2019-10-01 23:54:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-01 23:54:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2019-10-01 23:54:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-01 23:54:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2019-10-01 23:54:46,300 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 159 [2019-10-01 23:54:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:46,301 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2019-10-01 23:54:46,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-10-01 23:54:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2019-10-01 23:54:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 23:54:46,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:46,302 INFO L411 BasicCegarLoop]: trace histogram [131, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:46,302 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:46,302 INFO L82 PathProgramCache]: Analyzing trace with hash 829227818, now seen corresponding path program 26 times [2019-10-01 23:54:46,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:46,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:54:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8997 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2019-10-01 23:54:47,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:47,078 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:54:47,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:54:47,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:54:47,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:47,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 133 conjunts are in the unsatisfiable core [2019-10-01 23:54:47,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8997 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:54:48,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:48,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 134] total 145 [2019-10-01 23:54:48,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-10-01 23:54:48,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-10-01 23:54:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10439, Invalid=10441, Unknown=0, NotChecked=0, Total=20880 [2019-10-01 23:54:48,649 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 145 states. [2019-10-01 23:54:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:50,386 INFO L93 Difference]: Finished difference Result 307 states and 349 transitions. [2019-10-01 23:54:50,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-01 23:54:50,386 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 172 [2019-10-01 23:54:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:50,388 INFO L225 Difference]: With dead ends: 307 [2019-10-01 23:54:50,388 INFO L226 Difference]: Without dead ends: 269 [2019-10-01 23:54:50,391 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16693 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=10439, Invalid=10441, Unknown=0, NotChecked=0, Total=20880 [2019-10-01 23:54:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-01 23:54:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 188. [2019-10-01 23:54:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-01 23:54:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2019-10-01 23:54:50,400 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 172 [2019-10-01 23:54:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:50,401 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2019-10-01 23:54:50,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-10-01 23:54:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2019-10-01 23:54:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 23:54:50,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:50,402 INFO L411 BasicCegarLoop]: trace histogram [142, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:50,402 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:50,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1900714761, now seen corresponding path program 27 times [2019-10-01 23:54:50,403 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:50,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:50,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:50,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:50,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10531 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 10153 trivial. 0 not checked. [2019-10-01 23:54:50,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:50,985 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:54:51,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:56:16,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:56:16,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:16,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:56:16,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:56:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10531 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 10153 trivial. 0 not checked. [2019-10-01 23:56:16,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:56:16,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:56:16,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:56:16,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:56:16,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:56:16,595 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 31 states. [2019-10-01 23:56:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:56:16,940 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2019-10-01 23:56:16,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:56:16,941 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 184 [2019-10-01 23:56:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:56:16,943 INFO L225 Difference]: With dead ends: 283 [2019-10-01 23:56:16,943 INFO L226 Difference]: Without dead ends: 273 [2019-10-01 23:56:16,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:56:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-01 23:56:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 189. [2019-10-01 23:56:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 23:56:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 191 transitions. [2019-10-01 23:56:16,954 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 191 transitions. Word has length 184 [2019-10-01 23:56:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:56:16,955 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 191 transitions. [2019-10-01 23:56:16,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:56:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 191 transitions. [2019-10-01 23:56:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-01 23:56:16,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:56:16,957 INFO L411 BasicCegarLoop]: trace histogram [142, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:56:16,958 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:56:16,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:56:16,959 INFO L82 PathProgramCache]: Analyzing trace with hash 969721958, now seen corresponding path program 28 times [2019-10-01 23:56:16,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:56:16,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:56:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:16,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:56:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:56:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:56:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10559 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 10153 trivial. 0 not checked. [2019-10-01 23:56:17,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:56:17,694 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:56:17,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:56:17,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:56:17,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:56:17,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 144 conjunts are in the unsatisfiable core [2019-10-01 23:56:17,936 INFO L279 TraceCheckSpWp]: Computing forward predicates...