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/loop-crafted/simple_array_index_value_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:14:28,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:14:28,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:14:28,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:14:28,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:14:28,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:14:28,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:14:28,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:14:28,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:14:28,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:14:28,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:14:28,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:14:28,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:14:28,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:14:28,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:14:28,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:14:28,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:14:28,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:14:28,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:14:28,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:14:28,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:14:28,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:14:28,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:14:28,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:14:28,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:14:28,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:14:28,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:14:28,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:14:28,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:14:28,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:14:28,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:14:28,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:14:28,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:14:28,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:14:28,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:14:28,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:14:28,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:14:28,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:14:28,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:14:28,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:14:28,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:14:28,810 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 11:14:28,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:14:28,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:14:28,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:14:28,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:14:28,826 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:14:28,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:14:28,827 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:14:28,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:14:28,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:14:28,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:14:28,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:14:28,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:14:28,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:14:28,828 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:14:28,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:14:28,828 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:14:28,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:14:28,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:14:28,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:14:28,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:14:28,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:14:28,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:14:28,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:14:28,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:14:28,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:14:28,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:14:28,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:14:28,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:14:28,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:14:28,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:14:28,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:14:28,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:14:28,880 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:14:28,880 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:14:28,881 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2019-10-02 11:14:28,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfedb90ac/dc5c2a5249654f0395d26145a87db1b4/FLAG3c8b558f7 [2019-10-02 11:14:29,420 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:14:29,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2019-10-02 11:14:29,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfedb90ac/dc5c2a5249654f0395d26145a87db1b4/FLAG3c8b558f7 [2019-10-02 11:14:29,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfedb90ac/dc5c2a5249654f0395d26145a87db1b4 [2019-10-02 11:14:29,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:14:29,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:14:29,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:14:29,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:14:29,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:14:29,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:14:29" (1/1) ... [2019-10-02 11:14:29,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ded93f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:29, skipping insertion in model container [2019-10-02 11:14:29,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:14:29" (1/1) ... [2019-10-02 11:14:29,793 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:14:29,807 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:14:29,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:14:29,997 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:14:30,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:14:30,039 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:14:30,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30 WrapperNode [2019-10-02 11:14:30,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:14:30,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:14:30,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:14:30,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:14:30,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (1/1) ... [2019-10-02 11:14:30,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (1/1) ... [2019-10-02 11:14:30,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (1/1) ... [2019-10-02 11:14:30,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (1/1) ... [2019-10-02 11:14:30,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (1/1) ... [2019-10-02 11:14:30,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (1/1) ... [2019-10-02 11:14:30,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (1/1) ... [2019-10-02 11:14:30,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:14:30,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:14:30,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:14:30,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:14:30,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (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 11:14:30,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:14:30,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:14:30,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:14:30,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:14:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:14:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:14:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:14:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:14:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:14:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:14:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:14:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:14:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:14:32,463 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:14:32,463 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 11:14:32,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:14:32 BoogieIcfgContainer [2019-10-02 11:14:32,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:14:32,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:14:32,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:14:32,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:14:32,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:14:29" (1/3) ... [2019-10-02 11:14:32,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cedf601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:14:32, skipping insertion in model container [2019-10-02 11:14:32,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:30" (2/3) ... [2019-10-02 11:14:32,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cedf601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:14:32, skipping insertion in model container [2019-10-02 11:14:32,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:14:32" (3/3) ... [2019-10-02 11:14:32,479 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.i [2019-10-02 11:14:32,493 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:14:32,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:14:32,523 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:14:32,560 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:14:32,561 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:14:32,561 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:14:32,562 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:14:32,562 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:14:32,562 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:14:32,562 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:14:32,563 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:14:32,563 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:14:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-02 11:14:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:14:32,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:32,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:32,593 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash -956066777, now seen corresponding path program 1 times [2019-10-02 11:14:32,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:32,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:32,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:32,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:32,737 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 11:14:32,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:14:32,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:14:32,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:14:32,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:14:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:14:32,756 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-02 11:14:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:32,776 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-10-02 11:14:32,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:14:32,778 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-02 11:14:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:32,787 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:14:32,787 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:14:32,790 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 11:14:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:14:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-02 11:14:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-02 11:14:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-02 11:14:32,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2019-10-02 11:14:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:32,827 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-02 11:14:32,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:14:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-02 11:14:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:14:32,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:32,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:32,830 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1471973101, now seen corresponding path program 1 times [2019-10-02 11:14:32,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:32,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:32,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:32,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:32,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:32,916 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 11:14:32,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:14:32,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:14:32,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:14:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:14:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:14:32,920 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2019-10-02 11:14:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:32,998 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-10-02 11:14:32,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:14:33,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 11:14:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:33,001 INFO L225 Difference]: With dead ends: 43 [2019-10-02 11:14:33,001 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 11:14:33,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:14:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 11:14:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-10-02 11:14:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-02 11:14:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-02 11:14:33,012 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2019-10-02 11:14:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:33,013 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-02 11:14:33,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:14:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-02 11:14:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:14:33,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:33,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:33,015 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash 534952077, now seen corresponding path program 1 times [2019-10-02 11:14:33,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:33,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:33,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:33,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:33,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:33,155 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 11:14:33,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:33,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:14:33,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:33,304 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 11 treesize of output 7 [2019-10-02 11:14:33,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:33,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:33,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:14:33,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-02 11:14:33,355 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 11:14:33,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:33,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:33,359 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 11:14:33,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-02 11:14:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:33,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:33,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 9 [2019-10-02 11:14:33,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:14:33,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:14:33,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:14:33,442 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 9 states. [2019-10-02 11:14:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:33,655 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-10-02 11:14:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:14:33,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-10-02 11:14:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:33,657 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:14:33,658 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:14:33,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:14:33,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:14:33,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-10-02 11:14:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-02 11:14:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-02 11:14:33,668 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2019-10-02 11:14:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:33,669 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-02 11:14:33,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:14:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-02 11:14:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:14:33,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:33,670 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:33,671 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:33,671 INFO L82 PathProgramCache]: Analyzing trace with hash 909633835, now seen corresponding path program 1 times [2019-10-02 11:14:33,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:33,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:33,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:33,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:33,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 11:14:33,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:33,842 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 11:14:33,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:33,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 11:14:33,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:33,942 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:33,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:33,951 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:33,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:33,997 INFO L567 ElimStorePlain]: treesize reduction 158, result has 14.1 percent of original size [2019-10-02 11:14:33,998 INFO L464 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2019-10-02 11:14:33,998 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-10-02 11:14:34,012 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 19 treesize of output 15 [2019-10-02 11:14:34,012 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:34,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:34,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:34,023 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:271, output treesize:22 [2019-10-02 11:14:34,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:34,290 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 11:14:34,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 11:14:34,312 INFO L567 ElimStorePlain]: treesize reduction 13, result has 48.0 percent of original size [2019-10-02 11:14:34,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:34,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2019-10-02 11:14:34,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:34,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:34,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 14 [2019-10-02 11:14:34,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:14:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:14:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:14:34,396 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 14 states. [2019-10-02 11:14:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:35,069 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-10-02 11:14:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:14:35,072 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-10-02 11:14:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:35,073 INFO L225 Difference]: With dead ends: 76 [2019-10-02 11:14:35,074 INFO L226 Difference]: Without dead ends: 51 [2019-10-02 11:14:35,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:14:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-02 11:14:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-10-02 11:14:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 11:14:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-02 11:14:35,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2019-10-02 11:14:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:35,093 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-02 11:14:35,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:14:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-02 11:14:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:14:35,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:35,095 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:35,095 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:35,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1108091277, now seen corresponding path program 1 times [2019-10-02 11:14:35,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:35,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:35,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:35,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:35,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:14:35,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:35,273 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) [2019-10-02 11:14:35,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:14:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:35,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:14:35,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:35,384 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 42 treesize of output 38 [2019-10-02 11:14:35,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:35,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:14:35,402 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 41 treesize of output 1 [2019-10-02 11:14:35,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:35,465 INFO L567 ElimStorePlain]: treesize reduction 204, result has 9.7 percent of original size [2019-10-02 11:14:35,465 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2019-10-02 11:14:35,465 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-10-02 11:14:35,466 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-10-02 11:14:35,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:35,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:271, output treesize:22 [2019-10-02 11:14:35,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:35,904 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 11:14:35,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 11:14:35,926 INFO L567 ElimStorePlain]: treesize reduction 13, result has 48.0 percent of original size [2019-10-02 11:14:35,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:35,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2019-10-02 11:14:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:14:36,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:36,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15] total 16 [2019-10-02 11:14:36,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:14:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:14:36,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:14:36,022 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 16 states. [2019-10-02 11:14:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:39,165 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2019-10-02 11:14:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:14:39,170 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-10-02 11:14:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:39,172 INFO L225 Difference]: With dead ends: 98 [2019-10-02 11:14:39,172 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 11:14:39,173 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:14:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 11:14:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2019-10-02 11:14:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 11:14:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-10-02 11:14:39,185 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-10-02 11:14:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:39,185 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-10-02 11:14:39,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:14:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-10-02 11:14:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:14:39,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:39,187 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:39,187 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash 224814507, now seen corresponding path program 2 times [2019-10-02 11:14:39,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:39,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:14:39,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:39,351 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 11:14:39,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:14:39,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:14:39,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:14:39,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 11:14:39,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:39,435 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:39,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:39,489 INFO L567 ElimStorePlain]: treesize reduction 194, result has 11.8 percent of original size [2019-10-02 11:14:39,489 INFO L464 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2019-10-02 11:14:39,489 INFO L464 ElimStorePlain]: Eliminatee v_prenex_12 vanished before elimination [2019-10-02 11:14:39,493 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 19 treesize of output 15 [2019-10-02 11:14:39,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:39,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:39,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:39,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:271, output treesize:22 [2019-10-02 11:14:40,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:40,013 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 11:14:40,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 11:14:40,029 INFO L567 ElimStorePlain]: treesize reduction 13, result has 48.0 percent of original size [2019-10-02 11:14:40,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:40,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2019-10-02 11:14:40,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 11:14:40,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:40,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 18 [2019-10-02 11:14:40,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:14:40,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:14:40,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:14:40,135 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 18 states. [2019-10-02 11:14:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:46,166 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2019-10-02 11:14:46,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 11:14:46,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-10-02 11:14:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:46,169 INFO L225 Difference]: With dead ends: 205 [2019-10-02 11:14:46,169 INFO L226 Difference]: Without dead ends: 166 [2019-10-02 11:14:46,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:14:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-02 11:14:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 113. [2019-10-02 11:14:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-02 11:14:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2019-10-02 11:14:46,195 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 49 [2019-10-02 11:14:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:46,195 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2019-10-02 11:14:46,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:14:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2019-10-02 11:14:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:14:46,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:46,198 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:46,198 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:46,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:46,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1521287449, now seen corresponding path program 3 times [2019-10-02 11:14:46,199 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:46,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:46,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:46,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:14:46,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:14:46,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:46,359 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 11:14:46,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:15:10,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 11:15:10,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:15:10,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:15:10,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:15:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:15:10,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:15:10,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 11:15:10,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:15:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:15:10,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:15:10,696 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 10 states. [2019-10-02 11:15:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:11,006 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2019-10-02 11:15:11,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:15:11,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-02 11:15:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:11,008 INFO L225 Difference]: With dead ends: 149 [2019-10-02 11:15:11,009 INFO L226 Difference]: Without dead ends: 83 [2019-10-02 11:15:11,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:15:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-02 11:15:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-10-02 11:15:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-02 11:15:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-10-02 11:15:11,023 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 53 [2019-10-02 11:15:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:11,024 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-10-02 11:15:11,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:15:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-10-02 11:15:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:15:11,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:11,025 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:11,026 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:11,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1569539003, now seen corresponding path program 4 times [2019-10-02 11:15:11,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:11,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:11,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:15:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:15:11,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:15:11,190 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 11:15:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:15:11,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:15:11,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:15:11,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 11:15:11,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:15:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:15:11,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:15:11,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 11:15:11,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:15:11,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:15:11,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:15:11,296 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 11 states. [2019-10-02 11:15:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:11,689 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2019-10-02 11:15:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:15:11,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-10-02 11:15:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:11,691 INFO L225 Difference]: With dead ends: 148 [2019-10-02 11:15:11,691 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 11:15:11,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:15:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 11:15:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2019-10-02 11:15:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-02 11:15:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2019-10-02 11:15:11,706 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 55 [2019-10-02 11:15:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:11,707 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2019-10-02 11:15:11,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:15:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2019-10-02 11:15:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:15:11,708 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:11,708 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:11,708 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash -694642141, now seen corresponding path program 5 times [2019-10-02 11:15:11,709 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:11,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:11,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:11,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:15:11,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:15:11,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:15:11,881 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 11:15:11,904 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:15:27,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-02 11:15:27,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:15:28,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-02 11:15:28,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:15:28,048 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,053 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,102 INFO L567 ElimStorePlain]: treesize reduction 158, result has 14.1 percent of original size [2019-10-02 11:15:28,103 INFO L464 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2019-10-02 11:15:28,103 INFO L464 ElimStorePlain]: Eliminatee v_prenex_20 vanished before elimination [2019-10-02 11:15:28,106 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 19 treesize of output 15 [2019-10-02 11:15:28,106 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:15:28,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,115 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:271, output treesize:22 [2019-10-02 11:15:28,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:28,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:28,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:28,169 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,174 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,184 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,184 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:28,203 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 61 treesize of output 60 [2019-10-02 11:15:28,204 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,208 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,209 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,212 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,212 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,250 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-10-02 11:15:28,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,251 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:385, output treesize:41 [2019-10-02 11:15:28,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:28,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:28,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:28,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:28,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:28,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:28,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 79 [2019-10-02 11:15:28,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:28,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:28,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:28,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2019-10-02 11:15:28,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,450 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,451 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,457 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,457 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,462 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,463 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,467 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:28,467 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,562 INFO L567 ElimStorePlain]: treesize reduction 90, result has 39.2 percent of original size [2019-10-02 11:15:28,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:15:28,563 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:487, output treesize:58 [2019-10-02 11:15:30,622 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2019-10-02 11:15:30,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:30,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:30,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:30,707 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:30,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:30,718 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:30,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:30,721 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:30,721 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:30,725 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:30,725 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:30,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:30,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:30,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:30,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:30,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:30,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:30,840 INFO L235 Elim1Store]: Index analysis took 103 ms [2019-10-02 11:15:30,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 102 [2019-10-02 11:15:30,880 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:30,889 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:30,889 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:30,986 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.8 percent of original size [2019-10-02 11:15:30,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:15:30,987 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:601, output treesize:77 [2019-10-02 11:15:31,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:31,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:31,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,499 INFO L235 Elim1Store]: Index analysis took 288 ms [2019-10-02 11:15:31,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 121 [2019-10-02 11:15:31,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:31,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:31,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 122 [2019-10-02 11:15:31,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:31,678 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:31,678 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:31,682 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:31,682 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:31,687 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:31,687 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:31,693 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:31,693 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:35,168 WARN L191 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-10-02 11:15:35,168 INFO L567 ElimStorePlain]: treesize reduction 126, result has 42.7 percent of original size [2019-10-02 11:15:35,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:15:35,168 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:703, output treesize:94 [2019-10-02 11:15:35,655 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 11:15:35,925 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-10-02 11:15:35,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:35,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:35,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:36,553 INFO L235 Elim1Store]: Index analysis took 595 ms [2019-10-02 11:15:36,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 144 [2019-10-02 11:15:36,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:36,720 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:36,721 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:36,725 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:36,725 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:36,730 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:36,731 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:36,735 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:36,736 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:36,742 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:36,743 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:36,886 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-02 11:15:36,886 INFO L567 ElimStorePlain]: treesize reduction 16, result has 87.6 percent of original size [2019-10-02 11:15:36,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:36,888 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:817, output treesize:113 [2019-10-02 11:15:40,108 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-10-02 11:15:42,211 WARN L191 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 66 [2019-10-02 11:15:42,211 INFO L341 Elim1Store]: treesize reduction 350, result has 23.4 percent of original size [2019-10-02 11:15:42,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 116 treesize of output 146 [2019-10-02 11:15:42,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:43,784 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 64 DAG size of output: 9 [2019-10-02 11:15:43,785 INFO L567 ElimStorePlain]: treesize reduction 119, result has 9.2 percent of original size [2019-10-02 11:15:43,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:43,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:122, output treesize:12 [2019-10-02 11:15:43,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 88 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 11:15:44,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:15:44,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27] total 33 [2019-10-02 11:15:44,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 11:15:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 11:15:44,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 11:15:44,299 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 33 states. [2019-10-02 11:15:45,694 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-02 11:15:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:50,968 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2019-10-02 11:15:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:15:50,970 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 57 [2019-10-02 11:15:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:50,971 INFO L225 Difference]: With dead ends: 162 [2019-10-02 11:15:50,971 INFO L226 Difference]: Without dead ends: 99 [2019-10-02 11:15:50,972 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 11:15:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-02 11:15:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-10-02 11:15:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-02 11:15:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-10-02 11:15:50,986 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 57 [2019-10-02 11:15:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:50,987 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-10-02 11:15:50,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 11:15:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-10-02 11:15:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 11:15:50,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:50,988 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:50,988 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1732347775, now seen corresponding path program 6 times [2019-10-02 11:15:50,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:50,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:50,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:15:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:15:51,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:15:51,237 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 11:15:51,290 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:15:52,203 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 11:15:52,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:15:52,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-02 11:15:52,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:15:52,235 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,286 INFO L567 ElimStorePlain]: treesize reduction 194, result has 11.8 percent of original size [2019-10-02 11:15:52,286 INFO L464 ElimStorePlain]: Eliminatee v_prenex_28 vanished before elimination [2019-10-02 11:15:52,289 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 19 treesize of output 15 [2019-10-02 11:15:52,289 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:15:52,297 INFO L464 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2019-10-02 11:15:52,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:271, output treesize:22 [2019-10-02 11:15:52,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:52,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:52,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:52,379 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,390 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:52,410 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 60 treesize of output 59 [2019-10-02 11:15:52,411 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:52,428 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 61 treesize of output 60 [2019-10-02 11:15:52,429 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,432 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,433 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,436 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,437 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,495 INFO L567 ElimStorePlain]: treesize reduction 73, result has 36.0 percent of original size [2019-10-02 11:15:52,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,496 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:385, output treesize:41 [2019-10-02 11:15:52,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:52,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:52,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:52,613 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,617 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,621 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,622 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,631 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,631 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,635 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:52,636 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,692 INFO L341 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2019-10-02 11:15:52,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 80 [2019-10-02 11:15:52,693 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,839 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-10-02 11:15:52,839 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.4 percent of original size [2019-10-02 11:15:52,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:15:52,840 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:487, output treesize:58 [2019-10-02 11:15:53,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:53,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:53,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:53,054 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:53,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:53,058 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:53,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:53,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,192 INFO L235 Elim1Store]: Index analysis took 118 ms [2019-10-02 11:15:53,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2019-10-02 11:15:53,241 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:53,248 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:53,248 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:53,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:53,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 102 [2019-10-02 11:15:53,304 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:53,307 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:53,308 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:53,880 WARN L191 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-10-02 11:15:53,881 INFO L567 ElimStorePlain]: treesize reduction 109, result has 41.4 percent of original size [2019-10-02 11:15:53,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:53,881 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:601, output treesize:77 [2019-10-02 11:15:53,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:53,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:53,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:54,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:54,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:54,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:56,056 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (+ (* 4 (mod (+ v_prenex_29 4294967295) 4294967296)) |main_~#array~0.offset|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|)) [2019-10-02 11:15:58,075 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (+ (* 4 (mod (+ v_prenex_29 4294967293) 4294967296)) |main_~#array~0.offset|) (+ (* 4 (mod (+ v_prenex_29 4294967294) 4294967296)) |main_~#array~0.offset|)) [2019-10-02 11:15:58,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:58,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:58,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:58,385 INFO L235 Elim1Store]: Index analysis took 4377 ms [2019-10-02 11:16:01,661 WARN L191 SmtUtils]: Spent 3.15 s on a formula simplification that was a NOOP. DAG size: 64 [2019-10-02 11:16:01,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:01,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 330 [2019-10-02 11:16:01,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:01,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:01,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:01,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:01,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:01,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:01,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:01,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:01,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:01,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:01,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 221 [2019-10-02 11:16:01,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:01,795 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:01,795 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:01,804 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:01,805 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:01,811 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:01,811 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:01,817 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:01,818 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:15,261 WARN L191 SmtUtils]: Spent 13.44 s on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-10-02 11:16:15,262 INFO L567 ElimStorePlain]: treesize reduction 431, result has 18.4 percent of original size [2019-10-02 11:16:15,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:15,263 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:691, output treesize:97 [2019-10-02 11:16:15,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:15,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:15,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:15,395 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:15,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:15,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:15,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:15,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:15,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:15,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:15,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:15,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:15,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:15,749 INFO L235 Elim1Store]: Index analysis took 312 ms [2019-10-02 11:16:17,782 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_30 4294967296)) |main_~#array~0.offset|))) [2019-10-02 11:16:19,823 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |main_~#array~0.offset|))) [2019-10-02 11:16:21,848 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~index~0 4294967296)) |main_~#array~0.offset|))) [2019-10-02 11:16:21,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:21,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 221 [2019-10-02 11:16:21,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:21,906 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:21,906 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:21,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:21,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:23,943 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |main_~#array~0.offset|) (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |main_~#array~0.offset|)) [2019-10-02 11:16:23,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:23,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:23,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:23,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:16:23,999 INFO L235 Elim1Store]: Index analysis took 2084 ms [2019-10-02 11:16:40,975 WARN L191 SmtUtils]: Spent 16.96 s on a formula simplification that was a NOOP. DAG size: 64 [2019-10-02 11:16:40,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:40,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 330 [2019-10-02 11:16:40,977 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:40,981 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:40,982 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:40,988 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:40,989 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:53,516 WARN L191 SmtUtils]: Spent 12.53 s on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-10-02 11:16:53,516 INFO L567 ElimStorePlain]: treesize reduction 431, result has 18.4 percent of original size [2019-10-02 11:16:53,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:53,517 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:691, output treesize:97 [2019-10-02 11:16:56,116 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 55 [2019-10-02 11:17:06,756 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 c_main_~index~0) (exists ((v_prenex_30 Int)) (let ((.cse1 (mod v_prenex_30 2)) (.cse2 (mod (+ v_prenex_30 1) 2)) (.cse0 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= (select .cse0 (+ (* 4 (mod v_prenex_30 4294967296)) |c_main_~#array~0.offset|)) .cse1) (<= 6 v_prenex_30) (<= v_prenex_30 6) (= .cse2 (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse1) (= .cse2 (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |c_main_~#array~0.offset|)))))) (exists ((v_prenex_31 Int)) (let ((.cse3 (mod (+ v_prenex_31 4294967295) 4294967296))) (and (< .cse3 1000) (= (mod (+ v_prenex_31 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse3) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_31 4294967296)))))) is different from false [2019-10-02 11:17:24,493 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2019-10-02 11:17:28,920 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-02 11:17:30,931 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_main_~index~0 2))) (let ((.cse2 (not (= (mod (+ .cse10 4294967294) 4294967296) 0))) (.cse0 (= 1 c_main_~index~0)) (.cse1 (mod c_main_~index~0 4294967296)) (.cse3 (not (= .cse10 0))) (.cse4 (exists ((v_prenex_33 Int)) (let ((.cse9 (mod (+ v_prenex_33 4294967295) 4294967296))) (and (< .cse9 1000) (= (mod (+ v_prenex_33 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse9) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_33 4294967296)))))) (.cse5 (exists ((v_prenex_32 Int)) (let ((.cse8 (mod v_prenex_32 2)) (.cse6 (mod (+ v_prenex_32 1) 2)) (.cse7 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= .cse6 (select .cse7 (+ (* 4 (mod (+ v_prenex_32 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse7 (+ (* 4 (mod (+ v_prenex_32 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse8) (<= 6 v_prenex_32) (= (select .cse7 (+ (* 4 (mod v_prenex_32 4294967296)) |c_main_~#array~0.offset|)) .cse8) (= .cse6 (select .cse7 (+ (* 4 (mod (+ v_prenex_32 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (<= v_prenex_32 6)))))) (or (and .cse0 (< .cse1 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= 0 .cse1) .cse3 .cse4 .cse5)))) is different from false [2019-10-02 11:17:46,050 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse17 (mod c_main_~index~0 2))) (let ((.cse0 (= 1 c_main_~index~0)) (.cse2 (mod c_main_~index~0 4294967296)) (.cse8 (not (= (mod (+ .cse17 4294967294) 4294967296) 0))) (.cse3 (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (v_prenex_38 Int) (v_prenex_39 Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (let ((.cse20 (mod (+ v_prenex_39 1) 2)) (.cse19 (mod v_prenex_39 2)) (.cse18 (select |c_#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|)) (.cse21 (mod (+ v_prenex_38 4294967295) 4294967296))) (and (= (select .cse18 (+ (* 4 (mod (+ v_prenex_39 4294967294) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_11|)) .cse19) (= (select .cse18 (+ (* 4 (mod (+ v_prenex_39 4294967293) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_11|)) .cse20) (<= v_prenex_39 6) (<= 1000 (mod v_prenex_38 4294967296)) (< .cse21 1000) (= .cse20 (select .cse18 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 (mod (+ v_prenex_39 4294967295) 4294967296))))) (= (select .cse18 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 (mod v_prenex_39 4294967296)))) .cse19) (<= 6 v_prenex_39) (= (mod (+ v_prenex_38 1) 2) (select .cse18 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 .cse21)))))))) (.cse4 (not (= .cse17 0)))) (or (and .cse0 (exists ((v_prenex_36 Int)) (let ((.cse1 (mod (+ v_prenex_36 4294967295) 4294967296))) (and (<= 1000 (mod v_prenex_36 4294967296)) (= (mod (+ v_prenex_36 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse1) |c_main_~#array~0.offset|))) (< .cse1 1000)))) (<= 0 .cse2) .cse3 .cse4 (exists ((v_prenex_37 Int)) (let ((.cse5 (mod (+ v_prenex_37 1) 2)) (.cse6 (select |c_#memory_int| |c_main_~#array~0.base|)) (.cse7 (mod v_prenex_37 2))) (and (<= 6 v_prenex_37) (= .cse5 (select .cse6 (+ (* 4 (mod (+ v_prenex_37 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (= .cse5 (select .cse6 (+ (* 4 (mod (+ v_prenex_37 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse6 (+ (* 4 (mod (+ v_prenex_37 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse7) (<= v_prenex_37 6) (= (select .cse6 (+ (* 4 (mod v_prenex_37 4294967296)) |c_main_~#array~0.offset|)) .cse7))))) (and .cse0 .cse8 (exists ((v_prenex_34 Int)) (let ((.cse9 (mod (+ v_prenex_34 4294967295) 4294967296))) (and (< .cse9 1000) (<= 1000 (mod v_prenex_34 4294967296)) (= (mod (+ v_prenex_34 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse9) |c_main_~#array~0.offset|)))))) .cse3 .cse4 (exists ((v_prenex_35 Int)) (let ((.cse11 (mod v_prenex_35 2)) (.cse12 (mod (+ v_prenex_35 1) 2)) (.cse10 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (<= 6 v_prenex_35) (<= v_prenex_35 6) (= (select .cse10 (+ (* 4 (mod (+ v_prenex_35 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse11) (= .cse12 (select .cse10 (+ (* 4 (mod (+ v_prenex_35 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse10 (+ (* 4 (mod v_prenex_35 4294967296)) |c_main_~#array~0.offset|)) .cse11) (= .cse12 (select .cse10 (+ (* 4 (mod (+ v_prenex_35 4294967295) 4294967296)) |c_main_~#array~0.offset|))))))) (and .cse0 (< .cse2 0) .cse8 .cse3 .cse4 (exists ((v_prenex_33 Int)) (let ((.cse13 (mod (+ v_prenex_33 4294967295) 4294967296))) (and (< .cse13 1000) (= (mod (+ v_prenex_33 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse13) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_33 4294967296))))) (exists ((v_prenex_32 Int)) (let ((.cse16 (mod v_prenex_32 2)) (.cse14 (mod (+ v_prenex_32 1) 2)) (.cse15 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= .cse14 (select .cse15 (+ (* 4 (mod (+ v_prenex_32 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse15 (+ (* 4 (mod (+ v_prenex_32 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse16) (<= 6 v_prenex_32) (= (select .cse15 (+ (* 4 (mod v_prenex_32 4294967296)) |c_main_~#array~0.offset|)) .cse16) (= .cse14 (select .cse15 (+ (* 4 (mod (+ v_prenex_32 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (<= v_prenex_32 6)))))))) is different from false [2019-10-02 11:17:48,073 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse28 (mod c_main_~index~0 2))) (let ((.cse0 (= 1 c_main_~index~0)) (.cse2 (mod c_main_~index~0 4294967296)) (.cse11 (not (= (mod (+ .cse28 4294967294) 4294967296) 0))) (.cse7 (not (= .cse28 0)))) (or (and .cse0 (exists ((v_prenex_36 Int)) (let ((.cse1 (mod (+ v_prenex_36 4294967295) 4294967296))) (and (<= 1000 (mod v_prenex_36 4294967296)) (= (mod (+ v_prenex_36 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse1) |c_main_~#array~0.offset|))) (< .cse1 1000)))) (<= 0 .cse2) (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (v_prenex_38 Int) (v_prenex_39 Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (mod (+ v_prenex_39 1) 2)) (.cse4 (mod v_prenex_39 2)) (.cse3 (select |c_#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|)) (.cse6 (mod (+ v_prenex_38 4294967295) 4294967296))) (and (= (select .cse3 (+ (* 4 (mod (+ v_prenex_39 4294967294) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_11|)) .cse4) (= (select .cse3 (+ (* 4 (mod (+ v_prenex_39 4294967293) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_11|)) .cse5) (<= v_prenex_39 6) (<= 1000 (mod v_prenex_38 4294967296)) (< .cse6 1000) (= .cse5 (select .cse3 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 (mod (+ v_prenex_39 4294967295) 4294967296))))) (= (select .cse3 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 (mod v_prenex_39 4294967296)))) .cse4) (<= 6 v_prenex_39) (= (mod (+ v_prenex_38 1) 2) (select .cse3 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 .cse6))))))) .cse7 (exists ((v_prenex_37 Int)) (let ((.cse8 (mod (+ v_prenex_37 1) 2)) (.cse9 (select |c_#memory_int| |c_main_~#array~0.base|)) (.cse10 (mod v_prenex_37 2))) (and (<= 6 v_prenex_37) (= .cse8 (select .cse9 (+ (* 4 (mod (+ v_prenex_37 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (= .cse8 (select .cse9 (+ (* 4 (mod (+ v_prenex_37 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse9 (+ (* 4 (mod (+ v_prenex_37 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse10) (<= v_prenex_37 6) (= (select .cse9 (+ (* 4 (mod v_prenex_37 4294967296)) |c_main_~#array~0.offset|)) .cse10))))) (and .cse0 .cse11 (exists ((v_prenex_41 Int) (v_prenex_40 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse12 (mod (+ v_prenex_42 1) 2)) (.cse13 (select |c_#memory_int| v_prenex_41)) (.cse15 (mod v_prenex_42 2)) (.cse14 (mod (+ v_prenex_40 4294967295) 4294967296))) (and (= .cse12 (select .cse13 (+ v_prenex_43 (* 4 (mod (+ v_prenex_42 4294967295) 4294967296))))) (<= 1000 (mod v_prenex_40 4294967296)) (= (select .cse13 (+ (* 4 (mod (+ v_prenex_42 4294967293) 4294967296)) v_prenex_43)) .cse12) (= (mod (+ v_prenex_40 1) 2) (select .cse13 (+ v_prenex_43 (* 4 .cse14)))) (= (select .cse13 (+ (* 4 (mod (+ v_prenex_42 4294967294) 4294967296)) v_prenex_43)) .cse15) (<= 6 v_prenex_42) (= (select .cse13 (+ v_prenex_43 (* 4 (mod v_prenex_42 4294967296)))) .cse15) (< .cse14 1000) (<= v_prenex_42 6)))) (exists ((v_prenex_34 Int)) (let ((.cse16 (mod (+ v_prenex_34 4294967295) 4294967296))) (and (< .cse16 1000) (<= 1000 (mod v_prenex_34 4294967296)) (= (mod (+ v_prenex_34 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse16) |c_main_~#array~0.offset|)))))) .cse7 (exists ((v_prenex_35 Int)) (let ((.cse18 (mod v_prenex_35 2)) (.cse19 (mod (+ v_prenex_35 1) 2)) (.cse17 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (<= 6 v_prenex_35) (<= v_prenex_35 6) (= (select .cse17 (+ (* 4 (mod (+ v_prenex_35 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse18) (= .cse19 (select .cse17 (+ (* 4 (mod (+ v_prenex_35 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse17 (+ (* 4 (mod v_prenex_35 4294967296)) |c_main_~#array~0.offset|)) .cse18) (= .cse19 (select .cse17 (+ (* 4 (mod (+ v_prenex_35 4294967295) 4294967296)) |c_main_~#array~0.offset|))))))) (and .cse0 (< .cse2 0) (exists ((v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse21 (mod v_prenex_45 2)) (.cse22 (mod (+ v_prenex_44 4294967295) 4294967296)) (.cse23 (mod (+ v_prenex_45 1) 2)) (.cse20 (select |c_#memory_int| v_prenex_47))) (and (= (select .cse20 (+ (* 4 (mod (+ v_prenex_45 4294967294) 4294967296)) v_prenex_46)) .cse21) (= (select .cse20 (+ v_prenex_46 (* 4 (mod v_prenex_45 4294967296)))) .cse21) (< .cse22 1000) (<= 6 v_prenex_45) (= (mod (+ v_prenex_44 1) 2) (select .cse20 (+ v_prenex_46 (* 4 .cse22)))) (= (select .cse20 (+ (* 4 (mod (+ v_prenex_45 4294967293) 4294967296)) v_prenex_46)) .cse23) (<= 1000 (mod v_prenex_44 4294967296)) (= .cse23 (select .cse20 (+ v_prenex_46 (* 4 (mod (+ v_prenex_45 4294967295) 4294967296))))) (<= v_prenex_45 6)))) .cse11 .cse7 (exists ((v_prenex_33 Int)) (let ((.cse24 (mod (+ v_prenex_33 4294967295) 4294967296))) (and (< .cse24 1000) (= (mod (+ v_prenex_33 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse24) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_33 4294967296))))) (exists ((v_prenex_32 Int)) (let ((.cse27 (mod v_prenex_32 2)) (.cse25 (mod (+ v_prenex_32 1) 2)) (.cse26 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= .cse25 (select .cse26 (+ (* 4 (mod (+ v_prenex_32 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse26 (+ (* 4 (mod (+ v_prenex_32 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse27) (<= 6 v_prenex_32) (= (select .cse26 (+ (* 4 (mod v_prenex_32 4294967296)) |c_main_~#array~0.offset|)) .cse27) (= .cse25 (select .cse26 (+ (* 4 (mod (+ v_prenex_32 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (<= v_prenex_32 6)))))))) is different from false [2019-10-02 11:17:50,107 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse28 (mod (+ c_main_~index~0 1) 2))) (let ((.cse5 (mod (+ c_main_~index~0 4294967295) 4294967296)) (.cse0 (not (= 0 .cse28))) (.cse6 (not (= (mod (+ .cse28 4294967294) 4294967296) 0))) (.cse7 (= 2 c_main_~index~0))) (or (and .cse0 (exists ((v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse2 (mod v_prenex_45 2)) (.cse3 (mod (+ v_prenex_44 4294967295) 4294967296)) (.cse4 (mod (+ v_prenex_45 1) 2)) (.cse1 (select |c_#memory_int| v_prenex_47))) (and (= (select .cse1 (+ (* 4 (mod (+ v_prenex_45 4294967294) 4294967296)) v_prenex_46)) .cse2) (= (select .cse1 (+ v_prenex_46 (* 4 (mod v_prenex_45 4294967296)))) .cse2) (< .cse3 1000) (<= 6 v_prenex_45) (= (mod (+ v_prenex_44 1) 2) (select .cse1 (+ v_prenex_46 (* 4 .cse3)))) (= (select .cse1 (+ (* 4 (mod (+ v_prenex_45 4294967293) 4294967296)) v_prenex_46)) .cse4) (<= 1000 (mod v_prenex_44 4294967296)) (= .cse4 (select .cse1 (+ v_prenex_46 (* 4 (mod (+ v_prenex_45 4294967295) 4294967296))))) (<= v_prenex_45 6)))) (< .cse5 0) .cse6 .cse7 (exists ((v_prenex_33 Int)) (let ((.cse8 (mod (+ v_prenex_33 4294967295) 4294967296))) (and (< .cse8 1000) (= (mod (+ v_prenex_33 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse8) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_33 4294967296))))) (exists ((v_prenex_32 Int)) (let ((.cse11 (mod v_prenex_32 2)) (.cse9 (mod (+ v_prenex_32 1) 2)) (.cse10 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= .cse9 (select .cse10 (+ (* 4 (mod (+ v_prenex_32 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse10 (+ (* 4 (mod (+ v_prenex_32 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse11) (<= 6 v_prenex_32) (= (select .cse10 (+ (* 4 (mod v_prenex_32 4294967296)) |c_main_~#array~0.offset|)) .cse11) (= .cse9 (select .cse10 (+ (* 4 (mod (+ v_prenex_32 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (<= v_prenex_32 6))))) (and (exists ((v_prenex_36 Int)) (let ((.cse12 (mod (+ v_prenex_36 4294967295) 4294967296))) (and (<= 1000 (mod v_prenex_36 4294967296)) (= (mod (+ v_prenex_36 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse12) |c_main_~#array~0.offset|))) (< .cse12 1000)))) .cse0 (<= 0 .cse5) (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (v_prenex_38 Int) (v_prenex_39 Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (let ((.cse15 (mod (+ v_prenex_39 1) 2)) (.cse14 (mod v_prenex_39 2)) (.cse13 (select |c_#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|)) (.cse16 (mod (+ v_prenex_38 4294967295) 4294967296))) (and (= (select .cse13 (+ (* 4 (mod (+ v_prenex_39 4294967294) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_11|)) .cse14) (= (select .cse13 (+ (* 4 (mod (+ v_prenex_39 4294967293) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_11|)) .cse15) (<= v_prenex_39 6) (<= 1000 (mod v_prenex_38 4294967296)) (< .cse16 1000) (= .cse15 (select .cse13 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 (mod (+ v_prenex_39 4294967295) 4294967296))))) (= (select .cse13 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 (mod v_prenex_39 4294967296)))) .cse14) (<= 6 v_prenex_39) (= (mod (+ v_prenex_38 1) 2) (select .cse13 (+ |v_main_~#array~0.offset_BEFORE_CALL_11| (* 4 .cse16))))))) .cse7 (exists ((v_prenex_37 Int)) (let ((.cse17 (mod (+ v_prenex_37 1) 2)) (.cse18 (select |c_#memory_int| |c_main_~#array~0.base|)) (.cse19 (mod v_prenex_37 2))) (and (<= 6 v_prenex_37) (= .cse17 (select .cse18 (+ (* 4 (mod (+ v_prenex_37 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (= .cse17 (select .cse18 (+ (* 4 (mod (+ v_prenex_37 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse18 (+ (* 4 (mod (+ v_prenex_37 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse19) (<= v_prenex_37 6) (= (select .cse18 (+ (* 4 (mod v_prenex_37 4294967296)) |c_main_~#array~0.offset|)) .cse19))))) (and .cse0 (exists ((v_prenex_41 Int) (v_prenex_40 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse20 (mod (+ v_prenex_42 1) 2)) (.cse21 (select |c_#memory_int| v_prenex_41)) (.cse23 (mod v_prenex_42 2)) (.cse22 (mod (+ v_prenex_40 4294967295) 4294967296))) (and (= .cse20 (select .cse21 (+ v_prenex_43 (* 4 (mod (+ v_prenex_42 4294967295) 4294967296))))) (<= 1000 (mod v_prenex_40 4294967296)) (= (select .cse21 (+ (* 4 (mod (+ v_prenex_42 4294967293) 4294967296)) v_prenex_43)) .cse20) (= (mod (+ v_prenex_40 1) 2) (select .cse21 (+ v_prenex_43 (* 4 .cse22)))) (= (select .cse21 (+ (* 4 (mod (+ v_prenex_42 4294967294) 4294967296)) v_prenex_43)) .cse23) (<= 6 v_prenex_42) (= (select .cse21 (+ v_prenex_43 (* 4 (mod v_prenex_42 4294967296)))) .cse23) (< .cse22 1000) (<= v_prenex_42 6)))) .cse6 (exists ((v_prenex_34 Int)) (let ((.cse24 (mod (+ v_prenex_34 4294967295) 4294967296))) (and (< .cse24 1000) (<= 1000 (mod v_prenex_34 4294967296)) (= (mod (+ v_prenex_34 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse24) |c_main_~#array~0.offset|)))))) .cse7 (exists ((v_prenex_35 Int)) (let ((.cse26 (mod v_prenex_35 2)) (.cse27 (mod (+ v_prenex_35 1) 2)) (.cse25 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (<= 6 v_prenex_35) (<= v_prenex_35 6) (= (select .cse25 (+ (* 4 (mod (+ v_prenex_35 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse26) (= .cse27 (select .cse25 (+ (* 4 (mod (+ v_prenex_35 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse25 (+ (* 4 (mod v_prenex_35 4294967296)) |c_main_~#array~0.offset|)) .cse26) (= .cse27 (select .cse25 (+ (* 4 (mod (+ v_prenex_35 4294967295) 4294967296)) |c_main_~#array~0.offset|)))))))))) is different from false [2019-10-02 11:18:12,895 WARN L191 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 307 DAG size of output: 61 [2019-10-02 11:18:14,910 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_main_~index~0 2))) (let ((.cse1 (mod c_main_~index~0 4294967296)) (.cse0 (exists ((v_prenex_36 Int)) (let ((.cse10 (mod (+ v_prenex_36 4294967295) 4294967296))) (and (<= 1000 (mod v_prenex_36 4294967296)) (= (mod (+ v_prenex_36 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse10) |c_main_~#array~0.offset|))) (< .cse10 1000))))) (.cse2 (= 2 c_main_~index~0)) (.cse3 (= .cse4 0)) (.cse5 (exists ((v_prenex_37 Int)) (let ((.cse7 (mod (+ v_prenex_37 1) 2)) (.cse8 (select |c_#memory_int| |c_main_~#array~0.base|)) (.cse9 (mod v_prenex_37 2))) (and (<= 6 v_prenex_37) (= .cse7 (select .cse8 (+ (* 4 (mod (+ v_prenex_37 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (= .cse7 (select .cse8 (+ (* 4 (mod (+ v_prenex_37 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse8 (+ (* 4 (mod (+ v_prenex_37 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse9) (<= v_prenex_37 6) (= (select .cse8 (+ (* 4 (mod v_prenex_37 4294967296)) |c_main_~#array~0.offset|)) .cse9))))) (.cse6 (<= .cse4 0))) (or (and .cse0 (< .cse1 0) .cse2 (not .cse3) (<= (mod (+ .cse4 4294967294) 4294967296) 0) .cse5) (and .cse0 (<= 0 .cse1) .cse2 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse5 .cse6)))) is different from false [2019-10-02 11:18:42,923 WARN L191 SmtUtils]: Spent 7.26 s on a formula simplification. DAG size of input: 211 DAG size of output: 61 [2019-10-02 11:18:53,840 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 62 [2019-10-02 11:19:01,328 WARN L191 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-10-02 11:19:01,328 INFO L341 Elim1Store]: treesize reduction 138, result has 57.0 percent of original size [2019-10-02 11:19:01,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 217 [2019-10-02 11:19:01,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:19:03,552 WARN L191 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 77 DAG size of output: 20 [2019-10-02 11:19:03,553 INFO L567 ElimStorePlain]: treesize reduction 219, result has 10.6 percent of original size [2019-10-02 11:19:03,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:19:03,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:117, output treesize:14 [2019-10-02 11:19:08,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:19:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2019-10-02 11:19:14,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:14,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 38 [2019-10-02 11:19:14,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 11:19:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 11:19:14,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=850, Unknown=33, NotChecked=390, Total=1406 [2019-10-02 11:19:14,480 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 38 states. [2019-10-02 11:19:22,607 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-02 11:19:28,879 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-02 11:19:50,412 WARN L191 SmtUtils]: Spent 9.28 s on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2019-10-02 11:20:16,157 WARN L191 SmtUtils]: Spent 6.13 s on a formula simplification that was a NOOP. DAG size: 81 [2019-10-02 11:21:23,840 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-10-02 11:22:06,572 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 61 [2019-10-02 11:22:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:10,731 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2019-10-02 11:22:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 11:22:10,731 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 59 [2019-10-02 11:22:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:10,732 INFO L225 Difference]: With dead ends: 158 [2019-10-02 11:22:10,733 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 11:22:10,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 258.1s TimeCoverageRelationStatistics Valid=229, Invalid=1628, Unknown=59, NotChecked=534, Total=2450 [2019-10-02 11:22:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 11:22:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-10-02 11:22:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 11:22:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2019-10-02 11:22:10,764 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 59 [2019-10-02 11:22:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:10,765 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2019-10-02 11:22:10,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 11:22:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2019-10-02 11:22:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 11:22:10,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:10,766 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:10,766 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash -460428553, now seen corresponding path program 7 times [2019-10-02 11:22:10,767 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:10,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:10,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 8 proven. 100 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:22:10,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:10,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 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 11:22:10,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:22:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:11,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:22:11,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:22:11,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:11,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 11:22:11,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:22:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:22:11,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:22:11,050 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 14 states. [2019-10-02 11:22:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:11,635 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2019-10-02 11:22:11,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:22:11,635 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-10-02 11:22:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:11,636 INFO L225 Difference]: With dead ends: 182 [2019-10-02 11:22:11,636 INFO L226 Difference]: Without dead ends: 115 [2019-10-02 11:22:11,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:22:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-02 11:22:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-10-02 11:22:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-02 11:22:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2019-10-02 11:22:11,650 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 70 [2019-10-02 11:22:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:11,650 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2019-10-02 11:22:11,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:22:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2019-10-02 11:22:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 11:22:11,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:11,652 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:11,652 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash -892250791, now seen corresponding path program 8 times [2019-10-02 11:22:11,653 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:11,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:11,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:22:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 8 proven. 121 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:22:11,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:11,858 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 11:22:11,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:22:11,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:22:11,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:11,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 11:22:11,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:22:11,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:11,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-02 11:22:11,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:22:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:22:11,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:22:11,949 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 15 states. [2019-10-02 11:22:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:12,664 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2019-10-02 11:22:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:22:12,664 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-02 11:22:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:12,668 INFO L225 Difference]: With dead ends: 204 [2019-10-02 11:22:12,668 INFO L226 Difference]: Without dead ends: 122 [2019-10-02 11:22:12,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:22:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-02 11:22:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-10-02 11:22:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-02 11:22:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-10-02 11:22:12,689 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 72 [2019-10-02 11:22:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:12,689 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-10-02 11:22:12,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:22:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-10-02 11:22:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 11:22:12,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:12,694 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:12,694 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash 738406203, now seen corresponding path program 9 times [2019-10-02 11:22:12,695 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:12,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:12,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:12,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:12,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 8 proven. 144 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:22:12,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:12,975 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 11:22:13,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:22:16,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-02 11:22:16,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:16,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 11:22:16,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:22:16,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:16,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-02 11:22:16,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:22:16,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:22:16,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:22:16,445 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 16 states. [2019-10-02 11:22:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:17,423 INFO L93 Difference]: Finished difference Result 216 states and 239 transitions. [2019-10-02 11:22:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:22:17,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-10-02 11:22:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:17,426 INFO L225 Difference]: With dead ends: 216 [2019-10-02 11:22:17,426 INFO L226 Difference]: Without dead ends: 129 [2019-10-02 11:22:17,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:22:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-02 11:22:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2019-10-02 11:22:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-02 11:22:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2019-10-02 11:22:17,451 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 74 [2019-10-02 11:22:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:17,452 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2019-10-02 11:22:17,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:22:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2019-10-02 11:22:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 11:22:17,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:17,454 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:17,454 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash 136714397, now seen corresponding path program 10 times [2019-10-02 11:22:17,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:17,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:22:17,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:17,740 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 11:22:17,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:22:17,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:22:17,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:17,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:22:17,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:22:17,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:17,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-02 11:22:17,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 11:22:17,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 11:22:17,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:22:17,874 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 17 states. [2019-10-02 11:22:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:18,773 INFO L93 Difference]: Finished difference Result 228 states and 253 transitions. [2019-10-02 11:22:18,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:22:18,773 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-02 11:22:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:18,775 INFO L225 Difference]: With dead ends: 228 [2019-10-02 11:22:18,775 INFO L226 Difference]: Without dead ends: 136 [2019-10-02 11:22:18,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:22:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-02 11:22:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2019-10-02 11:22:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-02 11:22:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2019-10-02 11:22:18,792 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 76 [2019-10-02 11:22:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:18,792 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2019-10-02 11:22:18,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 11:22:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2019-10-02 11:22:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 11:22:18,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:18,794 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:18,794 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1731473791, now seen corresponding path program 11 times [2019-10-02 11:22:18,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:18,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:18,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:18,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 8 proven. 196 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:22:19,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:19,048 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 11:22:19,074 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:23:36,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-02 11:23:36,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:23:36,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 11:23:36,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:23:36,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:36,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 11:23:36,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:23:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:23:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:23:36,725 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 18 states. [2019-10-02 11:23:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:37,772 INFO L93 Difference]: Finished difference Result 240 states and 267 transitions. [2019-10-02 11:23:37,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:23:37,772 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-10-02 11:23:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:37,774 INFO L225 Difference]: With dead ends: 240 [2019-10-02 11:23:37,774 INFO L226 Difference]: Without dead ends: 143 [2019-10-02 11:23:37,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:23:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-02 11:23:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-10-02 11:23:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-02 11:23:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2019-10-02 11:23:37,791 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 78 [2019-10-02 11:23:37,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:37,791 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2019-10-02 11:23:37,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:23:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2019-10-02 11:23:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-02 11:23:37,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:37,792 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:23:37,792 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash 991926753, now seen corresponding path program 12 times [2019-10-02 11:23:37,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:37,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:37,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:23:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 8 proven. 225 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:23:38,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:38,084 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 11:23:38,118 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:24:26,570 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-02 11:24:26,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:26,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 11:24:26,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:24:26,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:26,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-02 11:24:26,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:24:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:24:26,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:24:26,677 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 19 states. [2019-10-02 11:24:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:27,898 INFO L93 Difference]: Finished difference Result 252 states and 281 transitions. [2019-10-02 11:24:27,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:24:27,899 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2019-10-02 11:24:27,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:27,901 INFO L225 Difference]: With dead ends: 252 [2019-10-02 11:24:27,901 INFO L226 Difference]: Without dead ends: 150 [2019-10-02 11:24:27,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:24:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-02 11:24:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-10-02 11:24:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-02 11:24:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2019-10-02 11:24:27,918 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 80 [2019-10-02 11:24:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:27,919 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2019-10-02 11:24:27,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:24:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2019-10-02 11:24:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 11:24:27,920 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:27,920 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:27,920 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1043172925, now seen corresponding path program 13 times [2019-10-02 11:24:27,921 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:27,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:27,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:27,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:27,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 8 proven. 256 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:24:28,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:28,221 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 11:24:28,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:28,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 11:24:28,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:24:28,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:28,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 11:24:28,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:24:28,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:24:28,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:24:28,322 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 20 states. [2019-10-02 11:24:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:29,607 INFO L93 Difference]: Finished difference Result 264 states and 295 transitions. [2019-10-02 11:24:29,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:24:29,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-10-02 11:24:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:29,610 INFO L225 Difference]: With dead ends: 264 [2019-10-02 11:24:29,610 INFO L226 Difference]: Without dead ends: 157 [2019-10-02 11:24:29,611 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:24:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-02 11:24:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-10-02 11:24:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-02 11:24:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2019-10-02 11:24:29,628 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 82 [2019-10-02 11:24:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:29,629 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2019-10-02 11:24:29,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:24:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2019-10-02 11:24:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 11:24:29,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:29,630 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:29,630 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:29,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1731123493, now seen corresponding path program 14 times [2019-10-02 11:24:29,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:29,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:29,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:29,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:29,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 8 proven. 289 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:24:29,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:29,947 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 11:24:29,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:24:30,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:24:30,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:30,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 11:24:30,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:24:30,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:30,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-02 11:24:30,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:24:30,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:24:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:24:30,073 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand 21 states. [2019-10-02 11:24:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:31,519 INFO L93 Difference]: Finished difference Result 276 states and 309 transitions. [2019-10-02 11:24:31,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:24:31,520 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2019-10-02 11:24:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:31,521 INFO L225 Difference]: With dead ends: 276 [2019-10-02 11:24:31,521 INFO L226 Difference]: Without dead ends: 164 [2019-10-02 11:24:31,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:24:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-02 11:24:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2019-10-02 11:24:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-02 11:24:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-10-02 11:24:31,547 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 84 [2019-10-02 11:24:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:31,547 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-10-02 11:24:31,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:24:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-10-02 11:24:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 11:24:31,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:31,548 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:31,548 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:31,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:31,549 INFO L82 PathProgramCache]: Analyzing trace with hash 655290375, now seen corresponding path program 15 times [2019-10-02 11:24:31,549 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:31,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:31,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:31,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:31,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 8 proven. 324 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:24:31,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:31,919 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 11:24:31,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:24:52,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-02 11:24:52,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:52,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 11:24:52,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:24:52,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:52,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-02 11:24:52,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 11:24:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 11:24:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:24:52,274 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 22 states. [2019-10-02 11:24:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:53,958 INFO L93 Difference]: Finished difference Result 288 states and 323 transitions. [2019-10-02 11:24:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:24:53,959 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2019-10-02 11:24:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:53,961 INFO L225 Difference]: With dead ends: 288 [2019-10-02 11:24:53,961 INFO L226 Difference]: Without dead ends: 171 [2019-10-02 11:24:53,964 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:24:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-02 11:24:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-02 11:24:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-02 11:24:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2019-10-02 11:24:53,990 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 86 [2019-10-02 11:24:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:53,990 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2019-10-02 11:24:53,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 11:24:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2019-10-02 11:24:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 11:24:53,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:53,992 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:53,992 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:53,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1866782313, now seen corresponding path program 16 times [2019-10-02 11:24:53,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:53,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:54,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:54,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:54,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 8 proven. 361 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:24:54,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:54,461 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 11:24:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:24:54,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:24:54,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:54,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 11:24:54,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:24:54,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:54,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 11:24:54,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:24:54,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:24:54,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:24:54,584 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 23 states. [2019-10-02 11:24:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:56,314 INFO L93 Difference]: Finished difference Result 300 states and 337 transitions. [2019-10-02 11:24:56,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 11:24:56,315 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2019-10-02 11:24:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:56,316 INFO L225 Difference]: With dead ends: 300 [2019-10-02 11:24:56,316 INFO L226 Difference]: Without dead ends: 178 [2019-10-02 11:24:56,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:24:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-02 11:24:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2019-10-02 11:24:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-02 11:24:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 192 transitions. [2019-10-02 11:24:56,345 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 192 transitions. Word has length 88 [2019-10-02 11:24:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:56,345 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 192 transitions. [2019-10-02 11:24:56,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:24:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 192 transitions. [2019-10-02 11:24:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 11:24:56,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:56,347 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:56,347 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2120569781, now seen corresponding path program 17 times [2019-10-02 11:24:56,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:56,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:56,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:56,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:56,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 8 proven. 400 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:24:56,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:56,807 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 11:24:56,846 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:27:33,168 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-02 11:27:33,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:27:33,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 11:27:33,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:27:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:27:33,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:27:33,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 11:27:33,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 11:27:33,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 11:27:33,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:27:33,238 INFO L87 Difference]: Start difference. First operand 174 states and 192 transitions. Second operand 24 states. [2019-10-02 11:27:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:35,141 INFO L93 Difference]: Finished difference Result 312 states and 351 transitions. [2019-10-02 11:27:35,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:27:35,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2019-10-02 11:27:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:35,147 INFO L225 Difference]: With dead ends: 312 [2019-10-02 11:27:35,147 INFO L226 Difference]: Without dead ends: 185 [2019-10-02 11:27:35,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:27:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-02 11:27:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2019-10-02 11:27:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-02 11:27:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 200 transitions. [2019-10-02 11:27:35,168 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 200 transitions. Word has length 90 [2019-10-02 11:27:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:35,169 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 200 transitions. [2019-10-02 11:27:35,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 11:27:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 200 transitions. [2019-10-02 11:27:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 11:27:35,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:35,170 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:35,170 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1439863213, now seen corresponding path program 18 times [2019-10-02 11:27:35,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:35,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:35,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:35,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:27:35,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 8 proven. 441 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:27:35,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:27:35,597 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 11:27:35,626 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:28:59,054 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-10-02 11:28:59,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:59,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 11:28:59,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:28:59,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:59,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-02 11:28:59,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 11:28:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 11:28:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:28:59,160 INFO L87 Difference]: Start difference. First operand 181 states and 200 transitions. Second operand 25 states. [2019-10-02 11:29:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:01,313 INFO L93 Difference]: Finished difference Result 324 states and 365 transitions. [2019-10-02 11:29:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 11:29:01,317 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-10-02 11:29:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:01,318 INFO L225 Difference]: With dead ends: 324 [2019-10-02 11:29:01,318 INFO L226 Difference]: Without dead ends: 192 [2019-10-02 11:29:01,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:29:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-02 11:29:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2019-10-02 11:29:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-02 11:29:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2019-10-02 11:29:01,337 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 92 [2019-10-02 11:29:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:01,338 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2019-10-02 11:29:01,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 11:29:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2019-10-02 11:29:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 11:29:01,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:01,339 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:01,339 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash -72964465, now seen corresponding path program 19 times [2019-10-02 11:29:01,339 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:01,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:01,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 8 proven. 484 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:29:01,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:01,798 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 11:29:01,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:01,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-02 11:29:01,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:29:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 11:29:01,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 11:29:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 11:29:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:29:01,936 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand 26 states.