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_strcpy_original-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:40:27,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:40:27,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:40:27,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:40:27,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:40:27,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:40:27,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:40:27,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:40:27,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:40:27,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:40:27,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:40:27,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:40:27,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:40:27,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:40:27,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:40:27,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:40:27,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:40:27,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:40:27,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:40:27,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:40:27,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:40:27,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:40:27,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:40:27,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:40:27,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:40:27,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:40:27,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:40:27,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:40:27,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:40:27,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:40:27,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:40:27,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:40:27,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:40:27,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:40:27,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:40:27,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:40:27,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:40:27,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:40:27,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:40:27,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:40:27,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:40:27,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 23:40:27,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:40:27,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:40:27,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:40:27,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:40:27,199 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:40:27,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:40:27,200 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:40:27,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:40:27,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:40:27,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:40:27,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:40:27,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:40:27,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:40:27,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:40:27,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:40:27,202 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:40:27,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:40:27,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:40:27,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:40:27,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:40:27,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:40:27,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:40:27,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:40:27,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:40:27,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:40:27,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:40:27,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:40:27,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:40:27,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:40:27,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:40:27,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:40:27,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:40:27,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:40:27,250 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:40:27,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original-2.i [2019-10-01 23:40:27,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e80a812c/c3c4edf8d6b8432aba1552bcbd7d30b4/FLAG2ef58a4cc [2019-10-01 23:40:27,723 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:40:27,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_original-2.i [2019-10-01 23:40:27,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e80a812c/c3c4edf8d6b8432aba1552bcbd7d30b4/FLAG2ef58a4cc [2019-10-01 23:40:28,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e80a812c/c3c4edf8d6b8432aba1552bcbd7d30b4 [2019-10-01 23:40:28,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:40:28,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:40:28,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:40:28,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:40:28,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:40:28,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2837cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28, skipping insertion in model container [2019-10-01 23:40:28,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,169 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:40:28,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:40:28,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:40:28,393 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:40:28,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:40:28,524 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:40:28,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28 WrapperNode [2019-10-01 23:40:28,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:40:28,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:40:28,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:40:28,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:40:28,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (1/1) ... [2019-10-01 23:40:28,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:40:28,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:40:28,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:40:28,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:40:28,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:40:28,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:40:28,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:40:28,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:40:28,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:40:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:40:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:40:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:40:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:40:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:40:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:40:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:40:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:40:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:40:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:40:28,866 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:40:28,866 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:40:28,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:40:28 BoogieIcfgContainer [2019-10-01 23:40:28,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:40:28,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:40:28,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:40:28,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:40:28,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:40:28" (1/3) ... [2019-10-01 23:40:28,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f11c7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:40:28, skipping insertion in model container [2019-10-01 23:40:28,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:40:28" (2/3) ... [2019-10-01 23:40:28,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f11c7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:40:28, skipping insertion in model container [2019-10-01 23:40:28,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:40:28" (3/3) ... [2019-10-01 23:40:28,875 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original-2.i [2019-10-01 23:40:28,894 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:40:28,902 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:40:28,954 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:40:29,012 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:40:29,013 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:40:29,013 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:40:29,013 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:40:29,013 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:40:29,013 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:40:29,013 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:40:29,014 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:40:29,014 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:40:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-01 23:40:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 23:40:29,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:29,037 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:40:29,038 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1229081071, now seen corresponding path program 1 times [2019-10-01 23:40:29,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:29,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:29,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:29,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:40:29,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:40:29,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:40:29,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:40:29,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:40:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:40:29,203 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-01 23:40:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:29,229 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-10-01 23:40:29,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:40:29,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-01 23:40:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:29,239 INFO L225 Difference]: With dead ends: 47 [2019-10-01 23:40:29,239 INFO L226 Difference]: Without dead ends: 22 [2019-10-01 23:40:29,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:40:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-01 23:40:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-01 23:40:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-01 23:40:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-01 23:40:29,295 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2019-10-01 23:40:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:29,295 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-01 23:40:29,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:40:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-01 23:40:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 23:40:29,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:29,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:29,301 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:29,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash -959296020, now seen corresponding path program 1 times [2019-10-01 23:40:29,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:29,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:29,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:29,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:29,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:40:29,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:40:29,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:40:29,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:40:29,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:40:29,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:40:29,386 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-10-01 23:40:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:29,399 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2019-10-01 23:40:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:40:29,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-01 23:40:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:29,401 INFO L225 Difference]: With dead ends: 38 [2019-10-01 23:40:29,401 INFO L226 Difference]: Without dead ends: 23 [2019-10-01 23:40:29,403 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:40:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-01 23:40:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-01 23:40:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-01 23:40:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-01 23:40:29,409 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2019-10-01 23:40:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:29,409 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-01 23:40:29,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:40:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-01 23:40:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 23:40:29,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:29,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:29,411 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:29,416 INFO L82 PathProgramCache]: Analyzing trace with hash 71345632, now seen corresponding path program 1 times [2019-10-01 23:40:29,416 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:29,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:29,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:40:29,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:29,502 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) [2019-10-01 23:40:29,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:29,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:40:29,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:40:29,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:29,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:40:29,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:40:29,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:40:29,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:40:29,650 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2019-10-01 23:40:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:29,683 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-10-01 23:40:29,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:40:29,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-01 23:40:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:29,686 INFO L225 Difference]: With dead ends: 39 [2019-10-01 23:40:29,686 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 23:40:29,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:40:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 23:40:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-01 23:40:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 23:40:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-10-01 23:40:29,693 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2019-10-01 23:40:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:29,693 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-01 23:40:29,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:40:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-10-01 23:40:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:40:29,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:29,694 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:29,695 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:29,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:29,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1956465772, now seen corresponding path program 2 times [2019-10-01 23:40:29,695 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:29,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:29,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:40:29,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:29,755 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:40:29,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:29,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-01 23:40:29,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:29,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:40:29,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:40:29,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 23:40:29,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-01 23:40:29,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:40:29,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:40:29,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:40:29,928 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 10 states. [2019-10-01 23:40:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:30,187 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-10-01 23:40:30,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:40:30,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-10-01 23:40:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:30,190 INFO L225 Difference]: With dead ends: 56 [2019-10-01 23:40:30,190 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 23:40:30,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:40:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 23:40:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-10-01 23:40:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:40:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 23:40:30,201 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-10-01 23:40:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:30,202 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 23:40:30,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:40:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 23:40:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 23:40:30,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:30,203 INFO L411 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:30,203 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash -127379042, now seen corresponding path program 1 times [2019-10-01 23:40:30,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:30,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 23:40:30,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:40:30,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-01 23:40:30,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 23:40:30,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 23:40:30,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-01 23:40:30,263 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-10-01 23:40:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:30,313 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-10-01 23:40:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:40:30,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-01 23:40:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:30,315 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:40:30,315 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 23:40:30,315 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:40:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 23:40:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-10-01 23:40:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:40:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-01 23:40:30,321 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 21 [2019-10-01 23:40:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:30,321 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-01 23:40:30,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 23:40:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-01 23:40:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 23:40:30,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:30,323 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:30,323 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash -81574727, now seen corresponding path program 1 times [2019-10-01 23:40:30,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:30,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:30,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:30,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:30,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:30,387 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:40:30,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:30,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:30,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:30,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:40:30,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:30,455 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:40:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:40:30,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:40:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:40:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:40:30,459 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2019-10-01 23:40:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:30,485 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-10-01 23:40:30,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:40:30,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-01 23:40:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:30,486 INFO L225 Difference]: With dead ends: 47 [2019-10-01 23:40:30,487 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 23:40:30,487 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:40:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 23:40:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-01 23:40:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:40:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-01 23:40:30,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2019-10-01 23:40:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:30,493 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-01 23:40:30,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:40:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-01 23:40:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:40:30,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:30,494 INFO L411 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:30,494 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1750805075, now seen corresponding path program 2 times [2019-10-01 23:40:30,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:30,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:30,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:30,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:40:30,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:30,610 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:30,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:30,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:30,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:30,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:40:30,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:40:30,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:30,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:40:30,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:40:30,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:40:30,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:40:30,679 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-10-01 23:40:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:30,703 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-10-01 23:40:30,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:40:30,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-10-01 23:40:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:30,704 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:40:30,704 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 23:40:30,705 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:40:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 23:40:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-01 23:40:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-01 23:40:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-01 23:40:30,710 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2019-10-01 23:40:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:30,710 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-01 23:40:30,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:40:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-01 23:40:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-01 23:40:30,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:30,711 INFO L411 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:30,712 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1957338311, now seen corresponding path program 3 times [2019-10-01 23:40:30,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:30,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:30,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:30,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:40:30,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:30,790 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:30,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:40:30,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 23:40:30,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:30,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:40:30,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:30,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:40:30,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:30,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:30,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:30,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-01 23:40:30,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2019-10-01 23:40:30,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:30,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:30,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:30,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-01 23:40:31,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:40:31,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:31,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:31,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:31,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:40:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:40:31,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:31,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-10-01 23:40:31,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:40:31,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:40:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:40:31,055 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 14 states. [2019-10-01 23:40:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:31,387 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2019-10-01 23:40:31,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:40:31,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-10-01 23:40:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:31,388 INFO L225 Difference]: With dead ends: 58 [2019-10-01 23:40:31,388 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 23:40:31,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:40:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 23:40:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 23:40:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 23:40:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-01 23:40:31,399 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 26 [2019-10-01 23:40:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:31,399 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-01 23:40:31,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:40:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-01 23:40:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-01 23:40:31,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:31,403 INFO L411 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:31,404 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 222681613, now seen corresponding path program 1 times [2019-10-01 23:40:31,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:31,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:31,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:31,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:31,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:40:31,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:31,542 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:40:31,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:31,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:40:31,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 23:40:31,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:31,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:40:31,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:40:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:40:31,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:40:31,632 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2019-10-01 23:40:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:31,658 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-10-01 23:40:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:40:31,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-10-01 23:40:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:31,665 INFO L225 Difference]: With dead ends: 66 [2019-10-01 23:40:31,665 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 23:40:31,666 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:40:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 23:40:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-01 23:40:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 23:40:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-10-01 23:40:31,675 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2019-10-01 23:40:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:31,675 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-10-01 23:40:31,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:40:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-10-01 23:40:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 23:40:31,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:31,679 INFO L411 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:31,681 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash -120480511, now seen corresponding path program 2 times [2019-10-01 23:40:31,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:31,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:31,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:31,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:31,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:40:31,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:31,802 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:31,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:31,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:31,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:31,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:40:31,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 23:40:31,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:31,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:40:31,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:40:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:40:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:40:31,882 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 11 states. [2019-10-01 23:40:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:31,910 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-10-01 23:40:31,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:40:31,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-10-01 23:40:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:31,915 INFO L225 Difference]: With dead ends: 67 [2019-10-01 23:40:31,916 INFO L226 Difference]: Without dead ends: 41 [2019-10-01 23:40:31,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:40:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-01 23:40:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-01 23:40:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 23:40:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-01 23:40:31,926 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2019-10-01 23:40:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:31,926 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-01 23:40:31,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:40:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-01 23:40:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 23:40:31,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:31,928 INFO L411 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:31,928 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:31,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:31,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2126395533, now seen corresponding path program 3 times [2019-10-01 23:40:31,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:31,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:31,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:40:32,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:32,029 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) [2019-10-01 23:40:32,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:32,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 23:40:32,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:32,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:40:32,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:32,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:40:32,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:32,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-01 23:40:32,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:40:32,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:40:32,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:40:32,295 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 19 states. [2019-10-01 23:40:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:32,753 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-10-01 23:40:32,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:40:32,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-10-01 23:40:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:32,755 INFO L225 Difference]: With dead ends: 96 [2019-10-01 23:40:32,755 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 23:40:32,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:40:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 23:40:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2019-10-01 23:40:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-01 23:40:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-01 23:40:32,774 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 38 [2019-10-01 23:40:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:32,774 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-01 23:40:32,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:40:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-01 23:40:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 23:40:32,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:32,776 INFO L411 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:32,776 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1371132419, now seen corresponding path program 1 times [2019-10-01 23:40:32,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:32,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:32,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:40:32,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:32,884 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:32,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:32,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:40:32,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 23:40:32,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:32,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:40:32,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:40:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:40:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:40:32,963 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 13 states. [2019-10-01 23:40:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:32,988 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-10-01 23:40:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:40:32,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-10-01 23:40:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:32,990 INFO L225 Difference]: With dead ends: 75 [2019-10-01 23:40:32,990 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 23:40:32,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:40:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 23:40:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-01 23:40:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 23:40:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-01 23:40:32,998 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 39 [2019-10-01 23:40:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:32,998 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-01 23:40:32,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:40:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-01 23:40:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 23:40:32,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:33,000 INFO L411 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:33,000 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 250460815, now seen corresponding path program 2 times [2019-10-01 23:40:33,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:33,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:33,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:33,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:40:33,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:33,104 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:33,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:33,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:33,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:33,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:40:33,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:40:33,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:33,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:40:33,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:40:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:40:33,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:40:33,180 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 14 states. [2019-10-01 23:40:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:33,206 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 23:40:33,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:40:33,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-10-01 23:40:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:33,208 INFO L225 Difference]: With dead ends: 76 [2019-10-01 23:40:33,208 INFO L226 Difference]: Without dead ends: 47 [2019-10-01 23:40:33,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:40:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-01 23:40:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-01 23:40:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 23:40:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 23:40:33,215 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 40 [2019-10-01 23:40:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:33,215 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 23:40:33,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:40:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 23:40:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 23:40:33,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:33,216 INFO L411 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:33,217 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:33,217 INFO L82 PathProgramCache]: Analyzing trace with hash -130620541, now seen corresponding path program 3 times [2019-10-01 23:40:33,217 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:33,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:33,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:33,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 23:40:33,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:33,321 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:33,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:40:33,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 23:40:33,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:33,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:40:33,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:33,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-01 23:40:33,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:33,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-10-01 23:40:33,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:40:33,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:40:33,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:40:33,424 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 17 states. [2019-10-01 23:40:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:33,688 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 23:40:33,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:40:33,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-10-01 23:40:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:33,690 INFO L225 Difference]: With dead ends: 83 [2019-10-01 23:40:33,690 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 23:40:33,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=630, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:40:33,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 23:40:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2019-10-01 23:40:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-01 23:40:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-10-01 23:40:33,697 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 41 [2019-10-01 23:40:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:33,697 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-10-01 23:40:33,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:40:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-10-01 23:40:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 23:40:33,698 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:33,698 INFO L411 BasicCegarLoop]: trace histogram [12, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:33,699 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -481660210, now seen corresponding path program 4 times [2019-10-01 23:40:33,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:33,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:33,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 23:40:33,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:33,819 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:33,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:40:33,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:40:33,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:33,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:40:33,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:40:33,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:33,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:40:33,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:40:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:40:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:40:33,918 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 16 states. [2019-10-01 23:40:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:33,951 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-10-01 23:40:33,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:40:33,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-10-01 23:40:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:33,954 INFO L225 Difference]: With dead ends: 78 [2019-10-01 23:40:33,954 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 23:40:33,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:40:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 23:40:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-01 23:40:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 23:40:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-10-01 23:40:33,972 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 45 [2019-10-01 23:40:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:33,972 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-10-01 23:40:33,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:40:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-10-01 23:40:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 23:40:33,973 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:33,973 INFO L411 BasicCegarLoop]: trace histogram [13, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:33,973 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1104724570, now seen corresponding path program 5 times [2019-10-01 23:40:33,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:33,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:33,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 23:40:34,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:34,111 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:34,136 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:40:34,230 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-01 23:40:34,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:34,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:40:34,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 23:40:34,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:34,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:40:34,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:40:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:40:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:40:34,258 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 17 states. [2019-10-01 23:40:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:34,282 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-10-01 23:40:34,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:40:34,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-10-01 23:40:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:34,285 INFO L225 Difference]: With dead ends: 79 [2019-10-01 23:40:34,285 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 23:40:34,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:40:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 23:40:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-01 23:40:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 23:40:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-10-01 23:40:34,296 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 46 [2019-10-01 23:40:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:34,296 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-10-01 23:40:34,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:40:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-10-01 23:40:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 23:40:34,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:34,298 INFO L411 BasicCegarLoop]: trace histogram [14, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:34,298 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:34,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:34,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1256954802, now seen corresponding path program 6 times [2019-10-01 23:40:34,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:34,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:34,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:34,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:34,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 23:40:34,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:34,481 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:34,508 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:40:34,550 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 23:40:34,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:34,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:40:34,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:34,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:40:34,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:34,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:34,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:34,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-01 23:40:34,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-10-01 23:40:34,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:34,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:34,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:34,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-10-01 23:40:36,711 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) 4) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#src~0.base_BEFORE_CALL_2| |v_main_~#dst~0.base_BEFORE_CALL_1|)))) is different from true [2019-10-01 23:40:38,738 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-01 23:40:40,767 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-01 23:40:40,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:40:40,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:40,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:40,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:40,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:40:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 105 trivial. 1 not checked. [2019-10-01 23:40:42,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:42,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2019-10-01 23:40:42,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:40:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:40:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=542, Unknown=2, NotChecked=50, Total=756 [2019-10-01 23:40:42,940 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 28 states. [2019-10-01 23:40:45,556 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-01 23:40:51,735 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-10-01 23:40:55,780 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-10-01 23:40:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:57,851 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2019-10-01 23:40:57,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:40:57,852 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2019-10-01 23:40:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:57,853 INFO L225 Difference]: With dead ends: 90 [2019-10-01 23:40:57,853 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 23:40:57,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=460, Invalid=1703, Unknown=3, NotChecked=90, Total=2256 [2019-10-01 23:40:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 23:40:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-01 23:40:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 23:40:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-10-01 23:40:57,860 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 47 [2019-10-01 23:40:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:57,861 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-10-01 23:40:57,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:40:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-10-01 23:40:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 23:40:57,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:57,862 INFO L411 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:57,862 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash -427232512, now seen corresponding path program 7 times [2019-10-01 23:40:57,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:57,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:57,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:57,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:57,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 120 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 23:40:58,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:58,039 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:40:58,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:58,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:40:58,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 30 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:40:58,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:58,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:40:58,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:40:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:40:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:40:58,128 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 19 states. [2019-10-01 23:40:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:58,164 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-10-01 23:40:58,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:40:58,166 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-10-01 23:40:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:58,167 INFO L225 Difference]: With dead ends: 99 [2019-10-01 23:40:58,167 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 23:40:58,168 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 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:40:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 23:40:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-01 23:40:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 23:40:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-10-01 23:40:58,177 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 57 [2019-10-01 23:40:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:58,178 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-10-01 23:40:58,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:40:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-10-01 23:40:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-01 23:40:58,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:58,179 INFO L411 BasicCegarLoop]: trace histogram [16, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:58,179 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1094692724, now seen corresponding path program 8 times [2019-10-01 23:40:58,179 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:58,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:58,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:40:58,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 4 proven. 136 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 23:40:58,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:58,382 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:40:58,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:40:58,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:40:58,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:58,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:40:58,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-01 23:40:58,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:58,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:40:58,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:40:58,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:40:58,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:40:58,479 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 20 states. [2019-10-01 23:40:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:58,519 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-10-01 23:40:58,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:40:58,519 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2019-10-01 23:40:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:58,520 INFO L225 Difference]: With dead ends: 100 [2019-10-01 23:40:58,520 INFO L226 Difference]: Without dead ends: 62 [2019-10-01 23:40:58,521 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:40:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-01 23:40:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-01 23:40:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 23:40:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-10-01 23:40:58,527 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 58 [2019-10-01 23:40:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:58,527 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-10-01 23:40:58,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:40:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-10-01 23:40:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 23:40:58,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:58,528 INFO L411 BasicCegarLoop]: trace histogram [17, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:58,529 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:58,529 INFO L82 PathProgramCache]: Analyzing trace with hash -311122816, now seen corresponding path program 9 times [2019-10-01 23:40:58,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:58,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:58,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:58,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:58,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 4 proven. 153 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 23:40:58,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:58,716 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:40:58,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:40:58,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:40:58,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:58,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:40:58,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:59,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-01 23:40:59,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:59,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 30 [2019-10-01 23:40:59,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:40:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:40:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:40:59,089 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 30 states. [2019-10-01 23:41:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:00,048 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-01 23:41:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:41:00,049 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2019-10-01 23:41:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:00,050 INFO L225 Difference]: With dead ends: 143 [2019-10-01 23:41:00,050 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 23:41:00,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:41:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 23:41:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-10-01 23:41:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-01 23:41:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-01 23:41:00,060 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 59 [2019-10-01 23:41:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:00,061 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-01 23:41:00,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:41:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-01 23:41:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-01 23:41:00,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:00,062 INFO L411 BasicCegarLoop]: trace histogram [18, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:00,062 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1995234762, now seen corresponding path program 4 times [2019-10-01 23:41:00,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:00,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:00,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 4 proven. 171 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 23:41:00,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:00,358 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:00,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:41:00,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:41:00,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:00,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:41:00,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:00,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:41:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:41:00,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:00,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6] total 25 [2019-10-01 23:41:00,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:41:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:41:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=379, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:41:00,523 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 25 states. [2019-10-01 23:41:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:00,908 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2019-10-01 23:41:00,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:41:00,908 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2019-10-01 23:41:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:00,909 INFO L225 Difference]: With dead ends: 114 [2019-10-01 23:41:00,909 INFO L226 Difference]: Without dead ends: 73 [2019-10-01 23:41:00,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1467, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:41:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-01 23:41:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-10-01 23:41:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 23:41:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-10-01 23:41:00,916 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 60 [2019-10-01 23:41:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:00,917 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-10-01 23:41:00,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:41:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-10-01 23:41:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 23:41:00,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:00,918 INFO L411 BasicCegarLoop]: trace histogram [19, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:00,918 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1544941657, now seen corresponding path program 10 times [2019-10-01 23:41:00,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:00,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:00,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 4 proven. 190 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-01 23:41:01,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:01,144 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:01,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:41:01,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:41:01,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:01,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:41:01,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-01 23:41:01,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:01,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:41:01,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:41:01,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:41:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:41:01,238 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 23 states. [2019-10-01 23:41:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:01,283 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-10-01 23:41:01,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:41:01,298 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2019-10-01 23:41:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:01,299 INFO L225 Difference]: With dead ends: 109 [2019-10-01 23:41:01,299 INFO L226 Difference]: Without dead ends: 68 [2019-10-01 23:41:01,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:41:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-01 23:41:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-01 23:41:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 23:41:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-10-01 23:41:01,305 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 64 [2019-10-01 23:41:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:01,305 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-10-01 23:41:01,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:41:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-10-01 23:41:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 23:41:01,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:01,306 INFO L411 BasicCegarLoop]: trace histogram [20, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:01,306 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:01,306 INFO L82 PathProgramCache]: Analyzing trace with hash -999260851, now seen corresponding path program 11 times [2019-10-01 23:41:01,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:01,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 4 proven. 210 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-01 23:41:01,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:01,528 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:01,567 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:41:01,840 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 23:41:01,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:01,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:41:01,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-01 23:41:01,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:01,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:41:01,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:41:01,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:41:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:41:01,864 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 24 states. [2019-10-01 23:41:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:01,904 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-10-01 23:41:01,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:41:01,905 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2019-10-01 23:41:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:01,906 INFO L225 Difference]: With dead ends: 110 [2019-10-01 23:41:01,906 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 23:41:01,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:41:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 23:41:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-10-01 23:41:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 23:41:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-10-01 23:41:01,911 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 65 [2019-10-01 23:41:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:01,912 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-10-01 23:41:01,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:41:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-10-01 23:41:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-01 23:41:01,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:01,913 INFO L411 BasicCegarLoop]: trace histogram [21, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:01,913 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1734840025, now seen corresponding path program 12 times [2019-10-01 23:41:01,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:01,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:01,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 231 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-01 23:41:02,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:02,175 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:02,205 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:41:02,345 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:41:02,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:02,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:41:02,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:02,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:41:02,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:41:02,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:41:02,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:41:02,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-01 23:41:02,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-10-01 23:41:02,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:41:02,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:41:02,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:41:02,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-10-01 23:41:04,500 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_5| Int) (|v_main_~#dst~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_5| |v_main_~#dst~0.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_5|) 8) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) 8)))) is different from true [2019-10-01 23:41:06,572 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_3|) 8) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_6|) 8)) (not (= |v_main_~#src~0.base_BEFORE_CALL_6| |v_main_~#dst~0.base_BEFORE_CALL_3|)))) is different from true [2019-10-01 23:41:08,599 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-01 23:41:10,640 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-01 23:41:10,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:41:10,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:41:10,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:41:10,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:41:10,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:41:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 231 trivial. 7 not checked. [2019-10-01 23:41:12,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:12,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2019-10-01 23:41:12,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:41:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:41:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=955, Unknown=3, NotChecked=138, Total=1406 [2019-10-01 23:41:12,796 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 38 states. [2019-10-01 23:41:15,929 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-01 23:41:22,160 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-10-01 23:41:26,211 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-10-01 23:41:28,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:28,301 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2019-10-01 23:41:28,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 23:41:28,301 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2019-10-01 23:41:28,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:28,302 INFO L225 Difference]: With dead ends: 121 [2019-10-01 23:41:28,302 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:41:28,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=888, Invalid=3022, Unknown=4, NotChecked=246, Total=4160 [2019-10-01 23:41:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:41:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-10-01 23:41:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:41:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-10-01 23:41:28,309 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 66 [2019-10-01 23:41:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:28,309 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-10-01 23:41:28,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:41:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-10-01 23:41:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 23:41:28,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:28,310 INFO L411 BasicCegarLoop]: trace histogram [22, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:28,310 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1699497581, now seen corresponding path program 13 times [2019-10-01 23:41:28,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:28,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:28,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:28,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 6 proven. 253 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 23:41:28,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:28,588 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:41:28,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:28,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:41:28,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-01 23:41:28,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:28,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:41:28,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:41:28,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:41:28,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:41:28,710 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 26 states. [2019-10-01 23:41:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:28,744 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2019-10-01 23:41:28,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:41:28,744 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 76 [2019-10-01 23:41:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:28,745 INFO L225 Difference]: With dead ends: 130 [2019-10-01 23:41:28,745 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:41:28,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:41:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:41:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-01 23:41:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-01 23:41:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-01 23:41:28,751 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 76 [2019-10-01 23:41:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:28,751 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-01 23:41:28,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:41:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-01 23:41:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 23:41:28,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:28,753 INFO L411 BasicCegarLoop]: trace histogram [23, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:28,753 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:28,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:28,753 INFO L82 PathProgramCache]: Analyzing trace with hash 320275809, now seen corresponding path program 14 times [2019-10-01 23:41:28,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:28,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:28,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 6 proven. 276 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 23:41:29,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:29,032 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:41:29,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:41:29,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:41:29,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:29,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:41:29,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-01 23:41:29,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:29,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:41:29,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:41:29,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:41:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:41:29,153 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 27 states. [2019-10-01 23:41:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:29,205 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2019-10-01 23:41:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:41:29,206 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 77 [2019-10-01 23:41:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:29,207 INFO L225 Difference]: With dead ends: 131 [2019-10-01 23:41:29,207 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 23:41:29,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:41:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 23:41:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-01 23:41:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 23:41:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-10-01 23:41:29,217 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 77 [2019-10-01 23:41:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:29,218 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-10-01 23:41:29,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:41:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-10-01 23:41:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-01 23:41:29,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:29,219 INFO L411 BasicCegarLoop]: trace histogram [24, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:29,219 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:29,219 INFO L82 PathProgramCache]: Analyzing trace with hash 514073837, now seen corresponding path program 15 times [2019-10-01 23:41:29,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:29,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:29,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:29,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:29,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 6 proven. 300 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 23:41:29,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:29,520 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:41:29,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:41:29,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 23:41:29,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:29,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:41:29,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:30,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:41:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-01 23:41:30,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:30,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14] total 39 [2019-10-01 23:41:30,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:41:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:41:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1094, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:41:30,085 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 39 states. [2019-10-01 23:41:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:31,168 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2019-10-01 23:41:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:41:31,176 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2019-10-01 23:41:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:31,176 INFO L225 Difference]: With dead ends: 188 [2019-10-01 23:41:31,177 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 23:41:31,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1099, Invalid=3191, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 23:41:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 23:41:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2019-10-01 23:41:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 23:41:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 23:41:31,185 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 78 [2019-10-01 23:41:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:31,186 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 23:41:31,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:41:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 23:41:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-01 23:41:31,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:31,187 INFO L411 BasicCegarLoop]: trace histogram [25, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:31,187 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1408590365, now seen corresponding path program 5 times [2019-10-01 23:41:31,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:31,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:31,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 6 proven. 325 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 23:41:31,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:31,633 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:41:31,677 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:41:32,886 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-10-01 23:41:32,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:32,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:41:32,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:41:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-10-01 23:41:32,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:32,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7] total 33 [2019-10-01 23:41:32,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:41:32,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:41:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:41:32,980 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 33 states. [2019-10-01 23:41:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:33,675 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2019-10-01 23:41:33,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:41:33,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2019-10-01 23:41:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:33,676 INFO L225 Difference]: With dead ends: 145 [2019-10-01 23:41:33,676 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 23:41:33,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1254, Invalid=2652, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:41:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 23:41:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2019-10-01 23:41:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-01 23:41:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-10-01 23:41:33,683 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 79 [2019-10-01 23:41:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:33,683 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-10-01 23:41:33,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:41:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-10-01 23:41:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 23:41:33,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:33,684 INFO L411 BasicCegarLoop]: trace histogram [26, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:33,684 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash -465980754, now seen corresponding path program 16 times [2019-10-01 23:41:33,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:33,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:33,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:33,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 6 proven. 351 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-01 23:41:34,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:34,080 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:41:34,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:41:34,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:41:34,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:34,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:41:34,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-01 23:41:34,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:34,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:41:34,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:41:34,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:41:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:41:34,206 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 30 states. [2019-10-01 23:41:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:34,250 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2019-10-01 23:41:34,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:41:34,250 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 83 [2019-10-01 23:41:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:34,251 INFO L225 Difference]: With dead ends: 140 [2019-10-01 23:41:34,251 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 23:41:34,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:41:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 23:41:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-10-01 23:41:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 23:41:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2019-10-01 23:41:34,258 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 83 [2019-10-01 23:41:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:34,258 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2019-10-01 23:41:34,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:41:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2019-10-01 23:41:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 23:41:34,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:34,259 INFO L411 BasicCegarLoop]: trace histogram [27, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:34,259 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:34,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:34,260 INFO L82 PathProgramCache]: Analyzing trace with hash 555481402, now seen corresponding path program 17 times [2019-10-01 23:41:34,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:34,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:34,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:34,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:34,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 6 proven. 378 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-01 23:41:34,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:34,627 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:41:34,671 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:41:37,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-01 23:41:37,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:37,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:41:37,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-01 23:41:37,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:37,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:41:37,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:41:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:41:37,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:41:37,546 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 31 states. [2019-10-01 23:41:37,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:37,593 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-10-01 23:41:37,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:41:37,593 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2019-10-01 23:41:37,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:37,594 INFO L225 Difference]: With dead ends: 141 [2019-10-01 23:41:37,594 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 23:41:37,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 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:41:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 23:41:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-10-01 23:41:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 23:41:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2019-10-01 23:41:37,600 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 84 [2019-10-01 23:41:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:37,600 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2019-10-01 23:41:37,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:41:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2019-10-01 23:41:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 23:41:37,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:37,601 INFO L411 BasicCegarLoop]: trace histogram [28, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:37,602 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2138930130, now seen corresponding path program 18 times [2019-10-01 23:41:37,602 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:37,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:37,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:37,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 6 proven. 406 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-01 23:41:38,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:38,003 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:41:38,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:41:39,125 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 23:41:39,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:39,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:41:39,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:39,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:41:39,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:41:39,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:41:39,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:41:39,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-10-01 23:41:39,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-10-01 23:41:39,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:41:39,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:41:39,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:41:39,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-10-01 23:41:41,286 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_4| Int) (|v_main_~#src~0.offset_BEFORE_CALL_10| Int) (|v_main_~#src~0.base_BEFORE_CALL_10| Int) (|v_main_~#dst~0.base_BEFORE_CALL_4| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_10| |v_main_~#dst~0.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_4|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_4| 12)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_10|) (+ |v_main_~#src~0.offset_BEFORE_CALL_10| 12))))) is different from true [2019-10-01 23:41:43,350 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_5| Int) (|v_main_~#src~0.offset_BEFORE_CALL_11| Int) (|v_main_~#src~0.base_BEFORE_CALL_11| Int) (|v_main_~#dst~0.base_BEFORE_CALL_5| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_11| |v_main_~#dst~0.base_BEFORE_CALL_5|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_5|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_5| 12)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_11|) (+ |v_main_~#src~0.offset_BEFORE_CALL_11| 12))))) is different from true [2019-10-01 23:41:45,416 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.offset_BEFORE_CALL_12| Int) (|v_main_~#dst~0.base_BEFORE_CALL_6| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_6| Int) (|v_main_~#src~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_6|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_6| 12)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_12|) (+ |v_main_~#src~0.offset_BEFORE_CALL_12| 12))) (not (= |v_main_~#src~0.base_BEFORE_CALL_12| |v_main_~#dst~0.base_BEFORE_CALL_6|)))) is different from true [2019-10-01 23:41:47,453 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2019-10-01 23:41:49,496 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-01 23:41:49,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-10-01 23:41:49,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:41:49,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:41:49,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:41:49,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2019-10-01 23:41:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 406 trivial. 17 not checked. [2019-10-01 23:41:51,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:51,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19] total 48 [2019-10-01 23:41:51,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 23:41:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 23:41:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1481, Unknown=4, NotChecked=264, Total=2256 [2019-10-01 23:41:51,670 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 48 states. [2019-10-01 23:41:55,171 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2019-10-01 23:42:01,394 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-10-01 23:42:05,467 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-10-01 23:42:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:07,560 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2019-10-01 23:42:07,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:42:07,561 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 85 [2019-10-01 23:42:07,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:07,561 INFO L225 Difference]: With dead ends: 152 [2019-10-01 23:42:07,562 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 23:42:07,563 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=1463, Invalid=4706, Unknown=5, NotChecked=468, Total=6642 [2019-10-01 23:42:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 23:42:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-10-01 23:42:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 23:42:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2019-10-01 23:42:07,569 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 85 [2019-10-01 23:42:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:07,570 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2019-10-01 23:42:07,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 23:42:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2019-10-01 23:42:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 23:42:07,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:07,571 INFO L411 BasicCegarLoop]: trace histogram [29, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:07,571 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:07,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:07,572 INFO L82 PathProgramCache]: Analyzing trace with hash 573331488, now seen corresponding path program 19 times [2019-10-01 23:42:07,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:07,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:07,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:07,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:07,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 8 proven. 435 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 23:42:08,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:08,017 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:08,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:08,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:42:08,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-01 23:42:08,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:08,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:42:08,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:42:08,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:42:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:42:08,138 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 33 states. [2019-10-01 23:42:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:08,195 INFO L93 Difference]: Finished difference Result 161 states and 167 transitions. [2019-10-01 23:42:08,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:42:08,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 95 [2019-10-01 23:42:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:08,196 INFO L225 Difference]: With dead ends: 161 [2019-10-01 23:42:08,196 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 23:42:08,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:42:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 23:42:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-10-01 23:42:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 23:42:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2019-10-01 23:42:08,204 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 95 [2019-10-01 23:42:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:08,204 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2019-10-01 23:42:08,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:42:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2019-10-01 23:42:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 23:42:08,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:08,205 INFO L411 BasicCegarLoop]: trace histogram [30, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:08,206 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1602038956, now seen corresponding path program 20 times [2019-10-01 23:42:08,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:08,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 8 proven. 465 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 23:42:08,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:08,890 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:42:09,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:42:09,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:09,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:42:09,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-01 23:42:09,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:09,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 23:42:09,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:42:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:42:09,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:42:09,087 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 34 states. [2019-10-01 23:42:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:09,142 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2019-10-01 23:42:09,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:42:09,143 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 96 [2019-10-01 23:42:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:09,143 INFO L225 Difference]: With dead ends: 162 [2019-10-01 23:42:09,143 INFO L226 Difference]: Without dead ends: 100 [2019-10-01 23:42:09,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:42:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-01 23:42:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-01 23:42:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-01 23:42:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-10-01 23:42:09,154 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 96 [2019-10-01 23:42:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:09,154 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-10-01 23:42:09,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:42:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-10-01 23:42:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 23:42:09,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:09,155 INFO L411 BasicCegarLoop]: trace histogram [31, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:09,155 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:09,156 INFO L82 PathProgramCache]: Analyzing trace with hash -867767904, now seen corresponding path program 21 times [2019-10-01 23:42:09,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:09,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:09,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 8 proven. 496 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 23:42:09,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:09,639 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:09,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:42:09,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-01 23:42:09,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:09,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:42:09,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:10,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:42:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2019-10-01 23:42:10,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 16] total 48 [2019-10-01 23:42:10,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 23:42:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 23:42:10,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=1651, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:42:10,393 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 48 states. [2019-10-01 23:42:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:12,494 INFO L93 Difference]: Finished difference Result 233 states and 247 transitions. [2019-10-01 23:42:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 23:42:12,494 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 97 [2019-10-01 23:42:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:12,496 INFO L225 Difference]: With dead ends: 233 [2019-10-01 23:42:12,496 INFO L226 Difference]: Without dead ends: 131 [2019-10-01 23:42:12,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1736, Invalid=4906, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 23:42:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-01 23:42:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 104. [2019-10-01 23:42:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 23:42:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-10-01 23:42:12,508 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 97 [2019-10-01 23:42:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:12,508 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-10-01 23:42:12,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 23:42:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-10-01 23:42:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 23:42:12,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:12,509 INFO L411 BasicCegarLoop]: trace histogram [32, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:12,509 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1805903466, now seen corresponding path program 6 times [2019-10-01 23:42:12,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:12,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:12,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 8 proven. 528 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 23:42:13,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:13,003 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:13,055 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:42:14,009 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 23:42:14,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:14,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:42:14,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:42:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-01 23:42:14,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:14,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 8] total 41 [2019-10-01 23:42:14,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:42:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:42:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=1023, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:42:14,183 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 41 states. [2019-10-01 23:42:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:15,417 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2019-10-01 23:42:15,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 23:42:15,418 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 98 [2019-10-01 23:42:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:15,419 INFO L225 Difference]: With dead ends: 176 [2019-10-01 23:42:15,419 INFO L226 Difference]: Without dead ends: 111 [2019-10-01 23:42:15,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1977, Invalid=4185, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 23:42:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-01 23:42:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-10-01 23:42:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 23:42:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2019-10-01 23:42:15,428 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 98 [2019-10-01 23:42:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:15,428 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2019-10-01 23:42:15,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:42:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2019-10-01 23:42:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 23:42:15,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:15,429 INFO L411 BasicCegarLoop]: trace histogram [33, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:15,429 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash -381856391, now seen corresponding path program 22 times [2019-10-01 23:42:15,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:15,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:15,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:15,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:15,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 8 proven. 561 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 23:42:16,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:16,074 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:16,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:42:16,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:42:16,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:16,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:42:16,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 23:42:16,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:16,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 23:42:16,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:42:16,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:42:16,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:42:16,256 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 37 states. [2019-10-01 23:42:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:16,306 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions. [2019-10-01 23:42:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:42:16,306 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 102 [2019-10-01 23:42:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:16,307 INFO L225 Difference]: With dead ends: 171 [2019-10-01 23:42:16,308 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 23:42:16,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:42:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 23:42:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-01 23:42:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:42:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2019-10-01 23:42:16,315 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 102 [2019-10-01 23:42:16,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:16,315 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2019-10-01 23:42:16,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:42:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2019-10-01 23:42:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 23:42:16,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:16,316 INFO L411 BasicCegarLoop]: trace histogram [34, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:16,316 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1513786221, now seen corresponding path program 23 times [2019-10-01 23:42:16,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:16,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:16,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 8 proven. 595 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 23:42:16,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:16,856 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:16,912 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:42:28,539 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-01 23:42:28,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:28,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:42:28,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 23:42:28,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:28,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:42:28,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:42:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:42:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:42:28,586 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 38 states. [2019-10-01 23:42:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:28,670 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2019-10-01 23:42:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:42:28,670 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 103 [2019-10-01 23:42:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:28,671 INFO L225 Difference]: With dead ends: 172 [2019-10-01 23:42:28,671 INFO L226 Difference]: Without dead ends: 107 [2019-10-01 23:42:28,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:42:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-01 23:42:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-01 23:42:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 23:42:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-10-01 23:42:28,678 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 103 [2019-10-01 23:42:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:28,678 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-10-01 23:42:28,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:42:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-10-01 23:42:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-01 23:42:28,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:28,679 INFO L411 BasicCegarLoop]: trace histogram [35, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:28,679 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash 149165049, now seen corresponding path program 24 times [2019-10-01 23:42:28,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:28,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 8 proven. 630 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 23:42:29,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:29,312 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:29,372 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:42:31,186 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 23:42:31,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:31,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:42:31,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:31,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:42:31,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:42:31,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:42:31,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:42:31,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:42:31,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-10-01 23:42:31,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:42:31,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:42:31,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:42:31,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-10-01 23:42:33,470 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_7| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_7| Int) (|v_main_~#src~0.base_BEFORE_CALL_17| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_17| |v_main_~#dst~0.base_BEFORE_CALL_7|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_17|) 16) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_7|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_7| 16))))) is different from true [2019-10-01 23:42:35,550 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_18| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_8| Int) (|v_main_~#dst~0.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_8|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_8| 16)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_18|) 16)) (not (= |v_main_~#src~0.base_BEFORE_CALL_18| |v_main_~#dst~0.base_BEFORE_CALL_8|)))) is different from true [2019-10-01 23:42:37,642 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_9| Int) (|v_main_~#src~0.base_BEFORE_CALL_19| Int) (|v_main_~#dst~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_19| |v_main_~#dst~0.base_BEFORE_CALL_9|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_9|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_9| 16)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_19|) 16)))) is different from true [2019-10-01 23:42:39,725 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_10| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_10| Int) (|v_main_~#src~0.base_BEFORE_CALL_20| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_20| |v_main_~#dst~0.base_BEFORE_CALL_10|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_20|) 16) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_10|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_10| 16))))) is different from true [2019-10-01 23:42:39,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-10-01 23:42:39,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:42:39,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:42:39,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:42:39,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-10-01 23:42:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 630 trivial. 32 not checked. [2019-10-01 23:42:39,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:39,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 20] total 56 [2019-10-01 23:42:39,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 23:42:39,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 23:42:39,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=749, Invalid=1915, Unknown=4, NotChecked=412, Total=3080 [2019-10-01 23:42:39,927 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 56 states. [2019-10-01 23:42:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:42,340 INFO L93 Difference]: Finished difference Result 183 states and 190 transitions. [2019-10-01 23:42:42,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 23:42:42,341 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 104 [2019-10-01 23:42:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:42,342 INFO L225 Difference]: With dead ends: 183 [2019-10-01 23:42:42,342 INFO L226 Difference]: Without dead ends: 118 [2019-10-01 23:42:42,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2163, Invalid=5859, Unknown=4, NotChecked=716, Total=8742 [2019-10-01 23:42:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-01 23:42:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-10-01 23:42:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 23:42:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2019-10-01 23:42:42,351 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 104 [2019-10-01 23:42:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:42,351 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2019-10-01 23:42:42,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 23:42:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2019-10-01 23:42:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-01 23:42:42,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:42,352 INFO L411 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:42,353 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1150106701, now seen corresponding path program 25 times [2019-10-01 23:42:42,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:42,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:42,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:42,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 10 proven. 666 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 23:42:42,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:42,967 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:43,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:42:43,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-01 23:42:43,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:43,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-01 23:42:43,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 23:42:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 23:42:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 23:42:43,137 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 40 states. [2019-10-01 23:42:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:43,192 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-10-01 23:42:43,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 23:42:43,193 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2019-10-01 23:42:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:43,193 INFO L225 Difference]: With dead ends: 192 [2019-10-01 23:42:43,193 INFO L226 Difference]: Without dead ends: 118 [2019-10-01 23:42:43,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 23:42:43,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-01 23:42:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-01 23:42:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-01 23:42:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2019-10-01 23:42:43,201 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 114 [2019-10-01 23:42:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:43,202 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2019-10-01 23:42:43,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 23:42:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2019-10-01 23:42:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-01 23:42:43,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:43,203 INFO L411 BasicCegarLoop]: trace histogram [37, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:43,203 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1757076415, now seen corresponding path program 26 times [2019-10-01 23:42:43,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:43,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:43,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:43,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:43,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 10 proven. 703 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 23:42:43,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:43,810 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:43,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:42:43,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:42:43,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:43,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:42:43,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-01 23:42:43,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:43,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:42:43,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:42:43,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:42:43,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:42:43,978 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand 41 states. [2019-10-01 23:42:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:44,033 INFO L93 Difference]: Finished difference Result 193 states and 199 transitions. [2019-10-01 23:42:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:42:44,033 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 115 [2019-10-01 23:42:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:44,034 INFO L225 Difference]: With dead ends: 193 [2019-10-01 23:42:44,034 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 23:42:44,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:42:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 23:42:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-10-01 23:42:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 23:42:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2019-10-01 23:42:44,042 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 115 [2019-10-01 23:42:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:44,042 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2019-10-01 23:42:44,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:42:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2019-10-01 23:42:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-01 23:42:44,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:44,043 INFO L411 BasicCegarLoop]: trace histogram [38, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:44,043 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1685439795, now seen corresponding path program 27 times [2019-10-01 23:42:44,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:44,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:44,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 10 proven. 741 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 23:42:44,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:44,653 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:44,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:42:44,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:42:44,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:44,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:42:44,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:45,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:42:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 15 proven. 110 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-10-01 23:42:45,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:45,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 18] total 57 [2019-10-01 23:42:45,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 23:42:45,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 23:42:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2321, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:42:45,986 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 57 states. [2019-10-01 23:42:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:48,998 INFO L93 Difference]: Finished difference Result 278 states and 293 transitions. [2019-10-01 23:42:49,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 23:42:49,003 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 116 [2019-10-01 23:42:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:49,004 INFO L225 Difference]: With dead ends: 278 [2019-10-01 23:42:49,004 INFO L226 Difference]: Without dead ends: 155 [2019-10-01 23:42:49,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2520, Invalid=6986, Unknown=0, NotChecked=0, Total=9506 [2019-10-01 23:42:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-01 23:42:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2019-10-01 23:42:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 23:42:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-01 23:42:49,013 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 116 [2019-10-01 23:42:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:49,014 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-01 23:42:49,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 23:42:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-01 23:42:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:42:49,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:49,015 INFO L411 BasicCegarLoop]: trace histogram [39, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:49,015 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1922080835, now seen corresponding path program 7 times [2019-10-01 23:42:49,016 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:49,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:49,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:49,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:49,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 10 proven. 780 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 23:42:49,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:49,955 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:50,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:50,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 23:42:50,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-01 23:42:50,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:50,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 23:42:50,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 23:42:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 23:42:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:42:50,129 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 43 states. [2019-10-01 23:42:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:50,202 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2019-10-01 23:42:50,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 23:42:50,203 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 117 [2019-10-01 23:42:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:50,204 INFO L225 Difference]: With dead ends: 201 [2019-10-01 23:42:50,204 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 23:42:50,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:42:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 23:42:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-10-01 23:42:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-01 23:42:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2019-10-01 23:42:50,212 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 117 [2019-10-01 23:42:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:50,212 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2019-10-01 23:42:50,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 23:42:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2019-10-01 23:42:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 23:42:50,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:50,213 INFO L411 BasicCegarLoop]: trace histogram [40, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:50,213 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2045395919, now seen corresponding path program 8 times [2019-10-01 23:42:50,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:50,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:42:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 10 proven. 820 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 23:42:50,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:50,927 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:50,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:42:51,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:42:51,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:51,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:42:51,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-01 23:42:51,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:51,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 23:42:51,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:42:51,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:42:51,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:42:51,093 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 44 states. [2019-10-01 23:42:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:51,155 INFO L93 Difference]: Finished difference Result 202 states and 210 transitions. [2019-10-01 23:42:51,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:42:51,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 118 [2019-10-01 23:42:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:51,156 INFO L225 Difference]: With dead ends: 202 [2019-10-01 23:42:51,157 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 23:42:51,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:42:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 23:42:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-10-01 23:42:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 23:42:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 23:42:51,165 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 118 [2019-10-01 23:42:51,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:51,165 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 23:42:51,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:42:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 23:42:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-01 23:42:51,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:51,166 INFO L411 BasicCegarLoop]: trace histogram [41, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:51,166 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1573196227, now seen corresponding path program 9 times [2019-10-01 23:42:51,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:51,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:51,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:51,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:51,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 10 proven. 861 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 23:42:52,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:52,010 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:52,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:42:52,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:42:52,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:52,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:42:52,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:52,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:42:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-10-01 23:42:52,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:52,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 9] total 51 [2019-10-01 23:42:52,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 23:42:52,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 23:42:52,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 23:42:52,352 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 51 states. [2019-10-01 23:42:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:53,748 INFO L93 Difference]: Finished difference Result 209 states and 218 transitions. [2019-10-01 23:42:53,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 23:42:53,749 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 119 [2019-10-01 23:42:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:53,750 INFO L225 Difference]: With dead ends: 209 [2019-10-01 23:42:53,750 INFO L226 Difference]: Without dead ends: 132 [2019-10-01 23:42:53,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3129, Invalid=6573, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 23:42:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-01 23:42:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2019-10-01 23:42:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 23:42:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2019-10-01 23:42:53,760 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 119 [2019-10-01 23:42:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:53,760 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2019-10-01 23:42:53,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 23:42:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2019-10-01 23:42:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 23:42:53,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:53,761 INFO L411 BasicCegarLoop]: trace histogram [42, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:53,761 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1314796530, now seen corresponding path program 28 times [2019-10-01 23:42:53,762 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:53,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:53,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:53,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 10 proven. 903 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-10-01 23:42:54,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:54,503 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:54,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:42:54,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:42:54,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:54,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:42:54,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-01 23:42:54,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:54,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-10-01 23:42:54,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 23:42:54,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 23:42:54,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:42:54,730 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand 46 states. [2019-10-01 23:42:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:54,782 INFO L93 Difference]: Finished difference Result 204 states and 210 transitions. [2019-10-01 23:42:54,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 23:42:54,784 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 123 [2019-10-01 23:42:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:54,785 INFO L225 Difference]: With dead ends: 204 [2019-10-01 23:42:54,785 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 23:42:54,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:42:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 23:42:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-10-01 23:42:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 23:42:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2019-10-01 23:42:54,795 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 123 [2019-10-01 23:42:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:54,796 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2019-10-01 23:42:54,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 23:42:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2019-10-01 23:42:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 23:42:54,797 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:54,797 INFO L411 BasicCegarLoop]: trace histogram [43, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:54,797 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:54,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1747085670, now seen corresponding path program 29 times [2019-10-01 23:42:54,797 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:54,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:54,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:54,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:54,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 10 proven. 946 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-10-01 23:42:55,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:55,587 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:42:55,668 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:43:20,120 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 23:43:20,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:20,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 23:43:20,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-01 23:43:20,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:20,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 23:43:20,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 23:43:20,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 23:43:20,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:43:20,181 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand 47 states. [2019-10-01 23:43:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:20,238 INFO L93 Difference]: Finished difference Result 205 states and 211 transitions. [2019-10-01 23:43:20,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 23:43:20,238 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 124 [2019-10-01 23:43:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:20,239 INFO L225 Difference]: With dead ends: 205 [2019-10-01 23:43:20,239 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 23:43:20,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:43:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 23:43:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-10-01 23:43:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-01 23:43:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2019-10-01 23:43:20,247 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 124 [2019-10-01 23:43:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:20,247 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2019-10-01 23:43:20,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 23:43:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2019-10-01 23:43:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-01 23:43:20,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:20,248 INFO L411 BasicCegarLoop]: trace histogram [44, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:20,248 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:20,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2031820174, now seen corresponding path program 30 times [2019-10-01 23:43:20,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:20,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:20,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:20,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 10 proven. 990 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-10-01 23:43:21,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:21,334 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:43:21,424 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:43:28,832 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:43:28,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:28,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 23:43:28,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:28,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:43:28,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:43:28,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:43:28,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:43:28,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:43:29,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-10-01 23:43:29,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:43:29,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:43:29,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:43:29,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-10-01 23:43:31,144 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_11| Int) (|v_main_~#src~0.base_BEFORE_CALL_26| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_11|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_11| 20)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_26|) 20)) (not (= |v_main_~#src~0.base_BEFORE_CALL_26| |v_main_~#dst~0.base_BEFORE_CALL_11|)))) is different from true [2019-10-01 23:43:33,243 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_12| Int) (|v_main_~#src~0.base_BEFORE_CALL_27| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_27|) 20) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_12|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_12| 20))) (not (= |v_main_~#src~0.base_BEFORE_CALL_27| |v_main_~#dst~0.base_BEFORE_CALL_12|)))) is different from true [2019-10-01 23:43:35,333 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_28| Int) (|v_main_~#dst~0.base_BEFORE_CALL_13| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_13| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_28| |v_main_~#dst~0.base_BEFORE_CALL_13|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_28|) 20) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_13|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_13| 20))))) is different from true [2019-10-01 23:43:37,429 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_29| Int) (|v_main_~#dst~0.base_BEFORE_CALL_14| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_14| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_29|) 20) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_14|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_14| 20))) (not (= |v_main_~#src~0.base_BEFORE_CALL_29| |v_main_~#dst~0.base_BEFORE_CALL_14|)))) is different from true [2019-10-01 23:43:39,528 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_15| Int) (|v_main_~#dst~0.base_BEFORE_CALL_15| Int) (|v_main_~#src~0.base_BEFORE_CALL_30| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_30| |v_main_~#dst~0.base_BEFORE_CALL_15|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_15|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_15| 20)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_30|) 20)))) is different from true [2019-10-01 23:43:41,571 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 19 [2019-10-01 23:43:43,621 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-01 23:43:43,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-10-01 23:43:43,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:43:43,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:43:43,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:43:43,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-10-01 23:43:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 990 trivial. 49 not checked. [2019-10-01 23:43:45,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:45,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25] total 70 [2019-10-01 23:43:45,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 23:43:45,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 23:43:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1139, Invalid=3035, Unknown=6, NotChecked=650, Total=4830 [2019-10-01 23:43:45,891 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 70 states. [2019-10-01 23:43:50,250 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-01 23:43:56,461 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-10-01 23:44:00,531 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-10-01 23:44:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:02,594 INFO L93 Difference]: Finished difference Result 216 states and 223 transitions. [2019-10-01 23:44:02,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-01 23:44:02,595 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 125 [2019-10-01 23:44:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:02,596 INFO L225 Difference]: With dead ends: 216 [2019-10-01 23:44:02,596 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 23:44:02,598 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 118 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2586 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=3327, Invalid=9796, Unknown=7, NotChecked=1150, Total=14280 [2019-10-01 23:44:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 23:44:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-10-01 23:44:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-01 23:44:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2019-10-01 23:44:02,607 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 125 [2019-10-01 23:44:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:02,607 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2019-10-01 23:44:02,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 23:44:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2019-10-01 23:44:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-01 23:44:02,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:02,609 INFO L411 BasicCegarLoop]: trace histogram [45, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:02,609 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:02,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:02,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1559869760, now seen corresponding path program 31 times [2019-10-01 23:44:02,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:02,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:02,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 12 proven. 1035 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-01 23:44:03,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:03,631 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:44:03,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:03,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 23:44:03,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:44:03,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:03,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 23:44:03,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 23:44:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 23:44:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:44:03,820 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 49 states. [2019-10-01 23:44:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:03,920 INFO L93 Difference]: Finished difference Result 225 states and 231 transitions. [2019-10-01 23:44:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 23:44:03,920 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 135 [2019-10-01 23:44:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:03,921 INFO L225 Difference]: With dead ends: 225 [2019-10-01 23:44:03,921 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 23:44:03,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:44:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 23:44:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-10-01 23:44:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 23:44:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2019-10-01 23:44:03,935 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 135 [2019-10-01 23:44:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:03,936 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2019-10-01 23:44:03,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 23:44:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2019-10-01 23:44:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-01 23:44:03,938 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:03,938 INFO L411 BasicCegarLoop]: trace histogram [46, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:03,938 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:03,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:03,939 INFO L82 PathProgramCache]: Analyzing trace with hash -611672244, now seen corresponding path program 32 times [2019-10-01 23:44:03,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:03,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:03,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:03,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1315 backedges. 12 proven. 1081 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-01 23:44:05,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:05,114 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:44:05,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:44:05,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:44:05,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:05,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 23:44:05,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1315 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:44:05,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:05,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 23:44:05,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 23:44:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 23:44:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:44:05,314 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 50 states. [2019-10-01 23:44:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:05,407 INFO L93 Difference]: Finished difference Result 226 states and 232 transitions. [2019-10-01 23:44:05,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 23:44:05,407 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 136 [2019-10-01 23:44:05,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:05,408 INFO L225 Difference]: With dead ends: 226 [2019-10-01 23:44:05,408 INFO L226 Difference]: Without dead ends: 140 [2019-10-01 23:44:05,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:44:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-01 23:44:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-10-01 23:44:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-01 23:44:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2019-10-01 23:44:05,418 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 136 [2019-10-01 23:44:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:05,418 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2019-10-01 23:44:05,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 23:44:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2019-10-01 23:44:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-01 23:44:05,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:05,419 INFO L411 BasicCegarLoop]: trace histogram [47, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:05,419 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1282320320, now seen corresponding path program 33 times [2019-10-01 23:44:05,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:05,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:05,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 12 proven. 1128 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-01 23:44:06,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:06,371 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:44:06,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:44:06,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 23:44:06,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:06,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:44:06,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 18 proven. 156 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2019-10-01 23:44:08,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:08,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 20] total 68 [2019-10-01 23:44:08,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 23:44:08,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 23:44:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1287, Invalid=3269, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:44:08,056 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 68 states. [2019-10-01 23:44:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:27,726 INFO L93 Difference]: Finished difference Result 296 states and 306 transitions. [2019-10-01 23:44:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 23:44:27,729 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 137 [2019-10-01 23:44:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:27,730 INFO L225 Difference]: With dead ends: 296 [2019-10-01 23:44:27,730 INFO L226 Difference]: Without dead ends: 152 [2019-10-01 23:44:27,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 109 SyntacticMatches, 11 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3041 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3739, Invalid=9833, Unknown=0, NotChecked=0, Total=13572 [2019-10-01 23:44:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-01 23:44:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2019-10-01 23:44:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-01 23:44:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2019-10-01 23:44:27,740 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 137 [2019-10-01 23:44:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:27,740 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2019-10-01 23:44:27,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 23:44:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2019-10-01 23:44:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-01 23:44:27,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:27,741 INFO L411 BasicCegarLoop]: trace histogram [48, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:27,741 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash -651967094, now seen corresponding path program 10 times [2019-10-01 23:44:27,742 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:27,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:27,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:27,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 12 proven. 1176 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-01 23:44:28,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:28,934 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:44:29,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:44:29,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:44:29,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:29,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:44:29,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:29,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:44:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2019-10-01 23:44:29,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:29,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 10] total 59 [2019-10-01 23:44:29,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 23:44:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 23:44:29,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1312, Invalid=2110, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:44:29,330 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 59 states. [2019-10-01 23:44:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:30,983 INFO L93 Difference]: Finished difference Result 240 states and 249 transitions. [2019-10-01 23:44:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 23:44:30,983 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 138 [2019-10-01 23:44:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:30,984 INFO L225 Difference]: With dead ends: 240 [2019-10-01 23:44:30,984 INFO L226 Difference]: Without dead ends: 151 [2019-10-01 23:44:30,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1930 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4224, Invalid=8886, Unknown=0, NotChecked=0, Total=13110 [2019-10-01 23:44:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-01 23:44:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-10-01 23:44:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 23:44:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2019-10-01 23:44:31,007 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 138 [2019-10-01 23:44:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:31,008 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2019-10-01 23:44:31,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 23:44:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2019-10-01 23:44:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 23:44:31,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:31,010 INFO L411 BasicCegarLoop]: trace histogram [49, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:31,011 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1218015513, now seen corresponding path program 34 times [2019-10-01 23:44:31,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:31,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:31,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:31,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:31,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 12 proven. 1225 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-10-01 23:44:32,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:32,338 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:44:32,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:44:32,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:44:32,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:32,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 23:44:32,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:44:32,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:32,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 23:44:32,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 23:44:32,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 23:44:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:44:32,611 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand 53 states. [2019-10-01 23:44:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:32,680 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2019-10-01 23:44:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 23:44:32,680 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 142 [2019-10-01 23:44:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:32,681 INFO L225 Difference]: With dead ends: 235 [2019-10-01 23:44:32,681 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 23:44:32,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 23:44:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 23:44:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-10-01 23:44:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-01 23:44:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2019-10-01 23:44:32,689 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 142 [2019-10-01 23:44:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:32,690 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2019-10-01 23:44:32,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 23:44:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2019-10-01 23:44:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 23:44:32,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:32,691 INFO L411 BasicCegarLoop]: trace histogram [50, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:32,691 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:32,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1780917005, now seen corresponding path program 35 times [2019-10-01 23:44:32,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:32,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:32,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 12 proven. 1275 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-10-01 23:44:33,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:33,956 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:44:34,056 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:45:22,775 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-10-01 23:45:22,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:22,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 23:45:22,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-01 23:45:22,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:22,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 23:45:22,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 23:45:22,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 23:45:22,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:45:22,850 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 54 states. [2019-10-01 23:45:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:22,925 INFO L93 Difference]: Finished difference Result 236 states and 242 transitions. [2019-10-01 23:45:22,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 23:45:22,925 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 143 [2019-10-01 23:45:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:22,926 INFO L225 Difference]: With dead ends: 236 [2019-10-01 23:45:22,926 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 23:45:22,927 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:45:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 23:45:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-10-01 23:45:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 23:45:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2019-10-01 23:45:22,937 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 143 [2019-10-01 23:45:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:22,938 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2019-10-01 23:45:22,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 23:45:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2019-10-01 23:45:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 23:45:22,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:22,939 INFO L411 BasicCegarLoop]: trace histogram [51, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:22,939 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2050994073, now seen corresponding path program 36 times [2019-10-01 23:45:22,940 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:22,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:22,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:22,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:22,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 12 proven. 1326 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-10-01 23:45:24,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:24,117 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:45:24,224 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:45:38,714 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 23:45:38,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:38,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-01 23:45:38,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:38,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:45:38,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:45:38,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:45:38,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:45:38,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-01 23:45:38,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-10-01 23:45:38,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:45:38,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:45:38,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:45:38,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-10-01 23:45:41,087 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_37| Int) (|v_main_~#dst~0.base_BEFORE_CALL_16| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_37|) 24) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_16|) 24)) (not (= |v_main_~#src~0.base_BEFORE_CALL_37| |v_main_~#dst~0.base_BEFORE_CALL_16|)))) is different from true [2019-10-01 23:45:43,214 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_38| Int) (|v_main_~#dst~0.base_BEFORE_CALL_17| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_38| |v_main_~#dst~0.base_BEFORE_CALL_17|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_17|) 24) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_38|) 24)))) is different from true [2019-10-01 23:45:45,330 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_39| Int) (|v_main_~#dst~0.base_BEFORE_CALL_18| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_39| |v_main_~#dst~0.base_BEFORE_CALL_18|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_18|) 24) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_39|) 24)))) is different from true [2019-10-01 23:45:47,502 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_19| Int) (|v_main_~#src~0.base_BEFORE_CALL_40| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_40|) 24) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_19|) 24)) (not (= |v_main_~#src~0.base_BEFORE_CALL_40| |v_main_~#dst~0.base_BEFORE_CALL_19|)))) is different from true [2019-10-01 23:45:49,621 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_20| Int) (|v_main_~#src~0.base_BEFORE_CALL_41| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_41|) 24) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_20|) 24)) (not (= |v_main_~#src~0.base_BEFORE_CALL_41| |v_main_~#dst~0.base_BEFORE_CALL_20|)))) is different from true [2019-10-01 23:45:51,735 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_21| Int) (|v_main_~#src~0.base_BEFORE_CALL_42| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_21|) 24) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_42|) 24)) (not (= |v_main_~#src~0.base_BEFORE_CALL_42| |v_main_~#dst~0.base_BEFORE_CALL_21|)))) is different from true [2019-10-01 23:45:53,789 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-01 23:45:55,843 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-01 23:45:55,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:45:55,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:45:55,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:45:55,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:45:55,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:45:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1326 trivial. 71 not checked. [2019-10-01 23:45:58,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:58,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 28] total 80 [2019-10-01 23:45:58,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 23:45:58,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 23:45:58,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1497, Invalid=3922, Unknown=7, NotChecked=894, Total=6320 [2019-10-01 23:45:58,153 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand 80 states. [2019-10-01 23:46:03,822 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-01 23:46:10,122 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-10-01 23:46:14,207 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-10-01 23:46:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:16,314 INFO L93 Difference]: Finished difference Result 247 states and 254 transitions. [2019-10-01 23:46:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 23:46:16,314 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 144 [2019-10-01 23:46:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:16,315 INFO L225 Difference]: With dead ends: 247 [2019-10-01 23:46:16,315 INFO L226 Difference]: Without dead ends: 158 [2019-10-01 23:46:16,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 113 SyntacticMatches, 6 SemanticMatches, 135 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3386 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=4385, Invalid=12661, Unknown=8, NotChecked=1578, Total=18632 [2019-10-01 23:46:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-01 23:46:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-10-01 23:46:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 23:46:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2019-10-01 23:46:16,325 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 144 [2019-10-01 23:46:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:16,326 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2019-10-01 23:46:16,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 23:46:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2019-10-01 23:46:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-01 23:46:16,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:16,326 INFO L411 BasicCegarLoop]: trace histogram [52, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:16,327 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:16,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:16,327 INFO L82 PathProgramCache]: Analyzing trace with hash -573491027, now seen corresponding path program 37 times [2019-10-01 23:46:16,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:16,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1693 backedges. 14 proven. 1378 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-01 23:46:17,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:17,573 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:46:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:17,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 23:46:17,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1693 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-10-01 23:46:17,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:17,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 23:46:17,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 23:46:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 23:46:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 23:46:17,798 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 56 states. [2019-10-01 23:46:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:17,900 INFO L93 Difference]: Finished difference Result 256 states and 262 transitions. [2019-10-01 23:46:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 23:46:17,901 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 154 [2019-10-01 23:46:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:17,901 INFO L225 Difference]: With dead ends: 256 [2019-10-01 23:46:17,901 INFO L226 Difference]: Without dead ends: 158 [2019-10-01 23:46:17,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 23:46:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-01 23:46:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-10-01 23:46:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-01 23:46:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2019-10-01 23:46:17,912 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 154 [2019-10-01 23:46:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:17,912 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2019-10-01 23:46:17,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 23:46:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2019-10-01 23:46:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-01 23:46:17,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:17,913 INFO L411 BasicCegarLoop]: trace histogram [53, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:17,913 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:17,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:17,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2097093793, now seen corresponding path program 38 times [2019-10-01 23:46:17,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:17,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:17,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:17,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:46:17,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1746 backedges. 14 proven. 1431 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-01 23:46:19,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:19,184 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:19,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:46:19,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:46:19,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:19,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 23:46:19,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1746 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-10-01 23:46:19,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:19,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 23:46:19,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 23:46:19,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 23:46:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:46:19,432 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 57 states. [2019-10-01 23:46:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:19,536 INFO L93 Difference]: Finished difference Result 257 states and 263 transitions. [2019-10-01 23:46:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 23:46:19,536 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 155 [2019-10-01 23:46:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:19,537 INFO L225 Difference]: With dead ends: 257 [2019-10-01 23:46:19,537 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 23:46:19,538 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:46:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 23:46:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-10-01 23:46:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-01 23:46:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2019-10-01 23:46:19,548 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 155 [2019-10-01 23:46:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:19,548 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2019-10-01 23:46:19,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 23:46:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2019-10-01 23:46:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-01 23:46:19,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:19,549 INFO L411 BasicCegarLoop]: trace histogram [54, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:19,550 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1014122707, now seen corresponding path program 39 times [2019-10-01 23:46:19,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:19,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:19,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:19,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:19,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 14 proven. 1485 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-01 23:46:20,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:20,751 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:20,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:46:21,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-01 23:46:21,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:46:21,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:46:21,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:46:23,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:46:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 21 proven. 210 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2019-10-01 23:46:23,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:46:23,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 22] total 77 [2019-10-01 23:46:23,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 23:46:23,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 23:46:23,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1661, Invalid=4191, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:46:23,235 INFO L87 Difference]: Start difference. First operand 159 states and 162 transitions. Second operand 77 states. [2019-10-01 23:46:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:46:27,110 INFO L93 Difference]: Finished difference Result 370 states and 387 transitions. [2019-10-01 23:46:27,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-01 23:46:27,111 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 156 [2019-10-01 23:46:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:46:27,111 INFO L225 Difference]: With dead ends: 370 [2019-10-01 23:46:27,112 INFO L226 Difference]: Without dead ends: 205 [2019-10-01 23:46:27,113 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 124 SyntacticMatches, 13 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3975 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4862, Invalid=12960, Unknown=0, NotChecked=0, Total=17822 [2019-10-01 23:46:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-01 23:46:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2019-10-01 23:46:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 23:46:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 23:46:27,123 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 156 [2019-10-01 23:46:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:46:27,124 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 23:46:27,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 23:46:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 23:46:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 23:46:27,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:46:27,125 INFO L411 BasicCegarLoop]: trace histogram [55, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:46:27,125 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:46:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:46:27,126 INFO L82 PathProgramCache]: Analyzing trace with hash -588628957, now seen corresponding path program 11 times [2019-10-01 23:46:27,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:46:27,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:46:27,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:27,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:46:27,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:46:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:46:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 14 proven. 1540 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-01 23:46:28,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:46:28,332 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:46:28,449 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:47:50,524 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 23:47:50,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:50,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:47:50,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:50,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:47:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 7 proven. 77 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-10-01 23:47:50,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:50,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 11] total 67 [2019-10-01 23:47:50,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:47:50,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:47:50,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1699, Invalid=2723, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:47:50,867 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 67 states. [2019-10-01 23:47:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:53,082 INFO L93 Difference]: Finished difference Result 271 states and 280 transitions. [2019-10-01 23:47:53,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-01 23:47:53,082 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 157 [2019-10-01 23:47:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:53,084 INFO L225 Difference]: With dead ends: 271 [2019-10-01 23:47:53,084 INFO L226 Difference]: Without dead ends: 170 [2019-10-01 23:47:53,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5483, Invalid=11547, Unknown=0, NotChecked=0, Total=17030 [2019-10-01 23:47:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-01 23:47:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2019-10-01 23:47:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-01 23:47:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2019-10-01 23:47:53,095 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 157 [2019-10-01 23:47:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:53,096 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 167 transitions. [2019-10-01 23:47:53,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:47:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2019-10-01 23:47:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-01 23:47:53,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:53,097 INFO L411 BasicCegarLoop]: trace histogram [56, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:53,098 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:53,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:53,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1039647762, now seen corresponding path program 40 times [2019-10-01 23:47:53,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:53,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:53,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:53,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:53,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1935 backedges. 14 proven. 1596 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:47:54,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:54,417 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:54,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:47:54,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:47:54,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:54,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 23:47:54,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1935 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (57)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:47:54,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:54,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 23:47:54,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 23:47:54,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 23:47:54,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 23:47:54,835 INFO L87 Difference]: Start difference. First operand 164 states and 167 transitions. Second operand 60 states. [2019-10-01 23:47:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:54,944 INFO L93 Difference]: Finished difference Result 266 states and 272 transitions. [2019-10-01 23:47:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 23:47:54,944 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 161 [2019-10-01 23:47:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:54,945 INFO L225 Difference]: With dead ends: 266 [2019-10-01 23:47:54,945 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 23:47:54,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 23:47:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 23:47:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-10-01 23:47:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 23:47:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2019-10-01 23:47:54,955 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 161 [2019-10-01 23:47:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:54,956 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2019-10-01 23:47:54,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 23:47:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2019-10-01 23:47:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 23:47:54,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:54,957 INFO L411 BasicCegarLoop]: trace histogram [57, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:54,957 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash -744243846, now seen corresponding path program 41 times [2019-10-01 23:47:54,958 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:54,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:54,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1992 backedges. 14 proven. 1653 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:47:56,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:56,398 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:47:56,542 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:49:19,401 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 23:49:19,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:49:19,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 23:49:19,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:49:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1992 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-10-01 23:49:19,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:49:19,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 23:49:19,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 23:49:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 23:49:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 23:49:19,496 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 61 states. [2019-10-01 23:49:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:49:19,623 INFO L93 Difference]: Finished difference Result 267 states and 273 transitions. [2019-10-01 23:49:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 23:49:19,624 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 162 [2019-10-01 23:49:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:49:19,625 INFO L225 Difference]: With dead ends: 267 [2019-10-01 23:49:19,625 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 23:49:19,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 23:49:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 23:49:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-10-01 23:49:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 23:49:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 169 transitions. [2019-10-01 23:49:19,641 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 169 transitions. Word has length 162 [2019-10-01 23:49:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:49:19,641 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 169 transitions. [2019-10-01 23:49:19,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 23:49:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 169 transitions. [2019-10-01 23:49:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-01 23:49:19,644 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:49:19,645 INFO L411 BasicCegarLoop]: trace histogram [58, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:49:19,645 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:49:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:49:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash -176657042, now seen corresponding path program 42 times [2019-10-01 23:49:19,646 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:49:19,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:49:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:19,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:49:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:49:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:49:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 14 proven. 1711 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:49:21,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:49:21,290 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:49:21,416 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:50:03,998 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-01 23:50:03,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:50:04,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-01 23:50:04,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:04,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:50:04,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:50:04,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:50:04,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:50:04,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-01 23:50:04,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-10-01 23:50:04,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:50:04,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:50:04,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:50:04,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-10-01 23:50:06,455 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_22| Int) (|v_main_~#src~0.base_BEFORE_CALL_50| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_50|) 28) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_22|) 28)) (not (= |v_main_~#src~0.base_BEFORE_CALL_50| |v_main_~#dst~0.base_BEFORE_CALL_22|)))) is different from true [2019-10-01 23:50:08,573 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_23| Int) (|v_main_~#src~0.base_BEFORE_CALL_51| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_51| |v_main_~#dst~0.base_BEFORE_CALL_23|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_23|) 28) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_51|) 28)))) is different from true [2019-10-01 23:50:10,689 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_24| Int) (|v_main_~#src~0.base_BEFORE_CALL_52| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_52| |v_main_~#dst~0.base_BEFORE_CALL_24|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_24|) 28) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_52|) 28)))) is different from true [2019-10-01 23:50:12,814 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_25| Int) (|v_main_~#src~0.base_BEFORE_CALL_53| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_53| |v_main_~#dst~0.base_BEFORE_CALL_25|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_25|) 28) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_53|) 28)))) is different from true [2019-10-01 23:50:14,994 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_54| Int) (|v_main_~#dst~0.base_BEFORE_CALL_26| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_54| |v_main_~#dst~0.base_BEFORE_CALL_26|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_26|) 28) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_54|) 28)))) is different from true [2019-10-01 23:50:17,115 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_55| Int) (|v_main_~#dst~0.base_BEFORE_CALL_27| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_55|) 28) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_27|) 28)) (not (= |v_main_~#src~0.base_BEFORE_CALL_55| |v_main_~#dst~0.base_BEFORE_CALL_27|)))) is different from true [2019-10-01 23:50:19,238 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_28| Int) (|v_main_~#src~0.base_BEFORE_CALL_56| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_56|) 28) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_28|) 28)) (not (= |v_main_~#src~0.base_BEFORE_CALL_56| |v_main_~#dst~0.base_BEFORE_CALL_28|)))) is different from true [2019-10-01 23:50:21,298 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-01 23:50:23,368 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-01 23:50:23,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-10-01 23:50:23,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:50:23,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:50:23,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:50:23,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-01 23:50:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 1711 trivial. 97 not checked. [2019-10-01 23:50:25,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:25,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 31] total 90 [2019-10-01 23:50:25,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-01 23:50:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-01 23:50:25,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1904, Invalid=4922, Unknown=8, NotChecked=1176, Total=8010 [2019-10-01 23:50:25,741 INFO L87 Difference]: Start difference. First operand 166 states and 169 transitions. Second operand 90 states. [2019-10-01 23:50:33,492 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-01 23:50:39,907 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-10-01 23:50:44,018 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-10-01 23:50:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:46,192 INFO L93 Difference]: Finished difference Result 278 states and 285 transitions. [2019-10-01 23:50:46,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-01 23:50:46,192 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 163 [2019-10-01 23:50:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:46,193 INFO L225 Difference]: With dead ends: 278 [2019-10-01 23:50:46,194 INFO L226 Difference]: Without dead ends: 177 [2019-10-01 23:50:46,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 128 SyntacticMatches, 7 SemanticMatches, 152 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4293 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=5590, Invalid=15891, Unknown=9, NotChecked=2072, Total=23562 [2019-10-01 23:50:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-01 23:50:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-10-01 23:50:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-01 23:50:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 179 transitions. [2019-10-01 23:50:46,205 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 179 transitions. Word has length 163 [2019-10-01 23:50:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:46,205 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 179 transitions. [2019-10-01 23:50:46,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-01 23:50:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 179 transitions. [2019-10-01 23:50:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-01 23:50:46,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:46,207 INFO L411 BasicCegarLoop]: trace histogram [59, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:46,207 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2045557728, now seen corresponding path program 43 times [2019-10-01 23:50:46,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:46,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:46,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:50:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 16 proven. 1770 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 23:50:47,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:47,624 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:50:47,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:50:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:47,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-01 23:50:47,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-01 23:50:47,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:47,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-10-01 23:50:47,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-01 23:50:47,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-01 23:50:47,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:50:47,913 INFO L87 Difference]: Start difference. First operand 176 states and 179 transitions. Second operand 63 states. [2019-10-01 23:50:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:48,016 INFO L93 Difference]: Finished difference Result 287 states and 293 transitions. [2019-10-01 23:50:48,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 23:50:48,017 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 173 [2019-10-01 23:50:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:48,018 INFO L225 Difference]: With dead ends: 287 [2019-10-01 23:50:48,018 INFO L226 Difference]: Without dead ends: 177 [2019-10-01 23:50:48,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:50:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-01 23:50:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-10-01 23:50:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 23:50:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 180 transitions. [2019-10-01 23:50:48,033 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 180 transitions. Word has length 173 [2019-10-01 23:50:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:48,034 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 180 transitions. [2019-10-01 23:50:48,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-01 23:50:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 180 transitions. [2019-10-01 23:50:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 23:50:48,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:48,035 INFO L411 BasicCegarLoop]: trace histogram [60, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:48,035 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:48,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1895189356, now seen corresponding path program 44 times [2019-10-01 23:50:48,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:48,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:50:48,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 16 proven. 1830 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 23:50:49,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:49,450 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:50:49,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:50:49,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:50:49,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:50:49,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-01 23:50:49,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-01 23:50:49,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:49,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-10-01 23:50:49,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 23:50:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 23:50:49,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 23:50:49,746 INFO L87 Difference]: Start difference. First operand 177 states and 180 transitions. Second operand 64 states. [2019-10-01 23:50:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:49,841 INFO L93 Difference]: Finished difference Result 288 states and 294 transitions. [2019-10-01 23:50:49,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-01 23:50:49,842 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 174 [2019-10-01 23:50:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:49,842 INFO L225 Difference]: With dead ends: 288 [2019-10-01 23:50:49,843 INFO L226 Difference]: Without dead ends: 178 [2019-10-01 23:50:49,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 23:50:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-01 23:50:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-10-01 23:50:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-01 23:50:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 181 transitions. [2019-10-01 23:50:49,855 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 181 transitions. Word has length 174 [2019-10-01 23:50:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:49,855 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 181 transitions. [2019-10-01 23:50:49,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 23:50:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 181 transitions. [2019-10-01 23:50:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-01 23:50:49,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:49,857 INFO L411 BasicCegarLoop]: trace histogram [61, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:49,857 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:49,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1528737120, now seen corresponding path program 45 times [2019-10-01 23:50:49,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:49,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:49,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:50:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 16 proven. 1891 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 23:50:51,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:51,530 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:50:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:50:52,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:50:52,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:50:52,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 23:50:52,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:50:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 24 proven. 272 refuted. 0 times theorem prover too weak. 2003 trivial. 0 not checked. [2019-10-01 23:50:54,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:54,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 24] total 86 [2019-10-01 23:50:54,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 23:50:54,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 23:50:54,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2088, Invalid=5222, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 23:50:54,677 INFO L87 Difference]: Start difference. First operand 178 states and 181 transitions. Second operand 86 states. [2019-10-01 23:50:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:58,587 INFO L93 Difference]: Finished difference Result 415 states and 433 transitions. [2019-10-01 23:50:58,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-01 23:50:58,587 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-10-01 23:50:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:58,588 INFO L225 Difference]: With dead ends: 415 [2019-10-01 23:50:58,589 INFO L226 Difference]: Without dead ends: 229 [2019-10-01 23:50:58,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 139 SyntacticMatches, 15 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5026 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6129, Invalid=16221, Unknown=0, NotChecked=0, Total=22350 [2019-10-01 23:50:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-01 23:50:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 182. [2019-10-01 23:50:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-01 23:50:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2019-10-01 23:50:58,602 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 175 [2019-10-01 23:50:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:58,602 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2019-10-01 23:50:58,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 23:50:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2019-10-01 23:50:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 23:50:58,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:58,604 INFO L411 BasicCegarLoop]: trace histogram [62, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:58,604 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:58,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash 325410346, now seen corresponding path program 12 times [2019-10-01 23:50:58,605 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:58,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:58,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:50:58,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 16 proven. 1953 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 23:51:00,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:00,145 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:51:29,490 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-01 23:51:29,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:29,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:51:29,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:29,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:51:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 8 proven. 100 refuted. 0 times theorem prover too weak. 2253 trivial. 0 not checked. [2019-10-01 23:51:29,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:29,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 12] total 75 [2019-10-01 23:51:29,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-01 23:51:29,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-01 23:51:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2136, Invalid=3414, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 23:51:29,811 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 75 states. [2019-10-01 23:51:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:32,577 INFO L93 Difference]: Finished difference Result 302 states and 311 transitions. [2019-10-01 23:51:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 23:51:32,577 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 176 [2019-10-01 23:51:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:32,578 INFO L225 Difference]: With dead ends: 302 [2019-10-01 23:51:32,578 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 23:51:32,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3184 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6906, Invalid=14556, Unknown=0, NotChecked=0, Total=21462 [2019-10-01 23:51:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 23:51:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2019-10-01 23:51:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 23:51:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 186 transitions. [2019-10-01 23:51:32,590 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 186 transitions. Word has length 176 [2019-10-01 23:51:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:32,590 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 186 transitions. [2019-10-01 23:51:32,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-01 23:51:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 186 transitions. [2019-10-01 23:51:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 23:51:32,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:32,592 INFO L411 BasicCegarLoop]: trace histogram [63, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:32,592 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:32,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1867405767, now seen corresponding path program 46 times [2019-10-01 23:51:32,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:32,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:32,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:32,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:32,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 16 proven. 2016 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-10-01 23:51:34,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:34,156 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:34,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:51:34,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:51:34,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:34,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 23:51:34,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-01 23:51:34,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:34,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 23:51:34,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:51:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:51:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:51:34,631 INFO L87 Difference]: Start difference. First operand 183 states and 186 transitions. Second operand 67 states. [2019-10-01 23:51:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:34,775 INFO L93 Difference]: Finished difference Result 297 states and 303 transitions. [2019-10-01 23:51:34,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 23:51:34,775 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 180 [2019-10-01 23:51:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:34,776 INFO L225 Difference]: With dead ends: 297 [2019-10-01 23:51:34,777 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 23:51:34,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:51:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 23:51:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-10-01 23:51:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-01 23:51:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2019-10-01 23:51:34,788 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 180 [2019-10-01 23:51:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:34,788 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2019-10-01 23:51:34,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:51:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2019-10-01 23:51:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-01 23:51:34,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:34,789 INFO L411 BasicCegarLoop]: trace histogram [64, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:34,790 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:34,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash -457326291, now seen corresponding path program 47 times [2019-10-01 23:51:34,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:34,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:34,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:34,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:34,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2515 backedges. 16 proven. 2080 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-10-01 23:51:36,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:36,380 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:51:36,531 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:53:15,642 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-01 23:53:15,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:53:15,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 23:53:15,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:53:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2515 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-01 23:53:15,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:53:15,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 23:53:15,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 23:53:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 23:53:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:53:15,730 INFO L87 Difference]: Start difference. First operand 184 states and 187 transitions. Second operand 68 states. [2019-10-01 23:53:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:53:15,833 INFO L93 Difference]: Finished difference Result 298 states and 304 transitions. [2019-10-01 23:53:15,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 23:53:15,834 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 181 [2019-10-01 23:53:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:53:15,835 INFO L225 Difference]: With dead ends: 298 [2019-10-01 23:53:15,835 INFO L226 Difference]: Without dead ends: 185 [2019-10-01 23:53:15,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:53:15,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-01 23:53:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-10-01 23:53:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 23:53:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 188 transitions. [2019-10-01 23:53:15,844 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 188 transitions. Word has length 181 [2019-10-01 23:53:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:53:15,844 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 188 transitions. [2019-10-01 23:53:15,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 23:53:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 188 transitions. [2019-10-01 23:53:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-01 23:53:15,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:53:15,845 INFO L411 BasicCegarLoop]: trace histogram [65, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:53:15,846 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:53:15,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:53:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash 305464505, now seen corresponding path program 48 times [2019-10-01 23:53:15,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:53:15,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:53:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:53:15,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:53:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:53:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:53:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 16 proven. 2145 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-10-01 23:53:17,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:53:17,539 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:53:17,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:53:57,201 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:53:57,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:53:57,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 23:53:57,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:53:57,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:53:57,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:53:57,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:53:57,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:53:57,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-10-01 23:53:57,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-10-01 23:53:57,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:53:57,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:53:57,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:53:57,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-10-01 23:53:59,695 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_29| Int) (|v_main_~#src~0.offset_BEFORE_CALL_65| Int) (|v_main_~#src~0.base_BEFORE_CALL_65| Int) (|v_main_~#dst~0.base_BEFORE_CALL_29| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_65| |v_main_~#dst~0.base_BEFORE_CALL_29|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_65|) (+ |v_main_~#src~0.offset_BEFORE_CALL_65| 32)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_29|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_29| 32))))) is different from true [2019-10-01 23:54:01,825 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.offset_BEFORE_CALL_66| Int) (|v_main_~#dst~0.base_BEFORE_CALL_30| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_30| Int) (|v_main_~#src~0.base_BEFORE_CALL_66| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_30|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_30| 32)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_66|) (+ |v_main_~#src~0.offset_BEFORE_CALL_66| 32))) (not (= |v_main_~#src~0.base_BEFORE_CALL_66| |v_main_~#dst~0.base_BEFORE_CALL_30|)))) is different from true [2019-10-01 23:54:03,948 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_31| Int) (|v_main_~#src~0.offset_BEFORE_CALL_67| Int) (|v_main_~#src~0.base_BEFORE_CALL_67| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_31| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_31|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_31| 32)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_67|) (+ |v_main_~#src~0.offset_BEFORE_CALL_67| 32))) (not (= |v_main_~#src~0.base_BEFORE_CALL_67| |v_main_~#dst~0.base_BEFORE_CALL_31|)))) is different from true [2019-10-01 23:54:06,071 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#dst~0.base_BEFORE_CALL_32| Int) (|v_main_~#src~0.offset_BEFORE_CALL_68| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_32| Int) (|v_main_~#src~0.base_BEFORE_CALL_68| Int)) (and (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_32|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_32| 32)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_68|) (+ |v_main_~#src~0.offset_BEFORE_CALL_68| 32))) (not (= |v_main_~#src~0.base_BEFORE_CALL_68| |v_main_~#dst~0.base_BEFORE_CALL_32|)))) is different from true [2019-10-01 23:54:08,198 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.offset_BEFORE_CALL_69| Int) (|v_main_~#dst~0.base_BEFORE_CALL_33| Int) (|v_main_~#src~0.base_BEFORE_CALL_69| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_33| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_69|) (+ |v_main_~#src~0.offset_BEFORE_CALL_69| 32)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_33|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_33| 32))) (not (= |v_main_~#src~0.base_BEFORE_CALL_69| |v_main_~#dst~0.base_BEFORE_CALL_33|)))) is different from true [2019-10-01 23:54:10,347 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_70| Int) (|v_main_~#dst~0.base_BEFORE_CALL_34| Int) (|v_main_~#src~0.offset_BEFORE_CALL_70| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_34| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_70| |v_main_~#dst~0.base_BEFORE_CALL_34|)) (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_70|) (+ |v_main_~#src~0.offset_BEFORE_CALL_70| 32)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_34|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_34| 32))))) is different from true [2019-10-01 23:54:12,476 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.base_BEFORE_CALL_71| Int) (|v_main_~#src~0.offset_BEFORE_CALL_71| Int) (|v_main_~#dst~0.base_BEFORE_CALL_35| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_35| Int)) (and (not (= |v_main_~#src~0.base_BEFORE_CALL_71| |v_main_~#dst~0.base_BEFORE_CALL_35|)) (= (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_35|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_35| 32)) (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_71|) (+ |v_main_~#src~0.offset_BEFORE_CALL_71| 32))))) is different from true [2019-10-01 23:54:14,609 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#src~0.offset_BEFORE_CALL_72| Int) (|v_main_~#src~0.base_BEFORE_CALL_72| Int) (|v_main_~#dst~0.base_BEFORE_CALL_36| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_36| Int)) (and (= (select (select |c_#memory_int| |v_main_~#src~0.base_BEFORE_CALL_72|) (+ |v_main_~#src~0.offset_BEFORE_CALL_72| 32)) (select (select |c_#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_36|) (+ |v_main_~#dst~0.offset_BEFORE_CALL_36| 32))) (not (= |v_main_~#src~0.base_BEFORE_CALL_72| |v_main_~#dst~0.base_BEFORE_CALL_36|)))) is different from true [2019-10-01 23:54:16,675 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2019-10-01 23:54:18,745 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-01 23:54:18,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-10-01 23:54:18,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:54:18,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:54:18,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:54:18,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2019-10-01 23:54:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 2145 trivial. 127 not checked. [2019-10-01 23:54:21,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:21,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 34] total 100 [2019-10-01 23:54:21,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-10-01 23:54:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-10-01 23:54:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2360, Invalid=6035, Unknown=9, NotChecked=1496, Total=9900 [2019-10-01 23:54:21,157 INFO L87 Difference]: Start difference. First operand 185 states and 188 transitions. Second operand 100 states. [2019-10-01 23:54:28,298 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2019-10-01 23:54:34,628 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 24 DAG size of output: 21