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/pnr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:25:40,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:25:40,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:25:40,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:25:40,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:25:40,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:25:40,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:25:40,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:25:40,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:25:40,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:25:40,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:25:40,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:25:40,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:25:40,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:25:40,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:25:40,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:25:40,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:25:40,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:25:40,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:25:40,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:25:40,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:25:40,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:25:40,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:25:40,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:25:40,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:25:40,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:25:40,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:25:40,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:25:40,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:25:40,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:25:40,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:25:40,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:25:40,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:25:40,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:25:40,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:25:40,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:25:40,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:25:40,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:25:40,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:25:40,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:25:40,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:25:40,938 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-02 00:25:40,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:25:40,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:25:40,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:25:40,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:25:40,956 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:25:40,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:25:40,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:25:40,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:25:40,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:25:40,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:25:40,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:25:40,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:25:40,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:25:40,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:25:40,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:25:40,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:25:40,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:25:40,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:25:40,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:25:40,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:25:40,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:25:40,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:25:40,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:25:40,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:25:40,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:25:40,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:25:40,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:25:40,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:25:40,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:25:41,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:25:41,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:25:41,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:25:41,028 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:25:41,028 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:25:41,029 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr2.c [2019-10-02 00:25:41,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbd2a1bb/9a5838fe1bc6448c9960937a7d62074f/FLAGef9cf9109 [2019-10-02 00:25:41,563 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:25:41,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr2.c [2019-10-02 00:25:41,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbd2a1bb/9a5838fe1bc6448c9960937a7d62074f/FLAGef9cf9109 [2019-10-02 00:25:41,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbd2a1bb/9a5838fe1bc6448c9960937a7d62074f [2019-10-02 00:25:41,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:25:41,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:25:41,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:25:41,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:25:41,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:25:41,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:25:41" (1/1) ... [2019-10-02 00:25:41,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6758b41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:41, skipping insertion in model container [2019-10-02 00:25:41,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:25:41" (1/1) ... [2019-10-02 00:25:41,920 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:25:41,940 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:25:42,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:25:42,159 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:25:42,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:25:42,291 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:25:42,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42 WrapperNode [2019-10-02 00:25:42,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:25:42,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:25:42,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:25:42,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:25:42,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (1/1) ... [2019-10-02 00:25:42,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (1/1) ... [2019-10-02 00:25:42,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (1/1) ... [2019-10-02 00:25:42,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (1/1) ... [2019-10-02 00:25:42,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (1/1) ... [2019-10-02 00:25:42,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (1/1) ... [2019-10-02 00:25:42,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (1/1) ... [2019-10-02 00:25:42,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:25:42,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:25:42,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:25:42,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:25:42,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (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-02 00:25:42,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:25:42,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:25:42,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 00:25:42,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2019-10-02 00:25:42,387 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:25:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:25:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 00:25:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 00:25:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:25:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 00:25:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2019-10-02 00:25:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:25:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 00:25:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 00:25:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 00:25:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:25:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:25:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 00:25:42,683 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:25:42,684 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 00:25:42,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:25:42 BoogieIcfgContainer [2019-10-02 00:25:42,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:25:42,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:25:42,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:25:42,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:25:42,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:25:41" (1/3) ... [2019-10-02 00:25:42,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e44b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:25:42, skipping insertion in model container [2019-10-02 00:25:42,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:25:42" (2/3) ... [2019-10-02 00:25:42,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e44b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:25:42, skipping insertion in model container [2019-10-02 00:25:42,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:25:42" (3/3) ... [2019-10-02 00:25:42,696 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr2.c [2019-10-02 00:25:42,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:25:42,725 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:25:42,744 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:25:42,783 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:25:42,785 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:25:42,785 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:25:42,785 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:25:42,785 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:25:42,785 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:25:42,786 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:25:42,786 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:25:42,786 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:25:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-02 00:25:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 00:25:42,815 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:42,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:42,818 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1000705867, now seen corresponding path program 1 times [2019-10-02 00:25:42,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:42,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:42,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:42,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:42,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:43,011 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-02 00:25:43,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:25:43,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 00:25:43,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 00:25:43,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 00:25:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:25:43,035 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-02 00:25:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:43,073 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-10-02 00:25:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 00:25:43,075 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-02 00:25:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:43,090 INFO L225 Difference]: With dead ends: 51 [2019-10-02 00:25:43,091 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 00:25:43,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:25:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 00:25:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-02 00:25:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 00:25:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-02 00:25:43,156 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2019-10-02 00:25:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:43,157 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-02 00:25:43,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 00:25:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-02 00:25:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 00:25:43,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:43,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:43,160 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:43,161 INFO L82 PathProgramCache]: Analyzing trace with hash -457002250, now seen corresponding path program 1 times [2019-10-02 00:25:43,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:43,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:43,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:43,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:43,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:43,303 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-02 00:25:43,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:25:43,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:25:43,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:25:43,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:25:43,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:25:43,309 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-10-02 00:25:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:43,439 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-10-02 00:25:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:25:43,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-02 00:25:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:43,442 INFO L225 Difference]: With dead ends: 49 [2019-10-02 00:25:43,442 INFO L226 Difference]: Without dead ends: 38 [2019-10-02 00:25:43,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:25:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-02 00:25:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-10-02 00:25:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 00:25:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-02 00:25:43,456 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-10-02 00:25:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:43,456 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-02 00:25:43,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:25:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-02 00:25:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 00:25:43,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:43,458 INFO L411 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, 1, 1, 1, 1] [2019-10-02 00:25:43,458 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1020388245, now seen corresponding path program 1 times [2019-10-02 00:25:43,459 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:43,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:43,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:43,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:43,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:44,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:44,133 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:44,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:44,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 00:25:44,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:44,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:25:44,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:44,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:44,343 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-02 00:25:44,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-10-02 00:25:44,410 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-02 00:25:44,411 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 22 treesize of output 21 [2019-10-02 00:25:44,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:44,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:44,419 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-02 00:25:44,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-10-02 00:25:44,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 00:25:44,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:44,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:44,471 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-02 00:25:44,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-10-02 00:25:44,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:44,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:44,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-10-02 00:25:44,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 00:25:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 00:25:44,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-10-02 00:25:44,521 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 17 states. [2019-10-02 00:25:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:44,988 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2019-10-02 00:25:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 00:25:44,989 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-10-02 00:25:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:44,991 INFO L225 Difference]: With dead ends: 69 [2019-10-02 00:25:44,991 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 00:25:44,992 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-10-02 00:25:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 00:25:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2019-10-02 00:25:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 00:25:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-10-02 00:25:45,005 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 29 [2019-10-02 00:25:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:45,005 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-10-02 00:25:45,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 00:25:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-10-02 00:25:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 00:25:45,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:45,007 INFO L411 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, 1, 1, 1, 1] [2019-10-02 00:25:45,007 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1994715373, now seen corresponding path program 1 times [2019-10-02 00:25:45,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:45,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:45,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:45,574 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:45,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:45,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 00:25:45,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:45,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:25:45,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:45,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:45,694 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-02 00:25:45,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:25:45,787 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-02 00:25:45,788 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-02 00:25:45,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:45,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:45,796 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-02 00:25:45,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-10-02 00:25:45,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:25:45,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:45,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:45,870 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-02 00:25:45,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-10-02 00:25:45,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:25:45,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:45,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-02 00:25:45,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:25:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:25:45,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:25:45,935 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 20 states. [2019-10-02 00:25:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:49,298 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2019-10-02 00:25:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 00:25:49,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-10-02 00:25:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:49,307 INFO L225 Difference]: With dead ends: 139 [2019-10-02 00:25:49,307 INFO L226 Difference]: Without dead ends: 137 [2019-10-02 00:25:49,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 00:25:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-02 00:25:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 37. [2019-10-02 00:25:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-02 00:25:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-02 00:25:49,327 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 29 [2019-10-02 00:25:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:49,327 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-02 00:25:49,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:25:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-02 00:25:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 00:25:49,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:49,329 INFO L411 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, 1, 1, 1, 1] [2019-10-02 00:25:49,329 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 552081240, now seen corresponding path program 1 times [2019-10-02 00:25:49,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:49,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:49,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:49,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:49,431 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:49,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:49,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 00:25:49,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:49,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-02 00:25:49,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:49,503 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-02 00:25:49,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-10-02 00:25:49,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-10-02 00:25:49,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:49,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:49,532 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-02 00:25:49,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-10-02 00:25:49,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:49,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:49,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-02 00:25:49,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 00:25:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 00:25:49,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 00:25:49,562 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2019-10-02 00:25:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:49,807 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2019-10-02 00:25:49,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 00:25:49,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-10-02 00:25:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:49,811 INFO L225 Difference]: With dead ends: 72 [2019-10-02 00:25:49,811 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 00:25:49,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:25:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 00:25:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2019-10-02 00:25:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-02 00:25:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-10-02 00:25:49,825 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 37 [2019-10-02 00:25:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:49,826 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-10-02 00:25:49,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 00:25:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-10-02 00:25:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 00:25:49,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:49,827 INFO L411 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, 1, 1, 1, 1] [2019-10-02 00:25:49,828 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1036266662, now seen corresponding path program 1 times [2019-10-02 00:25:49,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:49,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:49,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:49,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:49,956 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:50,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 00:25:50,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:50,073 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 13 treesize of output 9 [2019-10-02 00:25:50,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:50,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:50,080 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-02 00:25:50,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:25:50,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:25:50,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:50,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:50,186 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-02 00:25:50,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:25:50,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 00:25:50,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:50,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-02 00:25:50,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:25:50,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:25:50,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:25:50,246 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 20 states. [2019-10-02 00:25:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:57,042 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2019-10-02 00:25:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 00:25:57,043 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-10-02 00:25:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:57,045 INFO L225 Difference]: With dead ends: 114 [2019-10-02 00:25:57,045 INFO L226 Difference]: Without dead ends: 112 [2019-10-02 00:25:57,046 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:25:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-02 00:25:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 45. [2019-10-02 00:25:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 00:25:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-02 00:25:57,057 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 37 [2019-10-02 00:25:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:57,057 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-02 00:25:57,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:25:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-02 00:25:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 00:25:57,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:57,059 INFO L411 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, 1, 1, 1, 1] [2019-10-02 00:25:57,059 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash -849160891, now seen corresponding path program 2 times [2019-10-02 00:25:57,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:57,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:57,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 00:25:57,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:57,349 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:25:57,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:57,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:25:57,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:25:57,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 00:25:57,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:57,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:25:57,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:57,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 00:25:57,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:57,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-10-02 00:25:57,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 00:25:57,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 00:25:57,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-10-02 00:25:57,635 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 16 states. [2019-10-02 00:25:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:58,013 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-10-02 00:25:58,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 00:25:58,015 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-10-02 00:25:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:58,016 INFO L225 Difference]: With dead ends: 90 [2019-10-02 00:25:58,016 INFO L226 Difference]: Without dead ends: 62 [2019-10-02 00:25:58,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:25:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-02 00:25:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2019-10-02 00:25:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 00:25:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-10-02 00:25:58,039 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 45 [2019-10-02 00:25:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:58,040 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-10-02 00:25:58,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 00:25:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-10-02 00:25:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 00:25:58,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:58,044 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:58,044 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash -418118662, now seen corresponding path program 3 times [2019-10-02 00:25:58,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:58,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:58,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:58,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:25:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 00:25:58,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:58,233 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:25:58,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 00:25:58,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:25:58,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 00:25:58,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:58,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:25:58,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:58,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:58,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:58,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-10-02 00:25:58,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:25:58,453 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 24 treesize of output 23 [2019-10-02 00:25:58,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:58,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:58,462 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-02 00:25:58,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-10-02 00:25:58,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 00:25:58,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:58,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:58,661 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-02 00:25:58,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-10-02 00:25:58,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:25:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 00:25:58,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:58,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-10-02 00:25:58,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 00:25:58,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 00:25:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:25:58,720 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 23 states. [2019-10-02 00:26:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:25,210 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2019-10-02 00:26:25,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:26:25,211 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2019-10-02 00:26:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:25,212 INFO L225 Difference]: With dead ends: 133 [2019-10-02 00:26:25,213 INFO L226 Difference]: Without dead ends: 131 [2019-10-02 00:26:25,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2019-10-02 00:26:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-02 00:26:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 74. [2019-10-02 00:26:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-02 00:26:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-10-02 00:26:25,227 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 59 [2019-10-02 00:26:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:25,228 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-10-02 00:26:25,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 00:26:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-10-02 00:26:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 00:26:25,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:25,229 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:25,230 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 283481212, now seen corresponding path program 1 times [2019-10-02 00:26:25,230 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:25,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:25,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:25,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:26:25,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 00:26:25,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:25,468 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:25,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 00:26:25,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:25,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:26:25,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:25,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:25,637 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-02 00:26:25,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:26:25,720 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:26:25,720 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-02 00:26:25,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:25,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:25,728 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-02 00:26:25,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:26:25,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:26:25,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:25,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:25,932 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-02 00:26:25,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:26:25,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 00:26:26,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:26,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-10-02 00:26:26,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 00:26:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 00:26:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-10-02 00:26:26,012 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 24 states. [2019-10-02 00:26:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:42,471 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2019-10-02 00:26:42,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 00:26:42,472 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2019-10-02 00:26:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:42,475 INFO L225 Difference]: With dead ends: 174 [2019-10-02 00:26:42,476 INFO L226 Difference]: Without dead ends: 172 [2019-10-02 00:26:42,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 00:26:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-02 00:26:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2019-10-02 00:26:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-02 00:26:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2019-10-02 00:26:42,510 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 59 [2019-10-02 00:26:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:42,510 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2019-10-02 00:26:42,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 00:26:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2019-10-02 00:26:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 00:26:42,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:42,519 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-10-02 00:26:42,520 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash 573636583, now seen corresponding path program 4 times [2019-10-02 00:26:42,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:42,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:42,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:42,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:42,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:42,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:42,681 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:42,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:26:42,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:26:42,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:26:42,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 00:26:42,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:42,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:26:42,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:42,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:42,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:26:42,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-10-02 00:26:42,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:42,855 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 25 treesize of output 25 [2019-10-02 00:26:42,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:42,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:26:42,866 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-10-02 00:26:42,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:26:42,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-10-02 00:26:42,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:42,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2019-10-02 00:26:42,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 00:26:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 00:26:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-02 00:26:42,907 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand 17 states. [2019-10-02 00:26:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:43,743 INFO L93 Difference]: Finished difference Result 256 states and 343 transitions. [2019-10-02 00:26:43,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 00:26:43,743 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-10-02 00:26:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:43,746 INFO L225 Difference]: With dead ends: 256 [2019-10-02 00:26:43,746 INFO L226 Difference]: Without dead ends: 254 [2019-10-02 00:26:43,747 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:26:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-02 00:26:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 182. [2019-10-02 00:26:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-02 00:26:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2019-10-02 00:26:43,782 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 67 [2019-10-02 00:26:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:43,783 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2019-10-02 00:26:43,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 00:26:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2019-10-02 00:26:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 00:26:43,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:43,785 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-10-02 00:26:43,785 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 501250025, now seen corresponding path program 1 times [2019-10-02 00:26:43,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:43,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:43,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:43,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:26:43,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:44,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:44,012 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:44,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:44,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 00:26:44,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:44,154 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 13 treesize of output 9 [2019-10-02 00:26:44,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:44,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:44,160 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-02 00:26:44,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:26:44,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:26:44,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:44,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:44,437 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-02 00:26:44,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:26:44,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:26:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 00:26:44,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:26:44,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-10-02 00:26:44,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 00:26:44,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 00:26:44,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-10-02 00:26:44,518 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand 26 states. [2019-10-02 00:27:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:27:00,588 INFO L93 Difference]: Finished difference Result 344 states and 441 transitions. [2019-10-02 00:27:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 00:27:00,589 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2019-10-02 00:27:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:27:00,591 INFO L225 Difference]: With dead ends: 344 [2019-10-02 00:27:00,591 INFO L226 Difference]: Without dead ends: 342 [2019-10-02 00:27:00,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=380, Invalid=2376, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 00:27:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-02 00:27:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 164. [2019-10-02 00:27:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 00:27:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 208 transitions. [2019-10-02 00:27:00,620 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 208 transitions. Word has length 67 [2019-10-02 00:27:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:27:00,620 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 208 transitions. [2019-10-02 00:27:00,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 00:27:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 208 transitions. [2019-10-02 00:27:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 00:27:00,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:27:00,622 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:27:00,622 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:27:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:27:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash -578961708, now seen corresponding path program 5 times [2019-10-02 00:27:00,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:27:00,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:27:00,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:27:00,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:27:00,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:27:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:27:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 00:27:01,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:27:01,008 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:27:01,039 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:27:01,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 00:27:01,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:27:01,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 00:27:01,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:27:01,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:27:01,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:27:01,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:27:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 00:27:01,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:27:01,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-10-02 00:27:01,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:27:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:27:01,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:27:01,367 INFO L87 Difference]: Start difference. First operand 164 states and 208 transitions. Second operand 22 states. [2019-10-02 00:27:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:27:01,935 INFO L93 Difference]: Finished difference Result 245 states and 301 transitions. [2019-10-02 00:27:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 00:27:01,937 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2019-10-02 00:27:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:27:01,939 INFO L225 Difference]: With dead ends: 245 [2019-10-02 00:27:01,939 INFO L226 Difference]: Without dead ends: 186 [2019-10-02 00:27:01,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:27:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-02 00:27:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-10-02 00:27:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-02 00:27:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 210 transitions. [2019-10-02 00:27:01,963 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 210 transitions. Word has length 75 [2019-10-02 00:27:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:27:01,964 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 210 transitions. [2019-10-02 00:27:01,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:27:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 210 transitions. [2019-10-02 00:27:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 00:27:01,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:27:01,966 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:27:01,966 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:27:01,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:27:01,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1207960265, now seen corresponding path program 6 times [2019-10-02 00:27:01,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:27:01,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:27:01,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:27:01,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:27:01,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:27:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:27:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 00:27:02,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:27:02,159 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:27:02,204 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:27:02,264 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-02 00:27:02,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:27:02,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 00:27:02,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:27:02,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:27:02,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:02,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:02,342 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-02 00:27:02,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-02 00:27:02,572 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:27:02,573 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 24 treesize of output 23 [2019-10-02 00:27:02,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:02,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:02,579 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-02 00:27:02,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-10-02 00:27:04,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-10-02 00:27:04,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:27:04,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:27:04,136 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-02 00:27:04,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-10-02 00:27:04,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:27:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 67 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 00:27:04,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:27:04,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-10-02 00:27:04,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 00:27:04,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 00:27:04,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-10-02 00:27:04,217 INFO L87 Difference]: Start difference. First operand 168 states and 210 transitions. Second operand 29 states. [2019-10-02 00:29:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:41,739 INFO L93 Difference]: Finished difference Result 510 states and 695 transitions. [2019-10-02 00:29:41,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 00:29:41,741 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2019-10-02 00:29:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:41,750 INFO L225 Difference]: With dead ends: 510 [2019-10-02 00:29:41,750 INFO L226 Difference]: Without dead ends: 508 [2019-10-02 00:29:41,753 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=484, Invalid=3038, Unknown=18, NotChecked=0, Total=3540 [2019-10-02 00:29:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-10-02 00:29:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 304. [2019-10-02 00:29:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-02 00:29:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 400 transitions. [2019-10-02 00:29:41,809 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 400 transitions. Word has length 89 [2019-10-02 00:29:41,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:41,810 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 400 transitions. [2019-10-02 00:29:41,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 00:29:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 400 transitions. [2019-10-02 00:29:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 00:29:41,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:41,814 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:41,814 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash 854871883, now seen corresponding path program 2 times [2019-10-02 00:29:41,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:41,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:41,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:41,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:29:41,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 00:29:42,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:42,083 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:42,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:29:42,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:29:42,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:29:42,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 00:29:42,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:42,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:29:42,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:42,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:42,296 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-02 00:29:42,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 00:29:42,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:29:42,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:29:42,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:42,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:42,393 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-02 00:29:42,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-10-02 00:29:42,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:29:42,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:42,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:42,722 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-02 00:29:42,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-02 00:29:42,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 67 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 00:29:42,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:42,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-10-02 00:29:42,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 00:29:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 00:29:42,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2019-10-02 00:29:42,799 INFO L87 Difference]: Start difference. First operand 304 states and 400 transitions. Second operand 30 states. [2019-10-02 00:29:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:48,048 INFO L93 Difference]: Finished difference Result 522 states and 693 transitions. [2019-10-02 00:29:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 00:29:48,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2019-10-02 00:29:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:48,055 INFO L225 Difference]: With dead ends: 522 [2019-10-02 00:29:48,055 INFO L226 Difference]: Without dead ends: 520 [2019-10-02 00:29:48,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=558, Invalid=3864, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 00:29:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-10-02 00:29:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 275. [2019-10-02 00:29:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-02 00:29:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 365 transitions. [2019-10-02 00:29:48,139 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 365 transitions. Word has length 89 [2019-10-02 00:29:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:48,140 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 365 transitions. [2019-10-02 00:29:48,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 00:29:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 365 transitions. [2019-10-02 00:29:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 00:29:48,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:48,143 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:48,144 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash 831831990, now seen corresponding path program 7 times [2019-10-02 00:29:48,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:48,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:48,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:48,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:29:48,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 00:29:48,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:48,450 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:48,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:29:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:48,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 00:29:48,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:48,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:29:48,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:48,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:48,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:29:48,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-10-02 00:29:48,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:48,686 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 25 treesize of output 25 [2019-10-02 00:29:48,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:48,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:29:48,697 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-10-02 00:29:48,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:48,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-10-02 00:29:48,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 00:29:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:48,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 22 [2019-10-02 00:29:48,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:29:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:29:48,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:29:48,760 INFO L87 Difference]: Start difference. First operand 275 states and 365 transitions. Second operand 22 states. [2019-10-02 00:29:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:52,198 INFO L93 Difference]: Finished difference Result 922 states and 1335 transitions. [2019-10-02 00:29:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-02 00:29:52,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2019-10-02 00:29:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:52,220 INFO L225 Difference]: With dead ends: 922 [2019-10-02 00:29:52,221 INFO L226 Difference]: Without dead ends: 920 [2019-10-02 00:29:52,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1821 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=663, Invalid=4887, Unknown=0, NotChecked=0, Total=5550 [2019-10-02 00:29:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-10-02 00:29:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 422. [2019-10-02 00:29:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-10-02 00:29:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 577 transitions. [2019-10-02 00:29:52,299 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 577 transitions. Word has length 97 [2019-10-02 00:29:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:52,300 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 577 transitions. [2019-10-02 00:29:52,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:29:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 577 transitions. [2019-10-02 00:29:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 00:29:52,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:52,304 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:52,305 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash 816313272, now seen corresponding path program 2 times [2019-10-02 00:29:52,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:52,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:52,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:52,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:29:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 00:29:52,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:52,678 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:52,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:29:52,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:29:52,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:29:52,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 00:29:52,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:52,901 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 13 treesize of output 9 [2019-10-02 00:29:52,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:52,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:52,910 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-02 00:29:52,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-10-02 00:29:53,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:29:53,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:53,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:53,511 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-02 00:29:53,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-02 00:29:53,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:29:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 00:29:53,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:53,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-10-02 00:29:53,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 00:29:53,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 00:29:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2019-10-02 00:29:53,611 INFO L87 Difference]: Start difference. First operand 422 states and 577 transitions. Second operand 32 states. [2019-10-02 00:29:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:59,193 INFO L93 Difference]: Finished difference Result 900 states and 1240 transitions. [2019-10-02 00:29:59,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 00:29:59,194 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2019-10-02 00:29:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:59,201 INFO L225 Difference]: With dead ends: 900 [2019-10-02 00:29:59,202 INFO L226 Difference]: Without dead ends: 898 [2019-10-02 00:29:59,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=773, Invalid=5547, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 00:29:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-10-02 00:29:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 384. [2019-10-02 00:29:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-02 00:29:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 518 transitions. [2019-10-02 00:29:59,314 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 518 transitions. Word has length 97 [2019-10-02 00:29:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:59,315 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 518 transitions. [2019-10-02 00:29:59,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 00:29:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 518 transitions. [2019-10-02 00:29:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 00:29:59,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:59,320 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:59,320 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash -871874653, now seen corresponding path program 8 times [2019-10-02 00:29:59,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:59,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:59,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:29:59,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 63 proven. 48 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 00:29:59,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:59,950 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:59,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:30:00,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:30:00,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:30:00,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 00:30:00,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:30:00,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:30:00,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:30:00,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:30:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 84 proven. 27 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 00:30:00,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:30:00,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-10-02 00:30:00,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 00:30:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 00:30:00,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:30:00,403 INFO L87 Difference]: Start difference. First operand 384 states and 518 transitions. Second operand 28 states. [2019-10-02 00:30:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:30:01,093 INFO L93 Difference]: Finished difference Result 471 states and 610 transitions. [2019-10-02 00:30:01,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 00:30:01,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 105 [2019-10-02 00:30:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:30:01,096 INFO L225 Difference]: With dead ends: 471 [2019-10-02 00:30:01,096 INFO L226 Difference]: Without dead ends: 393 [2019-10-02 00:30:01,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 00:30:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-02 00:30:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 384. [2019-10-02 00:30:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-02 00:30:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 506 transitions. [2019-10-02 00:30:01,151 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 506 transitions. Word has length 105 [2019-10-02 00:30:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:30:01,151 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 506 transitions. [2019-10-02 00:30:01,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 00:30:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 506 transitions. [2019-10-02 00:30:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 00:30:01,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:30:01,154 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:30:01,154 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:30:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:30:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1446701272, now seen corresponding path program 9 times [2019-10-02 00:30:01,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:30:01,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:30:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:30:01,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:30:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:30:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:30:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 12 proven. 124 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:30:01,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:30:01,431 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:30:01,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:30:01,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 00:30:01,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:30:01,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 00:30:01,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:30:01,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:30:01,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:30:01,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:30:01,724 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-02 00:30:01,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-02 00:30:02,514 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:30:02,514 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 24 treesize of output 23 [2019-10-02 00:30:02,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:30:02,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:30:02,521 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-02 00:30:02,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-10-02 00:30:06,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-10-02 00:30:06,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:30:06,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:30:06,642 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-02 00:30:06,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-10-02 00:30:06,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:30:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 21 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-02 00:30:06,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:30:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-10-02 00:30:06,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 00:30:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 00:30:06,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 00:30:06,754 INFO L87 Difference]: Start difference. First operand 384 states and 506 transitions. Second operand 35 states. [2019-10-02 00:31:50,323 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 00:32:00,481 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-10-02 00:32:07,940 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-10-02 00:35:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:35:20,081 INFO L93 Difference]: Finished difference Result 2071 states and 3053 transitions. [2019-10-02 00:35:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-10-02 00:35:20,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2019-10-02 00:35:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:35:20,093 INFO L225 Difference]: With dead ends: 2071 [2019-10-02 00:35:20,093 INFO L226 Difference]: Without dead ends: 2069 [2019-10-02 00:35:20,100 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 94 SyntacticMatches, 15 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9025 ImplicationChecksByTransitivity, 72.2s TimeCoverageRelationStatistics Valid=2396, Invalid=20527, Unknown=29, NotChecked=0, Total=22952 [2019-10-02 00:35:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-10-02 00:35:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1469. [2019-10-02 00:35:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-10-02 00:35:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2232 transitions. [2019-10-02 00:35:20,398 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2232 transitions. Word has length 119 [2019-10-02 00:35:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:35:20,399 INFO L475 AbstractCegarLoop]: Abstraction has 1469 states and 2232 transitions. [2019-10-02 00:35:20,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 00:35:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2232 transitions. [2019-10-02 00:35:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 00:35:20,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:35:20,406 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:35:20,406 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:35:20,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:35:20,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1029304666, now seen corresponding path program 3 times [2019-10-02 00:35:20,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:35:20,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:35:20,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:35:20,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:35:20,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:35:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:35:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 12 proven. 124 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:35:20,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:35:20,793 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:35:20,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:35:20,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 00:35:20,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:35:20,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 00:35:20,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:35:21,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:35:21,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:35:21,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:35:21,076 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-02 00:35:21,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 00:35:21,165 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:35:21,165 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-02 00:35:21,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:35:21,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:35:21,172 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-02 00:35:21,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-02 00:35:21,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:35:21,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:35:21,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:35:21,805 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-02 00:35:21,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:35:21,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:35:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 21 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-02 00:35:21,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:35:21,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-10-02 00:35:21,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 00:35:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 00:35:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 00:35:21,924 INFO L87 Difference]: Start difference. First operand 1469 states and 2232 transitions. Second operand 36 states. [2019-10-02 00:36:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:36:26,430 INFO L93 Difference]: Finished difference Result 2219 states and 3324 transitions. [2019-10-02 00:36:26,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 00:36:26,430 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 119 [2019-10-02 00:36:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:36:26,443 INFO L225 Difference]: With dead ends: 2219 [2019-10-02 00:36:26,443 INFO L226 Difference]: Without dead ends: 2217 [2019-10-02 00:36:26,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 91 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2747 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=986, Invalid=7756, Unknown=0, NotChecked=0, Total=8742 [2019-10-02 00:36:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2019-10-02 00:36:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1667. [2019-10-02 00:36:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2019-10-02 00:36:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2489 transitions. [2019-10-02 00:36:26,820 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2489 transitions. Word has length 119 [2019-10-02 00:36:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:36:26,820 INFO L475 AbstractCegarLoop]: Abstraction has 1667 states and 2489 transitions. [2019-10-02 00:36:26,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 00:36:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2489 transitions. [2019-10-02 00:36:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 00:36:26,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:36:26,828 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:36:26,828 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:36:26,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:36:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1853086011, now seen corresponding path program 10 times [2019-10-02 00:36:26,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:36:26,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:36:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:26,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:36:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:36:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 00:36:27,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:36:27,091 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:36:27,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:36:27,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:36:27,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:36:27,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 00:36:27,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:36:27,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:36:27,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:36:27,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:27,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:36:27,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-10-02 00:36:27,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:27,418 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 25 treesize of output 25 [2019-10-02 00:36:27,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:36:27,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:36:27,431 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-10-02 00:36:27,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:36:27,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-10-02 00:36:27,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:36:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 00:36:27,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:36:27,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 27 [2019-10-02 00:36:27,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 00:36:27,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 00:36:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-10-02 00:36:27,495 INFO L87 Difference]: Start difference. First operand 1667 states and 2489 transitions. Second operand 27 states. [2019-10-02 00:36:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:36:42,226 INFO L93 Difference]: Finished difference Result 5315 states and 8100 transitions. [2019-10-02 00:36:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2019-10-02 00:36:42,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 127 [2019-10-02 00:36:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:36:42,248 INFO L225 Difference]: With dead ends: 5315 [2019-10-02 00:36:42,248 INFO L226 Difference]: Without dead ends: 5313 [2019-10-02 00:36:42,253 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25512 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4746, Invalid=53576, Unknown=0, NotChecked=0, Total=58322 [2019-10-02 00:36:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-10-02 00:36:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 2598. [2019-10-02 00:36:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2019-10-02 00:36:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3927 transitions. [2019-10-02 00:36:42,924 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3927 transitions. Word has length 127 [2019-10-02 00:36:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:36:42,924 INFO L475 AbstractCegarLoop]: Abstraction has 2598 states and 3927 transitions. [2019-10-02 00:36:42,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 00:36:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3927 transitions. [2019-10-02 00:36:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 00:36:42,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:36:42,937 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:36:42,937 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:36:42,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:36:42,938 INFO L82 PathProgramCache]: Analyzing trace with hash 755701447, now seen corresponding path program 3 times [2019-10-02 00:36:42,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:36:42,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:36:42,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:42,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:36:42,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:36:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 00:36:43,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:36:43,393 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:36:43,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:36:43,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 00:36:43,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:36:43,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 00:36:43,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:36:43,719 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 13 treesize of output 9 [2019-10-02 00:36:43,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:36:43,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:43,726 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-02 00:36:43,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-10-02 00:36:44,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-02 00:36:44,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:36:44,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:44,525 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-02 00:36:44,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-10-02 00:36:44,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:36:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 00:36:44,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:36:44,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-10-02 00:36:44,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 00:36:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 00:36:44,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 00:36:44,630 INFO L87 Difference]: Start difference. First operand 2598 states and 3927 transitions. Second operand 38 states. [2019-10-02 00:39:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:35,480 INFO L93 Difference]: Finished difference Result 5405 states and 8079 transitions. [2019-10-02 00:39:35,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-02 00:39:35,480 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 127 [2019-10-02 00:39:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:35,508 INFO L225 Difference]: With dead ends: 5405 [2019-10-02 00:39:35,509 INFO L226 Difference]: Without dead ends: 5403 [2019-10-02 00:39:35,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 99 SyntacticMatches, 13 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7204 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2010, Invalid=18582, Unknown=0, NotChecked=0, Total=20592 [2019-10-02 00:39:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-10-02 00:39:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 3743. [2019-10-02 00:39:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-10-02 00:39:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5649 transitions. [2019-10-02 00:39:36,647 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5649 transitions. Word has length 127 [2019-10-02 00:39:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:36,648 INFO L475 AbstractCegarLoop]: Abstraction has 3743 states and 5649 transitions. [2019-10-02 00:39:36,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 00:39:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5649 transitions. [2019-10-02 00:39:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 00:39:36,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:36,664 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:36,664 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2108368818, now seen corresponding path program 11 times [2019-10-02 00:39:36,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:36,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:39:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 115 proven. 81 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-02 00:39:37,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:37,390 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:37,462 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:39:37,542 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-02 00:39:37,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:39:37,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 00:39:37,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:37,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:39:37,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:37,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 144 proven. 52 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-02 00:39:38,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:38,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2019-10-02 00:39:38,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 00:39:38,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 00:39:38,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:39:38,256 INFO L87 Difference]: Start difference. First operand 3743 states and 5649 transitions. Second operand 34 states. [2019-10-02 00:39:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:39:39,711 INFO L93 Difference]: Finished difference Result 3967 states and 5867 transitions. [2019-10-02 00:39:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 00:39:39,712 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-10-02 00:39:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:39:39,756 INFO L225 Difference]: With dead ends: 3967 [2019-10-02 00:39:39,756 INFO L226 Difference]: Without dead ends: 3658 [2019-10-02 00:39:39,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=398, Invalid=1324, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 00:39:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2019-10-02 00:39:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3658. [2019-10-02 00:39:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3658 states. [2019-10-02 00:39:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 5523 transitions. [2019-10-02 00:39:40,636 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 5523 transitions. Word has length 135 [2019-10-02 00:39:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:39:40,636 INFO L475 AbstractCegarLoop]: Abstraction has 3658 states and 5523 transitions. [2019-10-02 00:39:40,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 00:39:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 5523 transitions. [2019-10-02 00:39:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 00:39:40,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:39:40,653 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:39:40,654 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:39:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:39:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1530821081, now seen corresponding path program 12 times [2019-10-02 00:39:40,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:39:40,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:39:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:40,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:39:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:39:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:39:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 16 proven. 213 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-10-02 00:39:41,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:39:41,097 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:39:41,174 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:39:41,271 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 00:39:41,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:39:41,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 00:39:41,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:39:41,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 00:39:41,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:41,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:41,438 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-02 00:39:41,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-10-02 00:39:41,948 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-10-02 00:39:41,949 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 24 treesize of output 23 [2019-10-02 00:39:41,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:41,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:41,956 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-02 00:39:41,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-10-02 00:39:50,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-10-02 00:39:50,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:39:50,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:39:50,489 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-02 00:39:50,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-10-02 00:39:50,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:39:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 27 proven. 229 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-02 00:39:50,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:39:50,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2019-10-02 00:39:50,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 00:39:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 00:39:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1484, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 00:39:50,619 INFO L87 Difference]: Start difference. First operand 3658 states and 5523 transitions. Second operand 41 states.