/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:39:19,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:39:19,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:39:19,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:39:19,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:39:19,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:39:19,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:39:19,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:39:19,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:39:19,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:39:19,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:39:19,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:39:19,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:39:19,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:39:19,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:39:19,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:39:19,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:39:19,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:39:19,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:39:19,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:39:19,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:39:19,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:39:19,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:39:19,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:39:19,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:39:19,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:39:19,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:39:19,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:39:19,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:39:19,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:39:19,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:39:19,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:39:19,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:39:19,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:39:19,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:39:19,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:39:19,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:39:19,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:39:19,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:39:19,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:39:19,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:39:19,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 00:39:19,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:39:19,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:39:19,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:39:19,789 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:39:19,789 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:39:19,789 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:39:19,789 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:39:19,790 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:39:19,794 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:39:19,794 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:39:19,794 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:39:19,794 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:39:19,795 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:39:19,795 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:39:19,795 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:39:19,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:39:19,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:39:19,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:39:19,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:39:19,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:39:19,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:39:19,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:39:19,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:39:19,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:39:19,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:39:19,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:39:19,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:39:19,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:39:19,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:39:19,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:39:19,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:39:19,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:39:19,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:39:19,800 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:39:19,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:39:19,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:39:19,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:39:19,801 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:39:20,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:39:20,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:39:20,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:39:20,117 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:39:20,118 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:39:20,119 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-11-24 00:39:20,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f80ed88/5108d4b37e7d48f7b6c7e131077a821d/FLAGd4f9633ec [2019-11-24 00:39:20,727 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:39:20,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-11-24 00:39:20,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f80ed88/5108d4b37e7d48f7b6c7e131077a821d/FLAGd4f9633ec [2019-11-24 00:39:20,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f80ed88/5108d4b37e7d48f7b6c7e131077a821d [2019-11-24 00:39:21,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:39:21,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:39:21,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:39:21,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:39:21,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:39:21,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:39:20" (1/1) ... [2019-11-24 00:39:21,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e55e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21, skipping insertion in model container [2019-11-24 00:39:21,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:39:20" (1/1) ... [2019-11-24 00:39:21,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:39:21,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:39:21,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:39:21,542 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:39:21,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:39:21,697 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:39:21,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21 WrapperNode [2019-11-24 00:39:21,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:39:21,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:39:21,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:39:21,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:39:21,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:39:21,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:39:21,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:39:21,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:39:21,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (1/1) ... [2019-11-24 00:39:21,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:39:21,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:39:21,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:39:21,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:39:21,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (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-11-24 00:39:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:39:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:39:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:39:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 00:39:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:39:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:39:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:39:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:39:21,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:39:22,944 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:39:22,944 INFO L284 CfgBuilder]: Removed 75 assume(true) statements. [2019-11-24 00:39:22,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:39:22 BoogieIcfgContainer [2019-11-24 00:39:22,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:39:22,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:39:22,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:39:22,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:39:22,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:39:20" (1/3) ... [2019-11-24 00:39:22,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d1d206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:39:22, skipping insertion in model container [2019-11-24 00:39:22,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:21" (2/3) ... [2019-11-24 00:39:22,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d1d206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:39:22, skipping insertion in model container [2019-11-24 00:39:22,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:39:22" (3/3) ... [2019-11-24 00:39:22,953 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-11-24 00:39:22,963 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:39:22,970 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-24 00:39:22,981 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-24 00:39:23,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:39:23,002 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:39:23,002 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:39:23,002 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:39:23,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:39:23,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:39:23,003 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:39:23,003 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:39:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-24 00:39:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:39:23,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:23,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:39:23,030 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash 412758470, now seen corresponding path program 1 times [2019-11-24 00:39:23,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:23,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511627017] [2019-11-24 00:39:23,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:23,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511627017] [2019-11-24 00:39:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:23,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:39:23,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008645411] [2019-11-24 00:39:23,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:39:23,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:23,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:39:23,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:39:23,184 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-11-24 00:39:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:23,214 INFO L93 Difference]: Finished difference Result 165 states and 267 transitions. [2019-11-24 00:39:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:39:23,216 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-24 00:39:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:23,228 INFO L225 Difference]: With dead ends: 165 [2019-11-24 00:39:23,228 INFO L226 Difference]: Without dead ends: 79 [2019-11-24 00:39:23,232 INFO L630 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-11-24 00:39:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-24 00:39:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-24 00:39:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-24 00:39:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-11-24 00:39:23,279 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 5 [2019-11-24 00:39:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:23,279 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-11-24 00:39:23,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:39:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-11-24 00:39:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 00:39:23,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:23,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 00:39:23,281 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash -109504029, now seen corresponding path program 1 times [2019-11-24 00:39:23,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:23,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222404051] [2019-11-24 00:39:23,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:23,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222404051] [2019-11-24 00:39:23,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:23,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:39:23,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472777392] [2019-11-24 00:39:23,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:39:23,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:39:23,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:39:23,336 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 3 states. [2019-11-24 00:39:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:23,372 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2019-11-24 00:39:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:39:23,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-24 00:39:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:23,376 INFO L225 Difference]: With dead ends: 157 [2019-11-24 00:39:23,376 INFO L226 Difference]: Without dead ends: 81 [2019-11-24 00:39:23,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 00:39:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-24 00:39:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-24 00:39:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-24 00:39:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-11-24 00:39:23,394 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 6 [2019-11-24 00:39:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:23,395 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-11-24 00:39:23,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:39:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-11-24 00:39:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 00:39:23,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:23,396 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:23,397 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:23,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1225687709, now seen corresponding path program 1 times [2019-11-24 00:39:23,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:23,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113792257] [2019-11-24 00:39:23,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:23,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113792257] [2019-11-24 00:39:23,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:23,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:39:23,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212804959] [2019-11-24 00:39:23,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:39:23,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:39:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:39:23,526 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 4 states. [2019-11-24 00:39:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:23,634 INFO L93 Difference]: Finished difference Result 212 states and 231 transitions. [2019-11-24 00:39:23,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:39:23,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-24 00:39:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:23,637 INFO L225 Difference]: With dead ends: 212 [2019-11-24 00:39:23,637 INFO L226 Difference]: Without dead ends: 206 [2019-11-24 00:39:23,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-24 00:39:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 83. [2019-11-24 00:39:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-24 00:39:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-11-24 00:39:23,649 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 8 [2019-11-24 00:39:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:23,649 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-11-24 00:39:23,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:39:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-11-24 00:39:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:39:23,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:23,650 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:23,650 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash 139321444, now seen corresponding path program 1 times [2019-11-24 00:39:23,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:23,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363926712] [2019-11-24 00:39:23,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 00:39:23,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363926712] [2019-11-24 00:39:23,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:23,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:39:23,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052772684] [2019-11-24 00:39:23,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:39:23,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:39:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:23,748 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 5 states. [2019-11-24 00:39:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:24,008 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2019-11-24 00:39:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:39:24,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 00:39:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:24,010 INFO L225 Difference]: With dead ends: 110 [2019-11-24 00:39:24,010 INFO L226 Difference]: Without dead ends: 108 [2019-11-24 00:39:24,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:39:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-24 00:39:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2019-11-24 00:39:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-24 00:39:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-11-24 00:39:24,018 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 15 [2019-11-24 00:39:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:24,018 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-11-24 00:39:24,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:39:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-11-24 00:39:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:39:24,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:24,019 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:24,019 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:24,023 INFO L82 PathProgramCache]: Analyzing trace with hash 117372431, now seen corresponding path program 1 times [2019-11-24 00:39:24,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:24,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714165548] [2019-11-24 00:39:24,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 00:39:24,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714165548] [2019-11-24 00:39:24,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:24,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:39:24,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113861230] [2019-11-24 00:39:24,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:39:24,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:24,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:39:24,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:24,144 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2019-11-24 00:39:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:24,343 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-11-24 00:39:24,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:39:24,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 00:39:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:24,345 INFO L225 Difference]: With dead ends: 81 [2019-11-24 00:39:24,345 INFO L226 Difference]: Without dead ends: 79 [2019-11-24 00:39:24,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:39:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-24 00:39:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-24 00:39:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-24 00:39:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2019-11-24 00:39:24,358 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 15 [2019-11-24 00:39:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:24,358 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2019-11-24 00:39:24,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:39:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2019-11-24 00:39:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 00:39:24,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:24,362 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:24,363 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1592696504, now seen corresponding path program 1 times [2019-11-24 00:39:24,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:24,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826577264] [2019-11-24 00:39:24,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:24,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826577264] [2019-11-24 00:39:24,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:24,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:39:24,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429502252] [2019-11-24 00:39:24,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:39:24,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:39:24,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:24,484 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 5 states. [2019-11-24 00:39:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:24,778 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2019-11-24 00:39:24,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:39:24,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 00:39:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:24,781 INFO L225 Difference]: With dead ends: 189 [2019-11-24 00:39:24,781 INFO L226 Difference]: Without dead ends: 187 [2019-11-24 00:39:24,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:39:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-24 00:39:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 85. [2019-11-24 00:39:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-24 00:39:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-11-24 00:39:24,790 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 18 [2019-11-24 00:39:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:24,790 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-11-24 00:39:24,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:39:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-11-24 00:39:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 00:39:24,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:24,792 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:24,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:24,792 INFO L82 PathProgramCache]: Analyzing trace with hash 544596794, now seen corresponding path program 1 times [2019-11-24 00:39:24,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:24,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396874154] [2019-11-24 00:39:24,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:24,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396874154] [2019-11-24 00:39:24,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:24,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:39:24,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221510213] [2019-11-24 00:39:24,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:39:24,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:39:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:24,847 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 5 states. [2019-11-24 00:39:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:25,080 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2019-11-24 00:39:25,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:39:25,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 00:39:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:25,082 INFO L225 Difference]: With dead ends: 187 [2019-11-24 00:39:25,082 INFO L226 Difference]: Without dead ends: 185 [2019-11-24 00:39:25,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:39:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-24 00:39:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 91. [2019-11-24 00:39:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-24 00:39:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-11-24 00:39:25,089 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 18 [2019-11-24 00:39:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:25,089 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-11-24 00:39:25,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:39:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-11-24 00:39:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 00:39:25,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:25,090 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:25,090 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1523817848, now seen corresponding path program 1 times [2019-11-24 00:39:25,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:25,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233527381] [2019-11-24 00:39:25,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:25,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233527381] [2019-11-24 00:39:25,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:25,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:39:25,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852572416] [2019-11-24 00:39:25,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:39:25,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:25,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:39:25,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:25,232 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 5 states. [2019-11-24 00:39:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:25,590 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2019-11-24 00:39:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:39:25,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 00:39:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:25,593 INFO L225 Difference]: With dead ends: 185 [2019-11-24 00:39:25,593 INFO L226 Difference]: Without dead ends: 183 [2019-11-24 00:39:25,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:39:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-24 00:39:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 94. [2019-11-24 00:39:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-24 00:39:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-11-24 00:39:25,610 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 21 [2019-11-24 00:39:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:25,610 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-11-24 00:39:25,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:39:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-11-24 00:39:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 00:39:25,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:25,611 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:25,611 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1997516739, now seen corresponding path program 1 times [2019-11-24 00:39:25,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:25,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453389733] [2019-11-24 00:39:25,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:25,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453389733] [2019-11-24 00:39:25,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:25,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:39:25,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237693831] [2019-11-24 00:39:25,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:39:25,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:39:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:25,734 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 5 states. [2019-11-24 00:39:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:26,016 INFO L93 Difference]: Finished difference Result 183 states and 199 transitions. [2019-11-24 00:39:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:39:26,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 00:39:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:26,019 INFO L225 Difference]: With dead ends: 183 [2019-11-24 00:39:26,019 INFO L226 Difference]: Without dead ends: 181 [2019-11-24 00:39:26,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:39:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-24 00:39:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 97. [2019-11-24 00:39:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-24 00:39:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-11-24 00:39:26,026 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 21 [2019-11-24 00:39:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:26,026 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-11-24 00:39:26,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:39:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-11-24 00:39:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 00:39:26,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:26,027 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:26,028 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:26,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:26,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2127549075, now seen corresponding path program 1 times [2019-11-24 00:39:26,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:26,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284645304] [2019-11-24 00:39:26,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:26,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284645304] [2019-11-24 00:39:26,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:26,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:39:26,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790551793] [2019-11-24 00:39:26,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:39:26,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:26,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:39:26,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:39:26,092 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 4 states. [2019-11-24 00:39:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:26,138 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-11-24 00:39:26,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:39:26,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 00:39:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:26,140 INFO L225 Difference]: With dead ends: 127 [2019-11-24 00:39:26,140 INFO L226 Difference]: Without dead ends: 125 [2019-11-24 00:39:26,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-24 00:39:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2019-11-24 00:39:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-24 00:39:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-24 00:39:26,145 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 26 [2019-11-24 00:39:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:26,145 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-24 00:39:26,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:39:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-24 00:39:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 00:39:26,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:26,147 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:26,147 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash -634595089, now seen corresponding path program 1 times [2019-11-24 00:39:26,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:26,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711606842] [2019-11-24 00:39:26,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 00:39:26,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711606842] [2019-11-24 00:39:26,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664392990] [2019-11-24 00:39:26,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:39:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:26,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-24 00:39:26,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:39:26,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:26,385 INFO L377 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 29 treesize of output 23 [2019-11-24 00:39:26,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:39:26,399 INFO L377 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 29 treesize of output 17 [2019-11-24 00:39:26,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:39:26,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:39:26,436 INFO L377 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 14 treesize of output 8 [2019-11-24 00:39:26,437 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:39:26,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-24 00:39:26,440 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:39:26,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:39:26,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 00:39:26,445 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:9 [2019-11-24 00:39:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 00:39:26,449 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:39:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 00:39:26,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193796538] [2019-11-24 00:39:26,508 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2019-11-24 00:39:26,508 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:39:26,514 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:39:26,521 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:39:26,522 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:39:26,627 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:26,687 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:26,698 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:27,099 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:27,138 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:27,154 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:27,393 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:27,980 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:27,995 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:29,077 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-24 00:39:30,459 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:30,486 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:31,085 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:31,197 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 383 [2019-11-24 00:39:34,229 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:34,251 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:34,272 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:40,659 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:40,690 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:40,711 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:42,802 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-24 00:39:47,443 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-11-24 00:39:50,997 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-24 00:39:51,240 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-24 00:39:54,595 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,638 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,679 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,721 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,762 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,802 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,843 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,883 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,919 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,953 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:54,983 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,013 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,051 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,079 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,112 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,139 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,178 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,208 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,239 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,266 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,292 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,318 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,343 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,372 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,396 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,430 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,463 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,488 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,510 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,534 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,559 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,591 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,625 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,658 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,685 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,714 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,740 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,766 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,790 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:55,813 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:57,152 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:57,174 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:57,197 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:57,217 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:57,248 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:57,623 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:57,654 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:58,206 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:58,230 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:58,265 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:58,285 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:58,306 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:58,902 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:39:58,928 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:40:00,815 WARN L192 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 118 [2019-11-24 00:40:01,389 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-24 00:40:02,281 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-11-24 00:40:02,765 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-11-24 00:40:14,677 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 198 DAG size of output: 198