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/loops/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:16:16,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:16:16,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:16:16,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:16:16,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:16:16,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:16:16,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:16:16,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:16:16,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:16:16,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:16:16,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:16:16,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:16:16,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:16:16,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:16:16,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:16:16,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:16:16,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:16:16,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:16:16,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:16:16,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:16:16,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:16:16,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:16:16,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:16:16,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:16:16,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:16:16,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:16:16,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:16:16,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:16:16,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:16:16,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:16:16,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:16:16,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:16:16,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:16:16,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:16:16,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:16:16,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:16:16,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:16:16,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:16:16,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:16:16,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:16:16,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:16:16,323 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 23:16:16,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:16:16,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:16:16,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:16:16,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:16:16,360 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:16:16,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:16:16,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:16:16,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:16:16,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:16:16,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:16:16,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:16:16,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:16:16,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:16:16,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:16:16,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:16:16,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:16:16,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:16:16,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:16:16,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:16:16,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:16:16,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:16:16,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:16:16,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:16:16,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:16:16,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:16:16,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:16:16,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:16:16,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:16:16,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:16:16,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:16:16,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:16:16,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:16:16,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:16:16,656 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:16:16,657 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2019-10-14 23:16:16,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f0ee419/854c3834c38a41b78efd84fc951b060f/FLAGb10bfcf71 [2019-10-14 23:16:17,173 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:16:17,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2019-10-14 23:16:17,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f0ee419/854c3834c38a41b78efd84fc951b060f/FLAGb10bfcf71 [2019-10-14 23:16:17,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f0ee419/854c3834c38a41b78efd84fc951b060f [2019-10-14 23:16:17,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:16:17,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:16:17,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:16:17,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:16:17,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:16:17,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:17,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd45ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17, skipping insertion in model container [2019-10-14 23:16:17,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:17,608 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:16:17,624 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:16:17,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:16:17,888 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:16:17,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:16:17,949 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:16:17,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17 WrapperNode [2019-10-14 23:16:17,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:16:17,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:16:17,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:16:17,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:16:18,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:18,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:18,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:18,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:18,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:18,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:18,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (1/1) ... [2019-10-14 23:16:18,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:16:18,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:16:18,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:16:18,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:16:18,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (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 23:16:18,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:16:18,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:16:18,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:16:18,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:16:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:16:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:16:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-14 23:16:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:16:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 23:16:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:16:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:16:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:16:18,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:16:18,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:16:18,457 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:16:18,458 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:16:18,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:16:18 BoogieIcfgContainer [2019-10-14 23:16:18,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:16:18,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:16:18,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:16:18,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:16:18,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:16:17" (1/3) ... [2019-10-14 23:16:18,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7936236d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:16:18, skipping insertion in model container [2019-10-14 23:16:18,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:17" (2/3) ... [2019-10-14 23:16:18,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7936236d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:16:18, skipping insertion in model container [2019-10-14 23:16:18,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:16:18" (3/3) ... [2019-10-14 23:16:18,467 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2019-10-14 23:16:18,480 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:16:18,488 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:16:18,524 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:16:18,587 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:16:18,588 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:16:18,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:16:18,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:16:18,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:16:18,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:16:18,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:16:18,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:16:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-14 23:16:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 23:16:18,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:18,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:18,623 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:18,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:18,629 INFO L82 PathProgramCache]: Analyzing trace with hash 637757472, now seen corresponding path program 1 times [2019-10-14 23:16:18,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:18,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686461274] [2019-10-14 23:16:18,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:18,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:18,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:18,811 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 23:16:18,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686461274] [2019-10-14 23:16:18,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:16:18,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:16:18,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379051148] [2019-10-14 23:16:18,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:16:18,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:16:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:16:18,837 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-10-14 23:16:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:18,940 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-10-14 23:16:18,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:16:18,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-14 23:16:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:18,951 INFO L225 Difference]: With dead ends: 50 [2019-10-14 23:16:18,951 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 23:16:18,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:16:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 23:16:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 23:16:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:16:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-14 23:16:18,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2019-10-14 23:16:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:18,992 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-14 23:16:18,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:16:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-14 23:16:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 23:16:18,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:18,993 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:18,994 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash -962501754, now seen corresponding path program 1 times [2019-10-14 23:16:18,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:18,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151532921] [2019-10-14 23:16:18,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:18,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:18,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:19,183 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 23:16:19,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151532921] [2019-10-14 23:16:19,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:16:19,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:16:19,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827141199] [2019-10-14 23:16:19,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:16:19,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:19,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:16:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:16:19,187 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-10-14 23:16:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:19,311 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-14 23:16:19,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:16:19,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-14 23:16:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:19,312 INFO L225 Difference]: With dead ends: 41 [2019-10-14 23:16:19,313 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 23:16:19,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:16:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 23:16:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-10-14 23:16:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-14 23:16:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-14 23:16:19,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2019-10-14 23:16:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:19,321 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-14 23:16:19,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:16:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-14 23:16:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:16:19,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:19,322 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 23:16:19,323 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:19,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:19,323 INFO L82 PathProgramCache]: Analyzing trace with hash 513665657, now seen corresponding path program 1 times [2019-10-14 23:16:19,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:19,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994383823] [2019-10-14 23:16:19,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:19,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:19,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:20,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994383823] [2019-10-14 23:16:20,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304093823] [2019-10-14 23:16:20,027 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 23:16:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:20,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-14 23:16:20,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:20,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:20,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:20,399 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 28 treesize of output 27 [2019-10-14 23:16:20,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:20,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:20,417 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 23:16:20,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-10-14 23:16:20,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:20,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-14 23:16:20,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:20,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:20,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:20,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-14 23:16:20,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:20,522 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:20,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-10-14 23:16:20,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298903297] [2019-10-14 23:16:20,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:16:20,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:20,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:16:20,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:16:20,528 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 21 states. [2019-10-14 23:16:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:21,458 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2019-10-14 23:16:21,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 23:16:21,458 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2019-10-14 23:16:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:21,462 INFO L225 Difference]: With dead ends: 64 [2019-10-14 23:16:21,462 INFO L226 Difference]: Without dead ends: 62 [2019-10-14 23:16:21,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 23:16:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-14 23:16:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2019-10-14 23:16:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 23:16:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-14 23:16:21,486 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2019-10-14 23:16:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:21,489 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-14 23:16:21,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:16:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-14 23:16:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:16:21,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:21,491 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 23:16:21,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:21,701 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1214730235, now seen corresponding path program 1 times [2019-10-14 23:16:21,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:21,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896650206] [2019-10-14 23:16:21,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:21,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:21,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:21,775 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 23:16:21,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896650206] [2019-10-14 23:16:21,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:16:21,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:16:21,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242896584] [2019-10-14 23:16:21,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:16:21,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:16:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:16:21,783 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 6 states. [2019-10-14 23:16:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:21,894 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2019-10-14 23:16:21,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:16:21,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-14 23:16:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:21,901 INFO L225 Difference]: With dead ends: 89 [2019-10-14 23:16:21,901 INFO L226 Difference]: Without dead ends: 58 [2019-10-14 23:16:21,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:16:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-14 23:16:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2019-10-14 23:16:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 23:16:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-14 23:16:21,930 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 19 [2019-10-14 23:16:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:21,930 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-14 23:16:21,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:16:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-14 23:16:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:16:21,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:21,936 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:21,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:21,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1947791941, now seen corresponding path program 1 times [2019-10-14 23:16:21,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:21,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047066964] [2019-10-14 23:16:21,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:21,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:21,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:22,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047066964] [2019-10-14 23:16:22,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47303337] [2019-10-14 23:16:22,380 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 23:16:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:22,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-14 23:16:22,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:22,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,540 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-10-14 23:16:22,540 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 38 treesize of output 29 [2019-10-14 23:16:22,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:22,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:22,550 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 23:16:22,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-10-14 23:16:22,757 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-10-14 23:16:22,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 123 [2019-10-14 23:16:22,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:22,807 INFO L567 ElimStorePlain]: treesize reduction 132, result has 21.9 percent of original size [2019-10-14 23:16:22,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:16:22,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-10-14 23:16:22,924 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-10-14 23:16:22,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 66 [2019-10-14 23:16:22,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:22,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 23:16:22,967 INFO L567 ElimStorePlain]: treesize reduction 108, result has 10.0 percent of original size [2019-10-14 23:16:22,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:22,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-10-14 23:16:22,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:23,023 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:23,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2019-10-14 23:16:23,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453095234] [2019-10-14 23:16:23,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 23:16:23,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:23,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 23:16:23,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-14 23:16:23,025 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 26 states. [2019-10-14 23:16:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:23,692 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2019-10-14 23:16:23,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:16:23,694 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 22 [2019-10-14 23:16:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:23,695 INFO L225 Difference]: With dead ends: 99 [2019-10-14 23:16:23,695 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:16:23,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=1093, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 23:16:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:16:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2019-10-14 23:16:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 23:16:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-10-14 23:16:23,706 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 22 [2019-10-14 23:16:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:23,707 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-10-14 23:16:23,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-14 23:16:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-10-14 23:16:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:16:23,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:23,708 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:23,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:23,912 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1126706988, now seen corresponding path program 2 times [2019-10-14 23:16:23,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:23,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844485706] [2019-10-14 23:16:23,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:23,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:23,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:24,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844485706] [2019-10-14 23:16:24,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729580308] [2019-10-14 23:16:24,415 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 23:16:24,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:16:24,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:16:24,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-14 23:16:24,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:24,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:24,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:24,549 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 28 treesize of output 27 [2019-10-14 23:16:24,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:24,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:24,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:24,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-10-14 23:16:24,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:24,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:24,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:24,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:24,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-14 23:16:24,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:24,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:24,650 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 23:16:24,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-10-14 23:16:24,682 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:24,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-14 23:16:24,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:24,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:24,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:24,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-14 23:16:24,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:24,717 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:24,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-10-14 23:16:24,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641772083] [2019-10-14 23:16:24,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:16:24,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:24,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:16:24,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:16:24,719 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 21 states. [2019-10-14 23:16:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:25,715 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-10-14 23:16:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 23:16:25,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-10-14 23:16:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:25,717 INFO L225 Difference]: With dead ends: 98 [2019-10-14 23:16:25,717 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 23:16:25,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2019-10-14 23:16:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 23:16:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 48. [2019-10-14 23:16:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 23:16:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-10-14 23:16:25,736 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2019-10-14 23:16:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:25,736 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-10-14 23:16:25,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:16:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-10-14 23:16:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:16:25,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:25,737 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, 1, 1] [2019-10-14 23:16:25,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:25,943 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1757940304, now seen corresponding path program 1 times [2019-10-14 23:16:25,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:25,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327090415] [2019-10-14 23:16:25,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:25,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:25,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:26,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327090415] [2019-10-14 23:16:26,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979904750] [2019-10-14 23:16:26,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 23:16:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:26,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 23:16:26,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:26,197 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:26,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-10-14 23:16:26,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377843132] [2019-10-14 23:16:26,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:16:26,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:26,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:16:26,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:16:26,202 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 10 states. [2019-10-14 23:16:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:26,366 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-10-14 23:16:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:16:26,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-14 23:16:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:26,368 INFO L225 Difference]: With dead ends: 79 [2019-10-14 23:16:26,368 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 23:16:26,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:16:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 23:16:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2019-10-14 23:16:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-14 23:16:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-10-14 23:16:26,388 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 27 [2019-10-14 23:16:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:26,388 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-10-14 23:16:26,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:16:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-10-14 23:16:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:16:26,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:26,396 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:26,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:26,600 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1735507290, now seen corresponding path program 1 times [2019-10-14 23:16:26,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:26,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125973108] [2019-10-14 23:16:26,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:26,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:26,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:26,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125973108] [2019-10-14 23:16:26,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123712239] [2019-10-14 23:16:26,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 23:16:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:26,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-14 23:16:26,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:27,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:27,060 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 21 treesize of output 20 [2019-10-14 23:16:27,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:27,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:27,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:27,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-14 23:16:27,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:27,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-14 23:16:27,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:27,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:27,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:27,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-14 23:16:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:27,132 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:27,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2019-10-14 23:16:27,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765988262] [2019-10-14 23:16:27,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 23:16:27,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:27,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 23:16:27,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:16:27,134 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 20 states. [2019-10-14 23:16:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:28,478 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2019-10-14 23:16:28,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-14 23:16:28,479 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-10-14 23:16:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:28,481 INFO L225 Difference]: With dead ends: 135 [2019-10-14 23:16:28,481 INFO L226 Difference]: Without dead ends: 133 [2019-10-14 23:16:28,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2019-10-14 23:16:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-14 23:16:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 63. [2019-10-14 23:16:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:16:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-10-14 23:16:28,495 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 28 [2019-10-14 23:16:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:28,496 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-10-14 23:16:28,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 23:16:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-10-14 23:16:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:16:28,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:28,497 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:28,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:28,705 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:28,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1034442712, now seen corresponding path program 2 times [2019-10-14 23:16:28,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:28,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023433786] [2019-10-14 23:16:28,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:28,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:28,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:28,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023433786] [2019-10-14 23:16:28,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940873155] [2019-10-14 23:16:28,789 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 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 23:16:28,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:16:28,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:16:28,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:16:28,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:28,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:28,856 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:28,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2019-10-14 23:16:28,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328452958] [2019-10-14 23:16:28,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:16:28,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:28,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:16:28,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:16:28,859 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 8 states. [2019-10-14 23:16:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:29,055 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-10-14 23:16:29,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:16:29,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-10-14 23:16:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:29,056 INFO L225 Difference]: With dead ends: 129 [2019-10-14 23:16:29,056 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 23:16:29,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:16:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 23:16:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2019-10-14 23:16:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-14 23:16:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-10-14 23:16:29,081 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 28 [2019-10-14 23:16:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:29,083 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-10-14 23:16:29,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:16:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-10-14 23:16:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:16:29,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:29,087 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:29,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:29,288 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:29,288 INFO L82 PathProgramCache]: Analyzing trace with hash -215590674, now seen corresponding path program 3 times [2019-10-14 23:16:29,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:29,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819435758] [2019-10-14 23:16:29,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:29,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:29,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:29,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819435758] [2019-10-14 23:16:29,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172580380] [2019-10-14 23:16:29,862 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 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 23:16:29,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 23:16:29,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:16:29,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 23:16:29,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:29,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:30,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:30,006 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 39 treesize of output 29 [2019-10-14 23:16:30,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:30,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:30,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:30,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:49 [2019-10-14 23:16:30,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:30,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:16:30,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:30,151 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 1 case distinctions, treesize of input 50 treesize of output 44 [2019-10-14 23:16:30,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:30,176 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-10-14 23:16:30,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:30,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-10-14 23:16:30,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:30,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:30,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:30,316 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:30,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-14 23:16:30,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:30,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:30,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:30,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2019-10-14 23:16:30,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:30,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-10-14 23:16:30,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:30,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:30,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:30,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-10-14 23:16:30,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:30,384 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:30,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 24 [2019-10-14 23:16:30,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073949064] [2019-10-14 23:16:30,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 23:16:30,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:30,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 23:16:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:16:30,386 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 24 states. [2019-10-14 23:16:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:31,190 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-10-14 23:16:31,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:16:31,190 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-10-14 23:16:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:31,192 INFO L225 Difference]: With dead ends: 98 [2019-10-14 23:16:31,192 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 23:16:31,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 23:16:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 23:16:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2019-10-14 23:16:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:16:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-10-14 23:16:31,204 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 28 [2019-10-14 23:16:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:31,205 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-10-14 23:16:31,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 23:16:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-10-14 23:16:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:16:31,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:31,206 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:31,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:31,418 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1274271122, now seen corresponding path program 4 times [2019-10-14 23:16:31,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:31,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748585917] [2019-10-14 23:16:31,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:31,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:31,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:31,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748585917] [2019-10-14 23:16:31,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100152626] [2019-10-14 23:16:31,751 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 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 23:16:31,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:16:31,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:16:31,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-14 23:16:31,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:31,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:31,896 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-10-14 23:16:31,897 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 38 treesize of output 29 [2019-10-14 23:16:31,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:31,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:31,906 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 23:16:31,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-10-14 23:16:32,069 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-10-14 23:16:32,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 123 [2019-10-14 23:16:32,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:32,120 INFO L567 ElimStorePlain]: treesize reduction 129, result has 22.3 percent of original size [2019-10-14 23:16:32,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:16:32,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2019-10-14 23:16:32,226 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-10-14 23:16:32,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 66 [2019-10-14 23:16:32,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-14 23:16:32,282 INFO L567 ElimStorePlain]: treesize reduction 133, result has 8.3 percent of original size [2019-10-14 23:16:32,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:32,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-10-14 23:16:32,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:16:32,324 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:32,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-10-14 23:16:32,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914382383] [2019-10-14 23:16:32,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-14 23:16:32,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:32,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-14 23:16:32,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:16:32,326 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 25 states. [2019-10-14 23:16:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:34,202 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2019-10-14 23:16:34,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-14 23:16:34,204 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-10-14 23:16:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:34,206 INFO L225 Difference]: With dead ends: 161 [2019-10-14 23:16:34,206 INFO L226 Difference]: Without dead ends: 125 [2019-10-14 23:16:34,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=393, Invalid=3029, Unknown=0, NotChecked=0, Total=3422 [2019-10-14 23:16:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-14 23:16:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 63. [2019-10-14 23:16:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:16:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-10-14 23:16:34,231 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 31 [2019-10-14 23:16:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:34,233 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-10-14 23:16:34,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-14 23:16:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-10-14 23:16:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:16:34,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:34,235 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:34,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:34,453 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:34,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:34,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1796724579, now seen corresponding path program 2 times [2019-10-14 23:16:34,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:34,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747732958] [2019-10-14 23:16:34,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:34,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:34,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:34,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747732958] [2019-10-14 23:16:34,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344748560] [2019-10-14 23:16:34,773 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 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 23:16:34,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:16:34,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:16:34,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 23:16:34,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:34,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:34,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:34,959 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 23 treesize of output 22 [2019-10-14 23:16:34,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:34,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:34,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:34,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 23:16:35,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:35,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-14 23:16:35,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:35,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:35,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:35,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-14 23:16:35,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:35,227 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:35,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2019-10-14 23:16:35,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350782759] [2019-10-14 23:16:35,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-14 23:16:35,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-14 23:16:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2019-10-14 23:16:35,229 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 29 states. [2019-10-14 23:16:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:56,772 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-10-14 23:16:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-14 23:16:56,772 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-10-14 23:16:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:56,774 INFO L225 Difference]: With dead ends: 105 [2019-10-14 23:16:56,774 INFO L226 Difference]: Without dead ends: 103 [2019-10-14 23:16:56,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=1991, Unknown=0, NotChecked=0, Total=2256 [2019-10-14 23:16:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-14 23:16:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2019-10-14 23:16:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 23:16:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-10-14 23:16:56,784 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 33 [2019-10-14 23:16:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:56,784 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-10-14 23:16:56,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-14 23:16:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-10-14 23:16:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:16:56,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:56,785 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:16:56,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:16:56,989 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:16:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:16:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1084921683, now seen corresponding path program 2 times [2019-10-14 23:16:56,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:16:56,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114475901] [2019-10-14 23:16:56,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:56,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:16:56,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:16:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:16:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:57,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114475901] [2019-10-14 23:16:57,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968270344] [2019-10-14 23:16:57,557 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 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 23:16:57,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:16:57,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:16:57,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-14 23:16:57,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:16:57,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:57,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,680 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 28 treesize of output 27 [2019-10-14 23:16:57,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:57,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:57,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:57,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-10-14 23:16:57,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:57,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-14 23:16:57,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:57,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:57,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:57,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-10-14 23:16:57,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:57,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2019-10-14 23:16:57,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:57,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:57,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:57,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-10-14 23:16:57,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:16:57,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:57,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 49 [2019-10-14 23:16:57,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:57,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:57,982 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 23:16:57,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:25 [2019-10-14 23:16:58,017 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:58,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-14 23:16:58,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:16:58,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:16:58,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:16:58,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-14 23:16:58,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:16:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:16:58,066 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:16:58,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2019-10-14 23:16:58,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329803637] [2019-10-14 23:16:58,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 23:16:58,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:16:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 23:16:58,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-10-14 23:16:58,067 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 27 states. [2019-10-14 23:16:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:16:59,801 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2019-10-14 23:16:59,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-14 23:16:59,803 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-10-14 23:16:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:16:59,806 INFO L225 Difference]: With dead ends: 178 [2019-10-14 23:16:59,806 INFO L226 Difference]: Without dead ends: 176 [2019-10-14 23:16:59,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=316, Invalid=2134, Unknown=0, NotChecked=0, Total=2450 [2019-10-14 23:16:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-14 23:16:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 93. [2019-10-14 23:16:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-14 23:16:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2019-10-14 23:16:59,821 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 34 [2019-10-14 23:16:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:16:59,821 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2019-10-14 23:16:59,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-14 23:16:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2019-10-14 23:16:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:16:59,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:16:59,822 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:17:00,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:17:00,023 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:17:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:17:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash -101781095, now seen corresponding path program 3 times [2019-10-14 23:17:00,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:17:00,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645115462] [2019-10-14 23:17:00,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:17:00,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:17:00,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:17:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:17:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:17:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:17:00,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645115462] [2019-10-14 23:17:00,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162850800] [2019-10-14 23:17:00,480 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:17:00,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-14 23:17:00,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:17:00,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 23:17:00,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:17:00,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:17:00,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:17:00,731 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 28 treesize of output 27 [2019-10-14 23:17:00,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:17:00,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:17:00,742 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 23:17:00,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-10-14 23:17:00,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:17:00,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:17:00,906 INFO L341 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2019-10-14 23:17:00,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 47 [2019-10-14 23:17:00,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:17:00,923 INFO L567 ElimStorePlain]: treesize reduction 30, result has 40.0 percent of original size [2019-10-14 23:17:00,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:17:00,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:17 [2019-10-14 23:17:00,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:17:00,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-14 23:17:00,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:17:00,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:17:00,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:17:00,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-14 23:17:00,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:17:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:17:00,984 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:17:00,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-10-14 23:17:00,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749690576] [2019-10-14 23:17:00,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-14 23:17:00,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:17:00,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-14 23:17:00,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2019-10-14 23:17:00,985 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 29 states.