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-f4eb214f-m [2019-10-13 19:17:16,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:17:16,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:17:16,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:17:16,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:17:16,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:17:16,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:17:16,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:17:16,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:17:16,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:17:16,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:17:16,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:17:16,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:17:16,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:17:16,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:17:16,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:17:16,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:17:16,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:17:16,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:17:16,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:17:16,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:17:16,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:17:16,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:17:16,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:17:16,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:17:16,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:17:16,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:17:16,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:17:16,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:17:16,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:17:16,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:17:16,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:17:16,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:17:16,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:17:16,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:17:16,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:17:16,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:17:16,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:17:16,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:17:16,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:17:16,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:17:17,000 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-13 19:17:17,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:17:17,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:17:17,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:17:17,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:17:17,017 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:17:17,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:17:17,017 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:17:17,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:17:17,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:17:17,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:17:17,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:17:17,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:17:17,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:17:17,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:17:17,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:17:17,019 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:17:17,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:17:17,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:17:17,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:17:17,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:17:17,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:17:17,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:17:17,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:17:17,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:17:17,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:17:17,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:17:17,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:17:17,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:17:17,022 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:17:17,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:17:17,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:17:17,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:17:17,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:17:17,317 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:17:17,318 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-13 19:17:17,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08266de57/1ddfdec8810b4a32ad61923e9850535f/FLAG03c075a6d [2019-10-13 19:17:17,837 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:17:17,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2019-10-13 19:17:17,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08266de57/1ddfdec8810b4a32ad61923e9850535f/FLAG03c075a6d [2019-10-13 19:17:18,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08266de57/1ddfdec8810b4a32ad61923e9850535f [2019-10-13 19:17:18,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:17:18,235 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:17:18,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:17:18,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:17:18,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:17:18,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1960e7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18, skipping insertion in model container [2019-10-13 19:17:18,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,253 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:17:18,274 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:17:18,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:17:18,531 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:17:18,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:17:18,590 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:17:18,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18 WrapperNode [2019-10-13 19:17:18,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:17:18,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:17:18,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:17:18,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:17:18,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (1/1) ... [2019-10-13 19:17:18,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:17:18,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:17:18,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:17:18,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:17:18,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (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-13 19:17:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:17:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:17:18,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 19:17:18,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:17:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:17:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 19:17:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 19:17:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:17:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 19:17:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 19:17:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 19:17:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:17:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:17:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:17:19,104 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:17:19,104 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 19:17:19,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:17:19 BoogieIcfgContainer [2019-10-13 19:17:19,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:17:19,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:17:19,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:17:19,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:17:19,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:17:18" (1/3) ... [2019-10-13 19:17:19,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a17da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:17:19, skipping insertion in model container [2019-10-13 19:17:19,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:18" (2/3) ... [2019-10-13 19:17:19,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a17da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:17:19, skipping insertion in model container [2019-10-13 19:17:19,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:17:19" (3/3) ... [2019-10-13 19:17:19,122 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2019-10-13 19:17:19,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:17:19,143 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:17:19,171 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:17:19,198 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:17:19,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:17:19,198 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:17:19,198 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:17:19,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:17:19,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:17:19,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:17:19,199 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:17:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-13 19:17:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 19:17:19,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:19,226 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:19,228 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash 637757472, now seen corresponding path program 1 times [2019-10-13 19:17:19,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:19,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070106804] [2019-10-13 19:17:19,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:19,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:19,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:19,434 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-13 19:17:19,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070106804] [2019-10-13 19:17:19,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:17:19,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:17:19,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636514319] [2019-10-13 19:17:19,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:17:19,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:17:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:17:19,453 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-10-13 19:17:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:19,579 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-10-13 19:17:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:17:19,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 19:17:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:19,591 INFO L225 Difference]: With dead ends: 50 [2019-10-13 19:17:19,591 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 19:17:19,595 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-13 19:17:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 19:17:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-13 19:17:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 19:17:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-13 19:17:19,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2019-10-13 19:17:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:19,634 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-13 19:17:19,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:17:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-13 19:17:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 19:17:19,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:19,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:19,636 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:19,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash -962501754, now seen corresponding path program 1 times [2019-10-13 19:17:19,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:19,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767039058] [2019-10-13 19:17:19,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:19,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:19,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:19,879 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-13 19:17:19,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767039058] [2019-10-13 19:17:19,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:17:19,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:17:19,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853291458] [2019-10-13 19:17:19,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:17:19,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:17:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:17:19,885 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-10-13 19:17:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:19,999 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-13 19:17:19,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:17:20,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-13 19:17:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:20,001 INFO L225 Difference]: With dead ends: 41 [2019-10-13 19:17:20,001 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 19:17:20,002 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-13 19:17:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 19:17:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-10-13 19:17:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 19:17:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-13 19:17:20,009 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2019-10-13 19:17:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:20,009 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-13 19:17:20,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:17:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-13 19:17:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:17:20,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:20,011 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-13 19:17:20,011 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 513665657, now seen corresponding path program 1 times [2019-10-13 19:17:20,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:20,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471222989] [2019-10-13 19:17:20,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:20,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:20,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:20,804 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-13 19:17:20,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471222989] [2019-10-13 19:17:20,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143879178] [2019-10-13 19:17:20,805 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-13 19:17:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:20,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-13 19:17:20,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:21,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:21,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:21,161 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-13 19:17:21,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:21,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:21,194 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-13 19:17:21,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-10-13 19:17:21,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:21,249 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-13 19:17:21,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:21,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:21,253 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-13 19:17:21,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-13 19:17:21,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:21,298 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-13 19:17:21,299 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:21,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-10-13 19:17:21,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712413794] [2019-10-13 19:17:21,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 19:17:21,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 19:17:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:17:21,302 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 21 states. [2019-10-13 19:17:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:22,335 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2019-10-13 19:17:22,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 19:17:22,336 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2019-10-13 19:17:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:22,339 INFO L225 Difference]: With dead ends: 64 [2019-10-13 19:17:22,339 INFO L226 Difference]: Without dead ends: 62 [2019-10-13 19:17:22,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 19:17:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-13 19:17:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2019-10-13 19:17:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 19:17:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-13 19:17:22,354 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2019-10-13 19:17:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:22,355 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-13 19:17:22,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 19:17:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-13 19:17:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:17:22,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:22,356 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-13 19:17:22,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:22,561 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1214730235, now seen corresponding path program 1 times [2019-10-13 19:17:22,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:22,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673683897] [2019-10-13 19:17:22,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:22,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:22,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:22,639 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-13 19:17:22,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673683897] [2019-10-13 19:17:22,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:17:22,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:17:22,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727773579] [2019-10-13 19:17:22,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:17:22,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:22,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:17:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:17:22,645 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 6 states. [2019-10-13 19:17:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:22,763 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2019-10-13 19:17:22,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:17:22,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-13 19:17:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:22,767 INFO L225 Difference]: With dead ends: 89 [2019-10-13 19:17:22,768 INFO L226 Difference]: Without dead ends: 58 [2019-10-13 19:17:22,768 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-13 19:17:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-13 19:17:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2019-10-13 19:17:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 19:17:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-13 19:17:22,785 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 19 [2019-10-13 19:17:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:22,786 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-13 19:17:22,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:17:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-13 19:17:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:17:22,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:22,788 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-13 19:17:22,789 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1947791941, now seen corresponding path program 1 times [2019-10-13 19:17:22,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:22,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384510551] [2019-10-13 19:17:22,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:22,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:22,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:23,341 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-13 19:17:23,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384510551] [2019-10-13 19:17:23,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023878894] [2019-10-13 19:17:23,342 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-13 19:17:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:23,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-13 19:17:23,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:23,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,533 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-10-13 19:17:23,534 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-13 19:17:23,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:23,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:23,554 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-13 19:17:23,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-10-13 19:17:23,771 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-10-13 19:17:23,772 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-13 19:17:23,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:23,814 INFO L567 ElimStorePlain]: treesize reduction 132, result has 21.9 percent of original size [2019-10-13 19:17:23,815 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-13 19:17:23,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-10-13 19:17:23,948 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-10-13 19:17:23,949 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-13 19:17:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:23,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 19:17:24,008 INFO L567 ElimStorePlain]: treesize reduction 108, result has 10.0 percent of original size [2019-10-13 19:17:24,008 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-13 19:17:24,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-10-13 19:17:24,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:24,058 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-13 19:17:24,059 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:24,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2019-10-13 19:17:24,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393244747] [2019-10-13 19:17:24,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 19:17:24,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 19:17:24,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-13 19:17:24,061 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 26 states. [2019-10-13 19:17:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:24,821 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2019-10-13 19:17:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 19:17:24,823 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 22 [2019-10-13 19:17:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:24,824 INFO L225 Difference]: With dead ends: 99 [2019-10-13 19:17:24,824 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 19:17:24,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=1093, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 19:17:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 19:17:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2019-10-13 19:17:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 19:17:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-10-13 19:17:24,835 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 22 [2019-10-13 19:17:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:24,835 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-10-13 19:17:24,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 19:17:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-10-13 19:17:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:17:24,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:24,836 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-13 19:17:25,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:25,040 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1126706988, now seen corresponding path program 2 times [2019-10-13 19:17:25,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:25,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283797152] [2019-10-13 19:17:25,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:25,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:25,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:25,441 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-13 19:17:25,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283797152] [2019-10-13 19:17:25,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852805422] [2019-10-13 19:17:25,442 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-13 19:17:25,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:17:25,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:25,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 19:17:25,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:25,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:25,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:25,590 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-13 19:17:25,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:25,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:25,603 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-13 19:17:25,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-10-13 19:17:25,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:25,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:25,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:25,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:25,690 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-13 19:17:25,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:25,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:25,703 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-13 19:17:25,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-10-13 19:17:25,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:25,745 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-13 19:17:25,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:25,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:25,748 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-13 19:17:25,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-13 19:17:25,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:25,790 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-13 19:17:25,791 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:25,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-10-13 19:17:25,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297599276] [2019-10-13 19:17:25,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 19:17:25,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 19:17:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:17:25,793 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 21 states. [2019-10-13 19:17:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:26,884 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-10-13 19:17:26,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 19:17:26,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-10-13 19:17:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:26,886 INFO L225 Difference]: With dead ends: 98 [2019-10-13 19:17:26,887 INFO L226 Difference]: Without dead ends: 96 [2019-10-13 19:17:26,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2019-10-13 19:17:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-13 19:17:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 48. [2019-10-13 19:17:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 19:17:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-10-13 19:17:26,899 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2019-10-13 19:17:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:26,899 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-10-13 19:17:26,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 19:17:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-10-13 19:17:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:17:26,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:26,901 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-13 19:17:27,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:27,113 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:27,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1757940304, now seen corresponding path program 1 times [2019-10-13 19:17:27,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:27,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278236000] [2019-10-13 19:17:27,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:27,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:27,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:27,289 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-13 19:17:27,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278236000] [2019-10-13 19:17:27,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466932610] [2019-10-13 19:17:27,290 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-13 19:17:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:27,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 19:17:27,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:27,403 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-13 19:17:27,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:27,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-10-13 19:17:27,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196785284] [2019-10-13 19:17:27,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:17:27,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:27,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:17:27,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:17:27,405 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 10 states. [2019-10-13 19:17:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:27,576 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-10-13 19:17:27,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:17:27,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-13 19:17:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:27,578 INFO L225 Difference]: With dead ends: 79 [2019-10-13 19:17:27,579 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 19:17:27,580 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-13 19:17:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 19:17:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2019-10-13 19:17:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-13 19:17:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-10-13 19:17:27,588 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 27 [2019-10-13 19:17:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:27,589 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-10-13 19:17:27,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:17:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-10-13 19:17:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:17:27,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:27,590 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-13 19:17:27,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:27,793 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1735507290, now seen corresponding path program 1 times [2019-10-13 19:17:27,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:27,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229695077] [2019-10-13 19:17:27,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:27,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:27,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:28,165 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-13 19:17:28,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229695077] [2019-10-13 19:17:28,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486449895] [2019-10-13 19:17:28,166 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-13 19:17:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:28,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 19:17:28,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:28,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:28,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:28,322 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-13 19:17:28,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:28,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:28,329 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-13 19:17:28,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-13 19:17:28,353 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:28,354 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-13 19:17:28,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:28,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:28,357 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-13 19:17:28,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-13 19:17:28,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:28,387 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-13 19:17:28,387 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:28,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2019-10-13 19:17:28,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766002086] [2019-10-13 19:17:28,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 19:17:28,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 19:17:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:17:28,389 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 20 states. [2019-10-13 19:17:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:29,834 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2019-10-13 19:17:29,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-13 19:17:29,834 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-10-13 19:17:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:29,836 INFO L225 Difference]: With dead ends: 135 [2019-10-13 19:17:29,838 INFO L226 Difference]: Without dead ends: 133 [2019-10-13 19:17:29,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 19:17:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-13 19:17:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 63. [2019-10-13 19:17:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 19:17:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-10-13 19:17:29,859 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 28 [2019-10-13 19:17:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:29,860 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-10-13 19:17:29,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 19:17:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-10-13 19:17:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:17:29,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:29,867 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-13 19:17:30,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:30,080 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1034442712, now seen corresponding path program 2 times [2019-10-13 19:17:30,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:30,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261154091] [2019-10-13 19:17:30,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:30,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:30,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:30,161 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-13 19:17:30,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261154091] [2019-10-13 19:17:30,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074990898] [2019-10-13 19:17:30,162 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-13 19:17:30,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:17:30,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:30,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 19:17:30,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:30,211 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-13 19:17:30,211 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:30,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2019-10-13 19:17:30,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687963638] [2019-10-13 19:17:30,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:17:30,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:17:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:17:30,213 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 8 states. [2019-10-13 19:17:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:30,395 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-10-13 19:17:30,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:17:30,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-10-13 19:17:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:30,397 INFO L225 Difference]: With dead ends: 129 [2019-10-13 19:17:30,397 INFO L226 Difference]: Without dead ends: 96 [2019-10-13 19:17:30,397 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-13 19:17:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-13 19:17:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2019-10-13 19:17:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 19:17:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-10-13 19:17:30,408 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 28 [2019-10-13 19:17:30,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:30,412 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-10-13 19:17:30,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:17:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-10-13 19:17:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:17:30,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:30,416 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-13 19:17:30,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:30,625 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash -215590674, now seen corresponding path program 3 times [2019-10-13 19:17:30,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:30,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034346481] [2019-10-13 19:17:30,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:30,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:30,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:31,144 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-13 19:17:31,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034346481] [2019-10-13 19:17:31,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063316618] [2019-10-13 19:17:31,145 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-13 19:17:31,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 19:17:31,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:31,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 19:17:31,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:31,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:31,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:31,266 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-13 19:17:31,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:31,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:49 [2019-10-13 19:17:31,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:31,422 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:31,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:31,427 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-13 19:17:31,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,455 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-10-13 19:17:31,456 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-13 19:17:31,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-10-13 19:17:31,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:31,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:31,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:31,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:31,574 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-13 19:17:31,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:31,586 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-13 19:17:31,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2019-10-13 19:17:31,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:31,603 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-13 19:17:31,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:31,606 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-13 19:17:31,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-10-13 19:17:31,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:31,645 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-13 19:17:31,645 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:31,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 24 [2019-10-13 19:17:31,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155185284] [2019-10-13 19:17:31,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 19:17:31,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 19:17:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-10-13 19:17:31,647 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 24 states. [2019-10-13 19:17:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:32,496 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-10-13 19:17:32,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 19:17:32,497 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-10-13 19:17:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:32,498 INFO L225 Difference]: With dead ends: 98 [2019-10-13 19:17:32,498 INFO L226 Difference]: Without dead ends: 96 [2019-10-13 19:17:32,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 19:17:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-13 19:17:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2019-10-13 19:17:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 19:17:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-10-13 19:17:32,509 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 28 [2019-10-13 19:17:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:32,509 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-10-13 19:17:32,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 19:17:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-10-13 19:17:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:17:32,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:32,510 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-13 19:17:32,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:32,717 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:32,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1274271122, now seen corresponding path program 4 times [2019-10-13 19:17:32,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:32,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160859193] [2019-10-13 19:17:32,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:32,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:32,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:33,053 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-13 19:17:33,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160859193] [2019-10-13 19:17:33,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171073850] [2019-10-13 19:17:33,054 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-13 19:17:33,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 19:17:33,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:33,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 19:17:33,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:33,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,256 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-10-13 19:17:33,256 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-13 19:17:33,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:33,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:33,266 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-13 19:17:33,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-10-13 19:17:33,456 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-10-13 19:17:33,457 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-13 19:17:33,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:33,495 INFO L567 ElimStorePlain]: treesize reduction 129, result has 22.3 percent of original size [2019-10-13 19:17:33,496 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-13 19:17:33,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2019-10-13 19:17:33,604 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-10-13 19:17:33,605 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-13 19:17:33,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-13 19:17:33,659 INFO L567 ElimStorePlain]: treesize reduction 133, result has 8.3 percent of original size [2019-10-13 19:17:33,659 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-13 19:17:33,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-10-13 19:17:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:33,698 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-13 19:17:33,698 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:33,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-10-13 19:17:33,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057349018] [2019-10-13 19:17:33,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 19:17:33,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:33,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 19:17:33,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:17:33,700 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 25 states. [2019-10-13 19:17:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:35,572 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2019-10-13 19:17:35,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-13 19:17:35,573 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-10-13 19:17:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:35,575 INFO L225 Difference]: With dead ends: 161 [2019-10-13 19:17:35,575 INFO L226 Difference]: Without dead ends: 125 [2019-10-13 19:17:35,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=393, Invalid=3029, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 19:17:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-13 19:17:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 63. [2019-10-13 19:17:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 19:17:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-10-13 19:17:35,607 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 31 [2019-10-13 19:17:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:35,607 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-10-13 19:17:35,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 19:17:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-10-13 19:17:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:17:35,609 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:35,614 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-13 19:17:35,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:35,816 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1796724579, now seen corresponding path program 2 times [2019-10-13 19:17:35,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:35,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371131314] [2019-10-13 19:17:35,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:35,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:35,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:36,115 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-13 19:17:36,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371131314] [2019-10-13 19:17:36,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970991778] [2019-10-13 19:17:36,116 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-13 19:17:36,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:17:36,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:36,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 19:17:36,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:36,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:36,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:36,374 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-13 19:17:36,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:36,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:36,385 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-13 19:17:36,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-13 19:17:36,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:36,639 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-13 19:17:36,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:36,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:36,641 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-13 19:17:36,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-13 19:17:36,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:36,692 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-13 19:17:36,693 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:36,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2019-10-13 19:17:36,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999745122] [2019-10-13 19:17:36,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 19:17:36,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:36,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 19:17:36,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2019-10-13 19:17:36,695 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 29 states. [2019-10-13 19:17:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:58,710 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-10-13 19:17:58,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 19:17:58,711 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-10-13 19:17:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:58,712 INFO L225 Difference]: With dead ends: 105 [2019-10-13 19:17:58,712 INFO L226 Difference]: Without dead ends: 103 [2019-10-13 19:17:58,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=265, Invalid=1991, Unknown=0, NotChecked=0, Total=2256 [2019-10-13 19:17:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-13 19:17:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2019-10-13 19:17:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 19:17:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-10-13 19:17:58,723 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 33 [2019-10-13 19:17:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:58,724 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-10-13 19:17:58,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 19:17:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-10-13 19:17:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:17:58,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:58,727 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-13 19:17:58,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:58,928 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1084921683, now seen corresponding path program 2 times [2019-10-13 19:17:58,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:58,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630778386] [2019-10-13 19:17:58,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:58,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:58,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:59,503 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-13 19:17:59,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630778386] [2019-10-13 19:17:59,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826838063] [2019-10-13 19:17:59,504 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-13 19:17:59,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:17:59,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:59,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-13 19:17:59,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:59,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:59,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,640 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-13 19:17:59,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:59,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,652 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-13 19:17:59,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-10-13 19:17:59,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,731 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,732 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-13 19:17:59,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:59,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,743 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-13 19:17:59,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-10-13 19:17:59,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,839 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-13 19:17:59,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:59,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:59,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-10-13 19:17:59,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:59,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,918 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-13 19:17:59,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:59,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,933 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-13 19:17:59,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:25 [2019-10-13 19:17:59,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,965 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-13 19:17:59,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:59,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:59,967 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-13 19:17:59,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-13 19:17:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:18:00,013 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-13 19:18:00,014 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:18:00,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2019-10-13 19:18:00,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125719103] [2019-10-13 19:18:00,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 19:18:00,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:18:00,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 19:18:00,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:18:00,015 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 27 states. [2019-10-13 19:18:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:18:01,719 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2019-10-13 19:18:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 19:18:01,719 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-10-13 19:18:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:18:01,722 INFO L225 Difference]: With dead ends: 178 [2019-10-13 19:18:01,722 INFO L226 Difference]: Without dead ends: 176 [2019-10-13 19:18:01,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=316, Invalid=2134, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 19:18:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-13 19:18:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 93. [2019-10-13 19:18:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 19:18:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2019-10-13 19:18:01,738 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 34 [2019-10-13 19:18:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:18:01,738 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2019-10-13 19:18:01,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 19:18:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2019-10-13 19:18:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:18:01,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:18:01,739 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-13 19:18:01,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:18:01,952 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:18:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:18:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash -101781095, now seen corresponding path program 3 times [2019-10-13 19:18:01,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:18:01,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781471428] [2019-10-13 19:18:01,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:01,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:01,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:18:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:02,417 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-13 19:18:02,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781471428] [2019-10-13 19:18:02,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099227012] [2019-10-13 19:18:02,417 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-13 19:18:02,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 19:18:02,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:18:02,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-13 19:18:02,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:18:02,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:18:02,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:18:02,682 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-13 19:18:02,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:18:02,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:18:02,695 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-13 19:18:02,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30