java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/skipped.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:50:42,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:42,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:42,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:42,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:42,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:42,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:42,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:42,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:42,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:42,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:42,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:42,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:42,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:42,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:42,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:42,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:42,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:42,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:42,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:42,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:42,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:42,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:42,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:42,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:42,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:42,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:42,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:42,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:42,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:42,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:42,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:42,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:42,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:42,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:42,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:42,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:42,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:42,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:42,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:42,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:42,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 21:50:42,749 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:42,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:42,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:42,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:42,753 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:42,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:42,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:42,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:42,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:42,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:42,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:42,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:42,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:42,756 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:42,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:42,757 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:42,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:42,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:42,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:42,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:42,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:42,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:42,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:42,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:42,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:42,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:42,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:42,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:42,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:43,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:43,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:43,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:43,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:43,046 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:43,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/skipped.c [2019-10-14 21:50:43,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433fe2a75/b7aa819a7da24c8a99fdcd91220c21fa/FLAGc7acec7f0 [2019-10-14 21:50:43,577 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:43,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skipped.c [2019-10-14 21:50:43,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433fe2a75/b7aa819a7da24c8a99fdcd91220c21fa/FLAGc7acec7f0 [2019-10-14 21:50:43,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433fe2a75/b7aa819a7da24c8a99fdcd91220c21fa [2019-10-14 21:50:43,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:43,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:43,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:43,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:43,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:43,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:43" (1/1) ... [2019-10-14 21:50:44,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7492c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:43, skipping insertion in model container [2019-10-14 21:50:44,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:43" (1/1) ... [2019-10-14 21:50:44,008 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:44,028 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:44,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:44,202 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:44,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:44,235 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:44,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44 WrapperNode [2019-10-14 21:50:44,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:44,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:44,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:44,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:44,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (1/1) ... [2019-10-14 21:50:44,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (1/1) ... [2019-10-14 21:50:44,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (1/1) ... [2019-10-14 21:50:44,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (1/1) ... [2019-10-14 21:50:44,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (1/1) ... [2019-10-14 21:50:44,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (1/1) ... [2019-10-14 21:50:44,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (1/1) ... [2019-10-14 21:50:44,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:44,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:44,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:44,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:44,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:44,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:44,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:44,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:44,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 21:50:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 21:50:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:44,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:44,697 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:44,697 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 21:50:44,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:44 BoogieIcfgContainer [2019-10-14 21:50:44,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:44,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:44,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:44,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:44,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:43" (1/3) ... [2019-10-14 21:50:44,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7648165d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:44, skipping insertion in model container [2019-10-14 21:50:44,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:44" (2/3) ... [2019-10-14 21:50:44,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7648165d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:44, skipping insertion in model container [2019-10-14 21:50:44,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:44" (3/3) ... [2019-10-14 21:50:44,707 INFO L109 eAbstractionObserver]: Analyzing ICFG skipped.c [2019-10-14 21:50:44,717 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:44,724 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:44,736 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:44,763 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:44,763 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:44,763 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:44,763 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:44,763 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:44,764 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:44,764 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:44,764 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 21:50:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:44,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:44,788 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:44,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash -446282704, now seen corresponding path program 1 times [2019-10-14 21:50:44,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:44,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020346152] [2019-10-14 21:50:44,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:44,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:44,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:45,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020346152] [2019-10-14 21:50:45,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:45,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 21:50:45,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713270541] [2019-10-14 21:50:45,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:50:45,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:45,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:50:45,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:45,038 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-10-14 21:50:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:45,146 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-10-14 21:50:45,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:50:45,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-14 21:50:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:45,158 INFO L225 Difference]: With dead ends: 53 [2019-10-14 21:50:45,158 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 21:50:45,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 21:50:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-14 21:50:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 21:50:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-14 21:50:45,203 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-10-14 21:50:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:45,204 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-14 21:50:45,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:50:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-14 21:50:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:45,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:45,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:45,206 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1281654888, now seen corresponding path program 1 times [2019-10-14 21:50:45,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:45,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532572897] [2019-10-14 21:50:45,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:45,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:45,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:45,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532572897] [2019-10-14 21:50:45,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:45,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:45,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001250783] [2019-10-14 21:50:45,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:45,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:45,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:45,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:45,352 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2019-10-14 21:50:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:45,462 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-10-14 21:50:45,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:45,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-14 21:50:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:45,464 INFO L225 Difference]: With dead ends: 45 [2019-10-14 21:50:45,464 INFO L226 Difference]: Without dead ends: 28 [2019-10-14 21:50:45,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-14 21:50:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-14 21:50:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 21:50:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-14 21:50:45,473 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2019-10-14 21:50:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:45,473 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-14 21:50:45,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-14 21:50:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 21:50:45,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:45,475 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:45,475 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:45,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1237885334, now seen corresponding path program 1 times [2019-10-14 21:50:45,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:45,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036798868] [2019-10-14 21:50:45,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:45,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:45,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:45,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036798868] [2019-10-14 21:50:45,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:45,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:45,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212881339] [2019-10-14 21:50:45,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:45,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:45,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:45,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:45,584 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 5 states. [2019-10-14 21:50:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:45,752 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-10-14 21:50:45,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:45,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-14 21:50:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:45,755 INFO L225 Difference]: With dead ends: 43 [2019-10-14 21:50:45,755 INFO L226 Difference]: Without dead ends: 32 [2019-10-14 21:50:45,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-14 21:50:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-10-14 21:50:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-14 21:50:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-14 21:50:45,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-10-14 21:50:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:45,769 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-14 21:50:45,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-14 21:50:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 21:50:45,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:45,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:45,771 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1565802059, now seen corresponding path program 1 times [2019-10-14 21:50:45,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:45,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923777583] [2019-10-14 21:50:45,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:45,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:45,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:45,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923777583] [2019-10-14 21:50:45,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983306687] [2019-10-14 21:50:45,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:45,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:50:45,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:46,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:46,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-14 21:50:46,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830289636] [2019-10-14 21:50:46,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 21:50:46,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:46,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 21:50:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:50:46,037 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-10-14 21:50:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:46,129 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-10-14 21:50:46,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:46,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-14 21:50:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:46,131 INFO L225 Difference]: With dead ends: 49 [2019-10-14 21:50:46,131 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:50:46,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:50:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:50:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 21:50:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:50:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 21:50:46,138 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-10-14 21:50:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:46,139 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 21:50:46,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 21:50:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 21:50:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:50:46,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:46,140 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:46,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:46,346 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1209140727, now seen corresponding path program 2 times [2019-10-14 21:50:46,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:46,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167348539] [2019-10-14 21:50:46,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:46,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:46,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:47,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167348539] [2019-10-14 21:50:47,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847779953] [2019-10-14 21:50:47,225 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:47,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:47,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:47,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-14 21:50:47,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:47,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-10-14 21:50:47,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-10-14 21:50:47,415 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-10-14 21:50:47,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2019-10-14 21:50:47,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,441 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2019-10-14 21:50:47,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:47,523 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:47,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-10-14 21:50:47,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-10-14 21:50:47,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:47,617 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:47,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2019-10-14 21:50:47,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513763832] [2019-10-14 21:50:47,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:50:47,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:47,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:50:47,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:50:47,621 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 22 states. [2019-10-14 21:50:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:49,424 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2019-10-14 21:50:49,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-14 21:50:49,425 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-10-14 21:50:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:49,430 INFO L225 Difference]: With dead ends: 167 [2019-10-14 21:50:49,431 INFO L226 Difference]: Without dead ends: 165 [2019-10-14 21:50:49,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=379, Invalid=1783, Unknown=0, NotChecked=0, Total=2162 [2019-10-14 21:50:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-14 21:50:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 43. [2019-10-14 21:50:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 21:50:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-10-14 21:50:49,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 25 [2019-10-14 21:50:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:49,455 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-10-14 21:50:49,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:50:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-10-14 21:50:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:50:49,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:49,456 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:49,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:49,661 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1910205305, now seen corresponding path program 1 times [2019-10-14 21:50:49,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:49,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103121066] [2019-10-14 21:50:49,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:50,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103121066] [2019-10-14 21:50:50,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463676253] [2019-10-14 21:50:50,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 21:50:50,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:50,177 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-14 21:50:50,178 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 21 treesize of output 20 [2019-10-14 21:50:50,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-10-14 21:50:50,256 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-10-14 21:50:50,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2019-10-14 21:50:50,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:50,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:50,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:50,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:50:50,274 INFO L567 ElimStorePlain]: treesize reduction 35, result has 16.7 percent of original size [2019-10-14 21:50:50,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-10-14 21:50:50,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:50,308 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:50,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2019-10-14 21:50:50,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42927411] [2019-10-14 21:50:50,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:50:50,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:50:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:50:50,309 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 22 states. [2019-10-14 21:50:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:51,588 INFO L93 Difference]: Finished difference Result 153 states and 195 transitions. [2019-10-14 21:50:51,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-14 21:50:51,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-10-14 21:50:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:51,592 INFO L225 Difference]: With dead ends: 153 [2019-10-14 21:50:51,592 INFO L226 Difference]: Without dead ends: 151 [2019-10-14 21:50:51,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1398, Unknown=0, NotChecked=0, Total=1640 [2019-10-14 21:50:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-14 21:50:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 49. [2019-10-14 21:50:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-14 21:50:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-10-14 21:50:51,609 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 25 [2019-10-14 21:50:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:51,610 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-10-14 21:50:51,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:50:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-10-14 21:50:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 21:50:51,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:51,611 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:51,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:51,815 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2135590205, now seen corresponding path program 1 times [2019-10-14 21:50:51,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:51,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779172452] [2019-10-14 21:50:51,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:52,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779172452] [2019-10-14 21:50:52,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248544425] [2019-10-14 21:50:52,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 21:50:52,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:52,259 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:52,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-10-14 21:50:52,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039745287] [2019-10-14 21:50:52,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 21:50:52,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:52,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 21:50:52,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-14 21:50:52,261 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 15 states. [2019-10-14 21:50:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:52,872 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2019-10-14 21:50:52,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:50:52,873 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-14 21:50:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:52,875 INFO L225 Difference]: With dead ends: 114 [2019-10-14 21:50:52,875 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 21:50:52,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:50:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 21:50:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 54. [2019-10-14 21:50:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 21:50:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2019-10-14 21:50:52,886 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 27 [2019-10-14 21:50:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:52,886 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2019-10-14 21:50:52,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 21:50:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2019-10-14 21:50:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 21:50:52,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:52,888 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:53,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:53,096 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash 785976942, now seen corresponding path program 1 times [2019-10-14 21:50:53,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:53,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555199820] [2019-10-14 21:50:53,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:53,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:53,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:53,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555199820] [2019-10-14 21:50:53,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687443325] [2019-10-14 21:50:53,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:53,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 21:50:53,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:53,490 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:53,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2019-10-14 21:50:53,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363170530] [2019-10-14 21:50:53,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 21:50:53,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 21:50:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:50:53,495 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 14 states. [2019-10-14 21:50:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:53,859 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-10-14 21:50:53,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:50:53,860 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-14 21:50:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:53,862 INFO L225 Difference]: With dead ends: 126 [2019-10-14 21:50:53,862 INFO L226 Difference]: Without dead ends: 87 [2019-10-14 21:50:53,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:50:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-14 21:50:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 62. [2019-10-14 21:50:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-14 21:50:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-10-14 21:50:53,876 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 32 [2019-10-14 21:50:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:53,876 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-10-14 21:50:53,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 21:50:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-10-14 21:50:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 21:50:53,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:53,878 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:54,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:54,082 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash -466196341, now seen corresponding path program 1 times [2019-10-14 21:50:54,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:54,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337019207] [2019-10-14 21:50:54,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:54,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:54,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337019207] [2019-10-14 21:50:54,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198257525] [2019-10-14 21:50:54,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 21:50:54,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:54,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-10-14 21:50:54,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:54,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:54,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:54,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-10-14 21:50:56,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-10-14 21:50:56,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:56,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:50:56,465 INFO L567 ElimStorePlain]: treesize reduction 14, result has 33.3 percent of original size [2019-10-14 21:50:56,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-10-14 21:50:56,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:56,515 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:56,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2019-10-14 21:50:56,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815095019] [2019-10-14 21:50:56,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:56,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=199, Unknown=1, NotChecked=0, Total=240 [2019-10-14 21:50:56,517 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 16 states. [2019-10-14 21:50:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:57,012 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2019-10-14 21:50:57,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 21:50:57,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-10-14 21:50:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:57,014 INFO L225 Difference]: With dead ends: 108 [2019-10-14 21:50:57,015 INFO L226 Difference]: Without dead ends: 106 [2019-10-14 21:50:57,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=83, Invalid=378, Unknown=1, NotChecked=0, Total=462 [2019-10-14 21:50:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-14 21:50:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2019-10-14 21:50:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-14 21:50:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2019-10-14 21:50:57,029 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 33 [2019-10-14 21:50:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:57,029 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2019-10-14 21:50:57,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2019-10-14 21:50:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 21:50:57,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:57,031 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:57,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:57,235 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2054544243, now seen corresponding path program 1 times [2019-10-14 21:50:57,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:57,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960585241] [2019-10-14 21:50:57,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:57,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:57,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:57,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960585241] [2019-10-14 21:50:57,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348360213] [2019-10-14 21:50:57,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:57,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-14 21:50:57,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:59,708 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:59,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-10-14 21:50:59,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:50:59,720 INFO L567 ElimStorePlain]: treesize reduction 14, result has 33.3 percent of original size [2019-10-14 21:50:59,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-10-14 21:50:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:59,791 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:59,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 22 [2019-10-14 21:50:59,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727725545] [2019-10-14 21:50:59,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:50:59,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:50:59,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=402, Unknown=1, NotChecked=0, Total=462 [2019-10-14 21:50:59,793 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 22 states. [2019-10-14 21:51:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:02,908 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2019-10-14 21:51:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:51:02,909 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-10-14 21:51:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:02,911 INFO L225 Difference]: With dead ends: 159 [2019-10-14 21:51:02,911 INFO L226 Difference]: Without dead ends: 157 [2019-10-14 21:51:02,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=251, Invalid=1470, Unknown=1, NotChecked=0, Total=1722 [2019-10-14 21:51:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-14 21:51:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 95. [2019-10-14 21:51:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-14 21:51:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2019-10-14 21:51:02,948 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 33 [2019-10-14 21:51:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:02,949 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-10-14 21:51:02,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:51:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2019-10-14 21:51:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 21:51:02,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:02,954 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:03,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:03,158 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:03,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1188137876, now seen corresponding path program 2 times [2019-10-14 21:51:03,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:03,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707356698] [2019-10-14 21:51:03,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:03,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:03,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:51:03,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707356698] [2019-10-14 21:51:03,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702027694] [2019-10-14 21:51:03,769 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:03,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:51:03,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:03,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-14 21:51:03,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:03,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:03,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-10-14 21:51:03,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:03,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:03,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:03,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-10-14 21:51:04,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:04,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:04,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:04,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:04,039 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 44 treesize of output 46 [2019-10-14 21:51:04,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:04,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:04,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:51:04,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-10-14 21:51:04,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:04,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:51:04,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:04,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:04,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:04,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 24 [2019-10-14 21:51:04,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:04,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:04,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:04,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:7 [2019-10-14 21:51:04,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-14 21:51:04,209 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:04,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 29 [2019-10-14 21:51:04,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421174581] [2019-10-14 21:51:04,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-14 21:51:04,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-14 21:51:04,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-10-14 21:51:04,211 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 29 states. [2019-10-14 21:51:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:08,151 INFO L93 Difference]: Finished difference Result 362 states and 469 transitions. [2019-10-14 21:51:08,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-14 21:51:08,152 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2019-10-14 21:51:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:08,156 INFO L225 Difference]: With dead ends: 362 [2019-10-14 21:51:08,157 INFO L226 Difference]: Without dead ends: 360 [2019-10-14 21:51:08,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2019-10-14 21:51:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-14 21:51:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 60. [2019-10-14 21:51:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 21:51:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-10-14 21:51:08,178 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 34 [2019-10-14 21:51:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:08,179 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-10-14 21:51:08,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-14 21:51:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-10-14 21:51:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 21:51:08,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:08,180 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:08,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:08,387 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash 107542303, now seen corresponding path program 2 times [2019-10-14 21:51:08,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:08,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288477992] [2019-10-14 21:51:08,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:08,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:08,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 21:51:08,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288477992] [2019-10-14 21:51:08,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781874811] [2019-10-14 21:51:08,468 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:08,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:51:08,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:08,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 21:51:08,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 21:51:08,608 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:08,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-10-14 21:51:08,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920999793] [2019-10-14 21:51:08,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 21:51:08,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 21:51:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:51:08,610 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 14 states. [2019-10-14 21:51:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:08,931 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2019-10-14 21:51:08,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:51:08,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2019-10-14 21:51:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:08,933 INFO L225 Difference]: With dead ends: 98 [2019-10-14 21:51:08,933 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 21:51:08,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:51:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 21:51:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2019-10-14 21:51:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 21:51:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-10-14 21:51:08,959 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 41 [2019-10-14 21:51:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:08,960 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-10-14 21:51:08,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 21:51:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-10-14 21:51:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 21:51:08,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:08,964 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:09,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:09,165 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:09,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1999502184, now seen corresponding path program 3 times [2019-10-14 21:51:09,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:09,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169712146] [2019-10-14 21:51:09,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:09,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:09,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 21:51:09,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169712146] [2019-10-14 21:51:09,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505975902] [2019-10-14 21:51:09,359 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:09,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 21:51:09,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:09,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-14 21:51:09,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:09,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-10-14 21:51:09,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:09,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:09,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:09,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-10-14 21:51:09,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:09,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-10-14 21:51:09,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:09,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:09,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:09,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-10-14 21:51:09,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:51:09,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:09,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:09,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-10-14 21:51:09,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:09,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:09,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:09,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-10-14 21:51:09,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 21:51:09,918 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:09,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-10-14 21:51:09,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097163673] [2019-10-14 21:51:09,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 21:51:09,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 21:51:09,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2019-10-14 21:51:09,920 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 26 states. [2019-10-14 21:51:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:11,124 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2019-10-14 21:51:11,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:51:11,124 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-10-14 21:51:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:11,126 INFO L225 Difference]: With dead ends: 153 [2019-10-14 21:51:11,126 INFO L226 Difference]: Without dead ends: 151 [2019-10-14 21:51:11,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=1717, Unknown=0, NotChecked=0, Total=1980 [2019-10-14 21:51:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-14 21:51:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2019-10-14 21:51:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-14 21:51:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2019-10-14 21:51:11,148 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 50 [2019-10-14 21:51:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:11,149 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2019-10-14 21:51:11,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-14 21:51:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2019-10-14 21:51:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 21:51:11,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:11,150 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:11,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:11,354 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash -76274150, now seen corresponding path program 1 times [2019-10-14 21:51:11,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:11,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480392596] [2019-10-14 21:51:11,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:11,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:11,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:51:11,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480392596] [2019-10-14 21:51:11,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856156501] [2019-10-14 21:51:11,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:11,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 21:51:11,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:11,722 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-14 21:51:11,723 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 23 treesize of output 22 [2019-10-14 21:51:11,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:11,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:51:11,956 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-10-14 21:51:11,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-10-14 21:51:11,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:11,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:11,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:11,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:51:11,973 INFO L567 ElimStorePlain]: treesize reduction 37, result has 15.9 percent of original size [2019-10-14 21:51:11,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2019-10-14 21:51:11,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 21:51:12,036 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:12,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2019-10-14 21:51:12,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292363649] [2019-10-14 21:51:12,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 21:51:12,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 21:51:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:51:12,037 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 24 states. [2019-10-14 21:51:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:13,192 INFO L93 Difference]: Finished difference Result 200 states and 236 transitions. [2019-10-14 21:51:13,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-14 21:51:13,193 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-10-14 21:51:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:13,196 INFO L225 Difference]: With dead ends: 200 [2019-10-14 21:51:13,196 INFO L226 Difference]: Without dead ends: 198 [2019-10-14 21:51:13,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2019-10-14 21:51:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-14 21:51:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 96. [2019-10-14 21:51:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-14 21:51:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-10-14 21:51:13,216 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 50 [2019-10-14 21:51:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:13,216 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-10-14 21:51:13,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 21:51:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-10-14 21:51:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 21:51:13,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:13,218 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:51:13,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:13,423 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash 382840366, now seen corresponding path program 1 times [2019-10-14 21:51:13,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:13,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793037529] [2019-10-14 21:51:13,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:13,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:13,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:51:13,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793037529] [2019-10-14 21:51:13,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264627140] [2019-10-14 21:51:13,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:14,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 21:51:14,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:21,750 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:21,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-10-14 21:51:21,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:21,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 21:51:21,761 INFO L567 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-10-14 21:51:21,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:21,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2019-10-14 21:51:21,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-14 21:51:21,830 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:21,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 31 [2019-10-14 21:51:21,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168770338] [2019-10-14 21:51:21,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-14 21:51:21,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-14 21:51:21,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=837, Unknown=1, NotChecked=0, Total=930 [2019-10-14 21:51:21,832 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 31 states.