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-tiling/nr4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:49:46,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:49:46,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:49:46,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:49:46,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:49:46,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:49:46,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:49:46,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:49:46,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:49:46,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:49:46,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:49:46,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:49:46,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:49:46,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:49:46,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:49:46,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:49:46,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:49:46,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:49:46,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:49:46,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:49:46,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:49:46,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:49:46,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:49:46,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:49:46,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:49:46,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:49:46,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:49:46,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:49:46,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:49:46,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:49:46,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:49:46,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:49:46,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:49:46,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:49:46,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:49:46,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:49:46,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:49:46,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:49:46,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:49:46,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:49:46,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:49:46,251 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-14 21:49:46,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:49:46,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:49:46,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:49:46,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:49:46,277 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:49:46,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:49:46,278 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:49:46,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:49:46,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:49:46,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:49:46,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:49:46,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:49:46,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:49:46,280 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:49:46,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:49:46,281 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:49:46,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:49:46,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:49:46,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:49:46,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:49:46,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:49:46,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:49:46,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:49:46,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:49:46,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:49:46,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:49:46,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:49:46,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:49:46,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:49:46,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:49:46,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:49:46,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:49:46,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:49:46,619 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:49:46,620 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr4.c [2019-10-14 21:49:46,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b374a7023/45e24051311246d8a4a28e0809d2649e/FLAG2dfd5291c [2019-10-14 21:49:47,180 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:49:47,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr4.c [2019-10-14 21:49:47,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b374a7023/45e24051311246d8a4a28e0809d2649e/FLAG2dfd5291c [2019-10-14 21:49:47,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b374a7023/45e24051311246d8a4a28e0809d2649e [2019-10-14 21:49:47,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:49:47,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:49:47,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:49:47,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:49:47,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:49:47,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23af7094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47, skipping insertion in model container [2019-10-14 21:49:47,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,555 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:49:47,574 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:49:47,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:49:47,754 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:49:47,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:49:47,804 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:49:47,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47 WrapperNode [2019-10-14 21:49:47,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:49:47,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:49:47,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:49:47,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:49:47,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... [2019-10-14 21:49:47,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:49:47,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:49:47,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:49:47,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:49:47,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:49:47,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:49:47,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:49:47,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:49:47,978 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:49:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:49:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:49:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:49:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:49:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:49:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:49:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:49:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:49:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:49:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:49:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:49:48,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:49:48,221 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 21:49:48,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:49:48 BoogieIcfgContainer [2019-10-14 21:49:48,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:49:48,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:49:48,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:49:48,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:49:48,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:49:47" (1/3) ... [2019-10-14 21:49:48,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c877f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:49:48, skipping insertion in model container [2019-10-14 21:49:48,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:47" (2/3) ... [2019-10-14 21:49:48,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c877f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:49:48, skipping insertion in model container [2019-10-14 21:49:48,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:49:48" (3/3) ... [2019-10-14 21:49:48,229 INFO L109 eAbstractionObserver]: Analyzing ICFG nr4.c [2019-10-14 21:49:48,236 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:49:48,243 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:49:48,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:49:48,278 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:49:48,279 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:49:48,279 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:49:48,279 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:49:48,279 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:49:48,279 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:49:48,279 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:49:48,279 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:49:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 21:49:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:49:48,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:48,304 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:48,306 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:48,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-10-14 21:49:48,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:48,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340724269] [2019-10-14 21:49:48,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:48,600 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-14 21:49:48,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340724269] [2019-10-14 21:49:48,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:48,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:49:48,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817629310] [2019-10-14 21:49:48,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:49:48,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:49:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:48,641 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2019-10-14 21:49:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:48,876 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-14 21:49:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:49:48,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 21:49:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:48,891 INFO L225 Difference]: With dead ends: 60 [2019-10-14 21:49:48,891 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:49:48,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:49:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:49:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 21:49:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:49:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 21:49:48,956 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-10-14 21:49:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:48,957 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 21:49:48,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:49:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 21:49:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:49:48,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:48,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:48,960 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:48,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-10-14 21:49:48,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:48,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573633326] [2019-10-14 21:49:48,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:48,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,158 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-14 21:49:49,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573633326] [2019-10-14 21:49:49,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:49,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:49:49,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677077956] [2019-10-14 21:49:49,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:49,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:49,162 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-10-14 21:49:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:49,296 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-14 21:49:49,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:49,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 21:49:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:49,300 INFO L225 Difference]: With dead ends: 52 [2019-10-14 21:49:49,300 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 21:49:49,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 21:49:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-14 21:49:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 21:49:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-14 21:49:49,310 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-10-14 21:49:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:49,311 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-14 21:49:49,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-14 21:49:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 21:49:49,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:49,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:49,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-10-14 21:49:49,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:49,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067075867] [2019-10-14 21:49:49,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067075867] [2019-10-14 21:49:49,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:49,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:49:49,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739247296] [2019-10-14 21:49:49,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:49:49,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:49:49,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:49:49,386 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-10-14 21:49:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:49,475 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-14 21:49:49,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:49:49,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-14 21:49:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:49,477 INFO L225 Difference]: With dead ends: 56 [2019-10-14 21:49:49,478 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 21:49:49,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:49:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 21:49:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-14 21:49:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 21:49:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-14 21:49:49,486 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-14 21:49:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:49,486 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-14 21:49:49,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:49:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-14 21:49:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:49:49,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:49,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:49,488 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:49,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-10-14 21:49:49,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:49,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392956982] [2019-10-14 21:49:49,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392956982] [2019-10-14 21:49:49,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:49,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:49:49,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567947602] [2019-10-14 21:49:49,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:49,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:49,552 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-10-14 21:49:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:49,635 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-14 21:49:49,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:49:49,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:49:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:49,636 INFO L225 Difference]: With dead ends: 57 [2019-10-14 21:49:49,636 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 21:49:49,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 21:49:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 21:49:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 21:49:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 21:49:49,644 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-14 21:49:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:49,645 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 21:49:49,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 21:49:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:49:49,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:49,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:49,646 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:49,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-10-14 21:49:49,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:49,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609884970] [2019-10-14 21:49:49,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:49,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609884970] [2019-10-14 21:49:49,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799930308] [2019-10-14 21:49:49,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:49,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 21:49:49,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,797 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:49,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-14 21:49:49,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749418094] [2019-10-14 21:49:49,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:49,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:49,799 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-10-14 21:49:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:49,883 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-10-14 21:49:49,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:49:49,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:49:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:49,885 INFO L225 Difference]: With dead ends: 61 [2019-10-14 21:49:49,885 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:49:49,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:49:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-14 21:49:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 21:49:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-14 21:49:49,893 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-10-14 21:49:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:49,893 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-14 21:49:49,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-14 21:49:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:49:49,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:49,895 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:50,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:50,102 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2019-10-14 21:49:50,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:50,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264509756] [2019-10-14 21:49:50,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:50,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:50,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:50,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264509756] [2019-10-14 21:49:50,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326096219] [2019-10-14 21:49:50,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:50,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:50,252 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:50,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-14 21:49:50,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324862901] [2019-10-14 21:49:50,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 21:49:50,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:50,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 21:49:50,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:49:50,254 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2019-10-14 21:49:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:50,371 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-10-14 21:49:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:50,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-10-14 21:49:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:50,373 INFO L225 Difference]: With dead ends: 63 [2019-10-14 21:49:50,373 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:49:50,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:49:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:49:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-14 21:49:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-14 21:49:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-14 21:49:50,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 25 [2019-10-14 21:49:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:50,380 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-14 21:49:50,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 21:49:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-14 21:49:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:49:50,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:50,381 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:50,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:50,586 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:50,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:50,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1706774660, now seen corresponding path program 2 times [2019-10-14 21:49:50,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:50,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270353201] [2019-10-14 21:49:50,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:50,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:50,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:50,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270353201] [2019-10-14 21:49:50,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87227776] [2019-10-14 21:49:50,658 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:50,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:49:50,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:50,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:50,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:50,708 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:50,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-10-14 21:49:50,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893474028] [2019-10-14 21:49:50,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:49:50,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:50,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:49:50,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:50,710 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-10-14 21:49:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:50,816 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-10-14 21:49:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:50,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-14 21:49:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:50,817 INFO L225 Difference]: With dead ends: 67 [2019-10-14 21:49:50,817 INFO L226 Difference]: Without dead ends: 40 [2019-10-14 21:49:50,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-14 21:49:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-10-14 21:49:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 21:49:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-14 21:49:50,830 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2019-10-14 21:49:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:50,831 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-14 21:49:50,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:49:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-14 21:49:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:49:50,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:50,834 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:51,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:51,046 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:51,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1405489790, now seen corresponding path program 2 times [2019-10-14 21:49:51,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:51,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981438191] [2019-10-14 21:49:51,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:51,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981438191] [2019-10-14 21:49:51,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925697972] [2019-10-14 21:49:51,153 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:51,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:49:51,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:51,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 21:49:51,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:51,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:51,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-10-14 21:49:51,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788131451] [2019-10-14 21:49:51,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 21:49:51,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 21:49:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:49:51,276 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 10 states. [2019-10-14 21:49:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:51,384 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-10-14 21:49:51,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 21:49:51,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-10-14 21:49:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:51,385 INFO L225 Difference]: With dead ends: 70 [2019-10-14 21:49:51,385 INFO L226 Difference]: Without dead ends: 41 [2019-10-14 21:49:51,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:49:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-14 21:49:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-14 21:49:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 21:49:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-14 21:49:51,392 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-10-14 21:49:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:51,393 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-14 21:49:51,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 21:49:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-14 21:49:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:49:51,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:51,394 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:51,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:51,597 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:51,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:51,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1147324352, now seen corresponding path program 3 times [2019-10-14 21:49:51,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:51,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207420384] [2019-10-14 21:49:51,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:51,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:51,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207420384] [2019-10-14 21:49:51,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892595436] [2019-10-14 21:49:51,675 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:51,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 21:49:51,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:51,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:49:51,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 21:49:51,748 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:51,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-10-14 21:49:51,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124938866] [2019-10-14 21:49:51,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 21:49:51,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:51,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 21:49:51,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:49:51,750 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 8 states. [2019-10-14 21:49:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:51,874 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-10-14 21:49:51,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 21:49:51,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-10-14 21:49:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:51,875 INFO L225 Difference]: With dead ends: 71 [2019-10-14 21:49:51,875 INFO L226 Difference]: Without dead ends: 41 [2019-10-14 21:49:51,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-14 21:49:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-14 21:49:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-14 21:49:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 21:49:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-14 21:49:51,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2019-10-14 21:49:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:51,882 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-14 21:49:51,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 21:49:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-14 21:49:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 21:49:51,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:51,883 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:52,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:52,087 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 401597370, now seen corresponding path program 3 times [2019-10-14 21:49:52,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:52,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544624556] [2019-10-14 21:49:52,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:52,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544624556] [2019-10-14 21:49:52,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280159918] [2019-10-14 21:49:52,612 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:52,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-14 21:49:52,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:52,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-14 21:49:52,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:52,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-10-14 21:49:52,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:52,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:52,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:52,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-14 21:49:52,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:52,843 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 31 treesize of output 30 [2019-10-14 21:49:52,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:52,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:52,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:52,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-10-14 21:49:52,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:52,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:52,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 143 [2019-10-14 21:49:52,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:52,986 INFO L567 ElimStorePlain]: treesize reduction 96, result has 35.6 percent of original size [2019-10-14 21:49:52,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:52,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2019-10-14 21:49:53,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:53,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:53,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 192 [2019-10-14 21:49:53,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,247 INFO L567 ElimStorePlain]: treesize reduction 102, result has 48.2 percent of original size [2019-10-14 21:49:53,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:53,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:64 [2019-10-14 21:49:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,498 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-10-14 21:49:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:49:53,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:53,671 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:53,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2019-10-14 21:49:53,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460274077] [2019-10-14 21:49:53,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-14 21:49:53,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-14 21:49:53,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-10-14 21:49:53,673 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 25 states. [2019-10-14 21:49:54,560 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-14 21:49:58,842 WARN L191 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-14 21:49:59,253 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-10-14 21:50:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:00,205 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2019-10-14 21:50:00,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 21:50:00,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-10-14 21:50:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:00,209 INFO L225 Difference]: With dead ends: 111 [2019-10-14 21:50:00,209 INFO L226 Difference]: Without dead ends: 95 [2019-10-14 21:50:00,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2019-10-14 21:50:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-14 21:50:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 43. [2019-10-14 21:50:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 21:50:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-14 21:50:00,228 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 31 [2019-10-14 21:50:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:00,229 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-14 21:50:00,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-14 21:50:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-14 21:50:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 21:50:00,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:00,230 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:00,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:00,440 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash 890139769, now seen corresponding path program 1 times [2019-10-14 21:50:00,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:00,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894136326] [2019-10-14 21:50:00,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:00,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:00,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:00,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894136326] [2019-10-14 21:50:00,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37178854] [2019-10-14 21:50:00,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:01,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 21:50:01,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:01,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-10-14 21:50:01,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:01,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:01,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:01,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-14 21:50:01,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:01,231 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 33 treesize of output 32 [2019-10-14 21:50:01,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:01,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:01,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:01,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2019-10-14 21:50:01,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:01,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:01,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 125 [2019-10-14 21:50:01,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:01,415 INFO L567 ElimStorePlain]: treesize reduction 54, result has 60.9 percent of original size [2019-10-14 21:50:01,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:01,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:84 [2019-10-14 21:50:01,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:01,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:02,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:50:02,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:02,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:02,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:03,209 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2019-10-14 21:50:03,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:03,302 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:03,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 30 [2019-10-14 21:50:03,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136800072] [2019-10-14 21:50:03,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-14 21:50:03,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:03,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-14 21:50:03,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-10-14 21:50:03,304 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 30 states. [2019-10-14 21:50:04,173 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-10-14 21:50:04,450 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-14 21:50:04,959 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-10-14 21:50:05,259 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-10-14 21:50:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:06,355 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2019-10-14 21:50:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-14 21:50:06,356 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2019-10-14 21:50:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:06,357 INFO L225 Difference]: With dead ends: 128 [2019-10-14 21:50:06,357 INFO L226 Difference]: Without dead ends: 112 [2019-10-14 21:50:06,359 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=445, Invalid=2525, Unknown=0, NotChecked=0, Total=2970 [2019-10-14 21:50:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-14 21:50:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 48. [2019-10-14 21:50:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 21:50:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-14 21:50:06,380 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 40 [2019-10-14 21:50:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:06,381 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-14 21:50:06,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-14 21:50:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-14 21:50:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 21:50:06,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:06,388 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:06,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:06,598 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:06,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:06,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1944237414, now seen corresponding path program 2 times [2019-10-14 21:50:06,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:06,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353513027] [2019-10-14 21:50:06,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:06,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:06,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:06,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353513027] [2019-10-14 21:50:06,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145788934] [2019-10-14 21:50:06,876 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:06,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:06,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:06,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 21:50:06,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:07,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:07,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:07,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:07,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:07,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:50:07,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:07,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 57 [2019-10-14 21:50:07,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:07,163 INFO L567 ElimStorePlain]: treesize reduction 21, result has 65.0 percent of original size [2019-10-14 21:50:07,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:07,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:39 [2019-10-14 21:50:07,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:07,833 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:07,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2019-10-14 21:50:07,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558748913] [2019-10-14 21:50:07,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-14 21:50:07,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:07,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-14 21:50:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-10-14 21:50:07,835 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 30 states. [2019-10-14 21:50:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:09,947 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2019-10-14 21:50:09,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-14 21:50:09,948 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 49 [2019-10-14 21:50:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:09,949 INFO L225 Difference]: With dead ends: 129 [2019-10-14 21:50:09,949 INFO L226 Difference]: Without dead ends: 113 [2019-10-14 21:50:09,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=395, Invalid=2685, Unknown=0, NotChecked=0, Total=3080 [2019-10-14 21:50:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-14 21:50:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2019-10-14 21:50:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-14 21:50:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-10-14 21:50:09,977 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 49 [2019-10-14 21:50:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:09,978 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-10-14 21:50:09,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-14 21:50:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-10-14 21:50:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 21:50:09,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:09,981 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:10,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:10,186 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:10,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:10,187 INFO L82 PathProgramCache]: Analyzing trace with hash 651610521, now seen corresponding path program 3 times [2019-10-14 21:50:10,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:10,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780634490] [2019-10-14 21:50:10,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:10,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:10,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:10,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780634490] [2019-10-14 21:50:10,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751914249] [2019-10-14 21:50:10,443 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:10,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 21:50:10,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:10,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-14 21:50:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:10,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-10-14 21:50:10,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:10,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:10,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:10,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-14 21:50:11,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:50:11,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:11,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:13,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 32 proven. 13 refuted. 4 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-14 21:50:13,543 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:13,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-10-14 21:50:13,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137169366] [2019-10-14 21:50:13,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-14 21:50:13,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-14 21:50:13,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1112, Unknown=2, NotChecked=0, Total=1260 [2019-10-14 21:50:13,547 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 36 states. [2019-10-14 21:50:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:15,499 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2019-10-14 21:50:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-14 21:50:15,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 58 [2019-10-14 21:50:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:15,500 INFO L225 Difference]: With dead ends: 101 [2019-10-14 21:50:15,501 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 21:50:15,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=460, Invalid=3320, Unknown=2, NotChecked=0, Total=3782 [2019-10-14 21:50:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 21:50:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-10-14 21:50:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 21:50:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-10-14 21:50:15,513 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 58 [2019-10-14 21:50:15,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:15,513 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-10-14 21:50:15,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-14 21:50:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-10-14 21:50:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-14 21:50:15,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:15,515 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:15,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:15,718 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash -27586745, now seen corresponding path program 4 times [2019-10-14 21:50:15,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:15,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863252926] [2019-10-14 21:50:15,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:15,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:15,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 7 proven. 113 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:16,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863252926] [2019-10-14 21:50:16,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615108230] [2019-10-14 21:50:16,289 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:16,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:50:16,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:16,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 21:50:16,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:16,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-10-14 21:50:16,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:16,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:16,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:16,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-14 21:50:16,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:16,586 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 31 treesize of output 30 [2019-10-14 21:50:16,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:16,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:16,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:16,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-10-14 21:50:16,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:16,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:16,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:16,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 87 [2019-10-14 21:50:16,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:16,846 INFO L567 ElimStorePlain]: treesize reduction 29, result has 69.8 percent of original size [2019-10-14 21:50:16,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:16,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:16,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:67 [2019-10-14 21:50:16,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:18,917 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-14 21:50:18,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms