/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/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 01:12:45,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 01:12:45,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 01:12:45,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 01:12:45,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 01:12:45,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 01:12:45,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 01:12:45,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 01:12:45,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 01:12:45,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 01:12:45,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 01:12:45,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 01:12:45,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 01:12:45,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 01:12:45,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 01:12:45,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 01:12:45,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 01:12:45,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 01:12:45,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 01:12:45,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 01:12:45,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 01:12:45,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 01:12:45,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 01:12:45,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 01:12:45,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 01:12:45,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 01:12:45,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 01:12:45,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 01:12:45,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 01:12:45,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 01:12:45,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 01:12:45,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 01:12:45,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 01:12:45,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 01:12:45,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 01:12:45,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 01:12:45,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 01:12:45,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 01:12:45,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 01:12:45,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 01:12:45,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 01:12:45,327 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 01:12:45,349 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 01:12:45,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 01:12:45,352 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 01:12:45,352 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 01:12:45,352 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 01:12:45,352 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 01:12:45,352 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 01:12:45,353 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 01:12:45,353 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 01:12:45,353 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 01:12:45,354 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 01:12:45,354 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 01:12:45,354 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 01:12:45,355 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 01:12:45,355 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 01:12:45,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 01:12:45,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 01:12:45,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 01:12:45,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 01:12:45,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 01:12:45,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 01:12:45,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 01:12:45,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 01:12:45,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 01:12:45,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 01:12:45,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 01:12:45,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 01:12:45,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 01:12:45,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 01:12:45,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 01:12:45,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 01:12:45,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 01:12:45,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 01:12:45,362 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 01:12:45,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 01:12:45,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 01:12:45,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 01:12:45,363 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 01:12:45,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 01:12:45,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 01:12:45,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 01:12:45,664 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 01:12:45,665 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 01:12:45,665 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2019-11-24 01:12:45,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e2ff0ad/a544f25e43ba407996792b9d6a089e22/FLAG7a1d1c5f5 [2019-11-24 01:12:46,472 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 01:12:46,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2019-11-24 01:12:46,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e2ff0ad/a544f25e43ba407996792b9d6a089e22/FLAG7a1d1c5f5 [2019-11-24 01:12:46,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e2ff0ad/a544f25e43ba407996792b9d6a089e22 [2019-11-24 01:12:46,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 01:12:46,586 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 01:12:46,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 01:12:46,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 01:12:46,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 01:12:46,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:12:46" (1/1) ... [2019-11-24 01:12:46,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6ce0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:46, skipping insertion in model container [2019-11-24 01:12:46,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:12:46" (1/1) ... [2019-11-24 01:12:46,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 01:12:46,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 01:12:48,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:12:48,644 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 01:12:48,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:12:49,047 INFO L208 MainTranslator]: Completed translation [2019-11-24 01:12:49,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49 WrapperNode [2019-11-24 01:12:49,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 01:12:49,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 01:12:49,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 01:12:49,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 01:12:49,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 01:12:49,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 01:12:49,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 01:12:49,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 01:12:49,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (1/1) ... [2019-11-24 01:12:49,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 01:12:49,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 01:12:49,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 01:12:49,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 01:12:49,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (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 01:12:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-24 01:12:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-24 01:12:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-24 01:12:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 01:12:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 01:12:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 01:12:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 01:12:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 01:12:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-11-24 01:12:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 01:12:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 01:12:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 01:12:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 01:12:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-24 01:12:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 01:12:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 01:13:20,788 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 01:13:20,788 INFO L284 CfgBuilder]: Removed 1004 assume(true) statements. [2019-11-24 01:13:20,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:13:20 BoogieIcfgContainer [2019-11-24 01:13:20,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 01:13:20,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 01:13:20,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 01:13:20,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 01:13:20,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:12:46" (1/3) ... [2019-11-24 01:13:20,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a04130e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:13:20, skipping insertion in model container [2019-11-24 01:13:20,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:12:49" (2/3) ... [2019-11-24 01:13:20,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a04130e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:13:20, skipping insertion in model container [2019-11-24 01:13:20,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:13:20" (3/3) ... [2019-11-24 01:13:20,804 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2019-11-24 01:13:20,819 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 01:13:20,833 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-11-24 01:13:20,847 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-11-24 01:13:20,897 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 01:13:20,898 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 01:13:20,898 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 01:13:20,898 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 01:13:20,898 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 01:13:20,899 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 01:13:20,899 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 01:13:20,899 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 01:13:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states. [2019-11-24 01:13:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-24 01:13:20,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:20,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-24 01:13:20,957 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash 136591594, now seen corresponding path program 1 times [2019-11-24 01:13:20,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:20,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254728486] [2019-11-24 01:13:20,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:21,399 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 01:13:21,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254728486] [2019-11-24 01:13:21,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:21,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:13:21,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769447987] [2019-11-24 01:13:21,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:13:21,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:21,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:13:21,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:13:21,426 INFO L87 Difference]: Start difference. First operand 299 states. Second operand 3 states. [2019-11-24 01:13:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:21,526 INFO L93 Difference]: Finished difference Result 594 states and 999 transitions. [2019-11-24 01:13:21,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:13:21,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-24 01:13:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:21,555 INFO L225 Difference]: With dead ends: 594 [2019-11-24 01:13:21,555 INFO L226 Difference]: Without dead ends: 295 [2019-11-24 01:13:21,561 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 01:13:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-24 01:13:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-11-24 01:13:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-24 01:13:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 485 transitions. [2019-11-24 01:13:21,638 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 485 transitions. Word has length 4 [2019-11-24 01:13:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:21,638 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 485 transitions. [2019-11-24 01:13:21,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:13:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 485 transitions. [2019-11-24 01:13:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 01:13:21,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:21,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 01:13:21,640 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash -60625254, now seen corresponding path program 1 times [2019-11-24 01:13:21,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:21,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611714856] [2019-11-24 01:13:21,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:21,730 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 01:13:21,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611714856] [2019-11-24 01:13:21,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:21,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:13:21,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397362187] [2019-11-24 01:13:21,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:13:21,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:13:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:13:21,733 INFO L87 Difference]: Start difference. First operand 295 states and 485 transitions. Second operand 3 states. [2019-11-24 01:13:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:21,750 INFO L93 Difference]: Finished difference Result 295 states and 485 transitions. [2019-11-24 01:13:21,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:13:21,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-24 01:13:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:21,753 INFO L225 Difference]: With dead ends: 295 [2019-11-24 01:13:21,754 INFO L226 Difference]: Without dead ends: 293 [2019-11-24 01:13:21,755 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 01:13:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-24 01:13:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-11-24 01:13:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-24 01:13:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 483 transitions. [2019-11-24 01:13:21,776 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 483 transitions. Word has length 5 [2019-11-24 01:13:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:21,776 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 483 transitions. [2019-11-24 01:13:21,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:13:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 483 transitions. [2019-11-24 01:13:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 01:13:21,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:21,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 01:13:21,778 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1879380236, now seen corresponding path program 1 times [2019-11-24 01:13:21,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:21,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905396558] [2019-11-24 01:13:21,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:21,852 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 01:13:21,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905396558] [2019-11-24 01:13:21,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:21,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:13:21,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320088368] [2019-11-24 01:13:21,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:13:21,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:21,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:13:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:13:21,855 INFO L87 Difference]: Start difference. First operand 293 states and 483 transitions. Second operand 3 states. [2019-11-24 01:13:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:21,936 INFO L93 Difference]: Finished difference Result 340 states and 548 transitions. [2019-11-24 01:13:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:13:21,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-24 01:13:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:21,942 INFO L225 Difference]: With dead ends: 340 [2019-11-24 01:13:21,942 INFO L226 Difference]: Without dead ends: 326 [2019-11-24 01:13:21,943 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 01:13:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-24 01:13:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2019-11-24 01:13:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-11-24 01:13:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 532 transitions. [2019-11-24 01:13:21,981 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 532 transitions. Word has length 6 [2019-11-24 01:13:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:21,982 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 532 transitions. [2019-11-24 01:13:21,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:13:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 532 transitions. [2019-11-24 01:13:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 01:13:21,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:21,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:13:21,984 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1255944361, now seen corresponding path program 1 times [2019-11-24 01:13:21,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:21,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963621107] [2019-11-24 01:13:21,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:22,149 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 01:13:22,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963621107] [2019-11-24 01:13:22,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:22,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:13:22,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049336046] [2019-11-24 01:13:22,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:13:22,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:13:22,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:13:22,154 INFO L87 Difference]: Start difference. First operand 326 states and 532 transitions. Second operand 3 states. [2019-11-24 01:13:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:22,250 INFO L93 Difference]: Finished difference Result 880 states and 1459 transitions. [2019-11-24 01:13:22,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:13:22,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 01:13:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:22,254 INFO L225 Difference]: With dead ends: 880 [2019-11-24 01:13:22,255 INFO L226 Difference]: Without dead ends: 556 [2019-11-24 01:13:22,260 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 01:13:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-24 01:13:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 548. [2019-11-24 01:13:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-24 01:13:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 917 transitions. [2019-11-24 01:13:22,293 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 917 transitions. Word has length 16 [2019-11-24 01:13:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:22,294 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 917 transitions. [2019-11-24 01:13:22,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:13:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 917 transitions. [2019-11-24 01:13:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 01:13:22,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:22,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:13:22,300 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1452432752, now seen corresponding path program 1 times [2019-11-24 01:13:22,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:22,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685390049] [2019-11-24 01:13:22,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:22,439 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 01:13:22,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685390049] [2019-11-24 01:13:22,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:22,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:13:22,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840019957] [2019-11-24 01:13:22,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:13:22,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:22,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:13:22,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:22,443 INFO L87 Difference]: Start difference. First operand 548 states and 917 transitions. Second operand 4 states. [2019-11-24 01:13:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:22,592 INFO L93 Difference]: Finished difference Result 640 states and 1056 transitions. [2019-11-24 01:13:22,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:13:22,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 01:13:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:22,596 INFO L225 Difference]: With dead ends: 640 [2019-11-24 01:13:22,596 INFO L226 Difference]: Without dead ends: 636 [2019-11-24 01:13:22,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-11-24 01:13:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 544. [2019-11-24 01:13:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-11-24 01:13:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 911 transitions. [2019-11-24 01:13:22,632 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 911 transitions. Word has length 18 [2019-11-24 01:13:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:22,633 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 911 transitions. [2019-11-24 01:13:22,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:13:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 911 transitions. [2019-11-24 01:13:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 01:13:22,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:22,640 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:13:22,640 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2093299187, now seen corresponding path program 1 times [2019-11-24 01:13:22,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:22,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065542560] [2019-11-24 01:13:22,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 01:13:22,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065542560] [2019-11-24 01:13:22,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:22,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:13:22,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309278022] [2019-11-24 01:13:22,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:13:22,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:22,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:13:22,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:22,830 INFO L87 Difference]: Start difference. First operand 544 states and 911 transitions. Second operand 4 states. [2019-11-24 01:13:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:22,984 INFO L93 Difference]: Finished difference Result 990 states and 1678 transitions. [2019-11-24 01:13:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:13:22,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-24 01:13:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:22,990 INFO L225 Difference]: With dead ends: 990 [2019-11-24 01:13:22,991 INFO L226 Difference]: Without dead ends: 988 [2019-11-24 01:13:22,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-11-24 01:13:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 542. [2019-11-24 01:13:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-24 01:13:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 909 transitions. [2019-11-24 01:13:23,053 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 909 transitions. Word has length 21 [2019-11-24 01:13:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:23,054 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 909 transitions. [2019-11-24 01:13:23,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:13:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 909 transitions. [2019-11-24 01:13:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 01:13:23,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:23,055 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:13:23,056 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1276767099, now seen corresponding path program 1 times [2019-11-24 01:13:23,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:23,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539491514] [2019-11-24 01:13:23,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 01:13:23,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539491514] [2019-11-24 01:13:23,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:23,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:13:23,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436167151] [2019-11-24 01:13:23,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:13:23,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:23,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:13:23,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:23,348 INFO L87 Difference]: Start difference. First operand 542 states and 909 transitions. Second operand 4 states. [2019-11-24 01:13:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:23,534 INFO L93 Difference]: Finished difference Result 996 states and 1692 transitions. [2019-11-24 01:13:23,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:13:23,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-24 01:13:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:23,541 INFO L225 Difference]: With dead ends: 996 [2019-11-24 01:13:23,541 INFO L226 Difference]: Without dead ends: 994 [2019-11-24 01:13:23,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-24 01:13:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 540. [2019-11-24 01:13:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-24 01:13:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 907 transitions. [2019-11-24 01:13:23,583 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 907 transitions. Word has length 21 [2019-11-24 01:13:23,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:23,584 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 907 transitions. [2019-11-24 01:13:23,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:13:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 907 transitions. [2019-11-24 01:13:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 01:13:23,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:23,585 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 01:13:23,585 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:23,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1243855180, now seen corresponding path program 1 times [2019-11-24 01:13:23,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:23,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917034002] [2019-11-24 01:13:23,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:23,686 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 01:13:23,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917034002] [2019-11-24 01:13:23,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:23,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:13:23,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629468164] [2019-11-24 01:13:23,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:13:23,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:13:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:23,689 INFO L87 Difference]: Start difference. First operand 540 states and 907 transitions. Second operand 4 states. [2019-11-24 01:13:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:24,073 INFO L93 Difference]: Finished difference Result 612 states and 1007 transitions. [2019-11-24 01:13:24,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:13:24,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-24 01:13:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:24,077 INFO L225 Difference]: With dead ends: 612 [2019-11-24 01:13:24,077 INFO L226 Difference]: Without dead ends: 598 [2019-11-24 01:13:24,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-24 01:13:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 536. [2019-11-24 01:13:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-24 01:13:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 903 transitions. [2019-11-24 01:13:24,121 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 903 transitions. Word has length 21 [2019-11-24 01:13:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:24,121 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 903 transitions. [2019-11-24 01:13:24,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:13:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 903 transitions. [2019-11-24 01:13:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 01:13:24,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:24,123 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:13:24,123 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:24,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:24,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1431301267, now seen corresponding path program 1 times [2019-11-24 01:13:24,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:24,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795775589] [2019-11-24 01:13:24,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 01:13:24,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795775589] [2019-11-24 01:13:24,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:24,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:13:24,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052245160] [2019-11-24 01:13:24,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:13:24,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:24,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:13:24,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:24,202 INFO L87 Difference]: Start difference. First operand 536 states and 903 transitions. Second operand 4 states. [2019-11-24 01:13:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:24,358 INFO L93 Difference]: Finished difference Result 1294 states and 2195 transitions. [2019-11-24 01:13:24,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:13:24,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 01:13:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:24,363 INFO L225 Difference]: With dead ends: 1294 [2019-11-24 01:13:24,363 INFO L226 Difference]: Without dead ends: 760 [2019-11-24 01:13:24,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-24 01:13:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 756. [2019-11-24 01:13:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-11-24 01:13:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1285 transitions. [2019-11-24 01:13:24,424 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1285 transitions. Word has length 26 [2019-11-24 01:13:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:24,426 INFO L462 AbstractCegarLoop]: Abstraction has 756 states and 1285 transitions. [2019-11-24 01:13:24,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:13:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1285 transitions. [2019-11-24 01:13:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 01:13:24,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:24,428 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:13:24,429 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash 760255750, now seen corresponding path program 1 times [2019-11-24 01:13:24,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:24,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582912792] [2019-11-24 01:13:24,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 01:13:24,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582912792] [2019-11-24 01:13:24,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:24,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:13:24,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435175068] [2019-11-24 01:13:24,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:13:24,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:24,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:13:24,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:24,554 INFO L87 Difference]: Start difference. First operand 756 states and 1285 transitions. Second operand 4 states. [2019-11-24 01:13:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:24,766 INFO L93 Difference]: Finished difference Result 1734 states and 2959 transitions. [2019-11-24 01:13:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:13:24,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 01:13:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:24,774 INFO L225 Difference]: With dead ends: 1734 [2019-11-24 01:13:24,775 INFO L226 Difference]: Without dead ends: 980 [2019-11-24 01:13:24,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-11-24 01:13:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 976. [2019-11-24 01:13:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-24 01:13:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1669 transitions. [2019-11-24 01:13:24,891 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1669 transitions. Word has length 26 [2019-11-24 01:13:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:24,891 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1669 transitions. [2019-11-24 01:13:24,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:13:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1669 transitions. [2019-11-24 01:13:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 01:13:24,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:24,893 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:13:24,893 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1385909057, now seen corresponding path program 1 times [2019-11-24 01:13:24,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:24,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753507444] [2019-11-24 01:13:24,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:13:25,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753507444] [2019-11-24 01:13:25,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:13:25,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:13:25,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702168362] [2019-11-24 01:13:25,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:13:25,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:13:25,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:13:25,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:25,157 INFO L87 Difference]: Start difference. First operand 976 states and 1669 transitions. Second operand 4 states. [2019-11-24 01:13:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:13:25,406 INFO L93 Difference]: Finished difference Result 1150 states and 1933 transitions. [2019-11-24 01:13:25,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:13:25,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 01:13:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:13:25,416 INFO L225 Difference]: With dead ends: 1150 [2019-11-24 01:13:25,416 INFO L226 Difference]: Without dead ends: 1136 [2019-11-24 01:13:25,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:13:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-11-24 01:13:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 976. [2019-11-24 01:13:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-24 01:13:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1669 transitions. [2019-11-24 01:13:25,517 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1669 transitions. Word has length 28 [2019-11-24 01:13:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:13:25,517 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1669 transitions. [2019-11-24 01:13:25,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:13:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1669 transitions. [2019-11-24 01:13:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 01:13:25,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:13:25,520 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:13:25,520 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:13:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:13:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1277609435, now seen corresponding path program 1 times [2019-11-24 01:13:25,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:13:25,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195474602] [2019-11-24 01:13:25,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:13:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:13:25,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195474602] [2019-11-24 01:13:25,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838826055] [2019-11-24 01:13:25,638 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 01:13:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:13:26,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 01:13:26,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 01:13:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:13:26,342 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 01:13:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:13:26,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1192073451] [2019-11-24 01:13:26,534 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-24 01:13:26,534 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 01:13:26,540 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 01:13:26,547 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 01:13:26,547 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 01:13:28,567 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 557 [2019-11-24 01:13:29,275 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-11-24 01:13:29,441 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 554 [2019-11-24 01:13:54,049 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 465 [2019-11-24 01:13:56,397 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 1759 DAG size of output: 1759 [2019-11-24 01:13:56,518 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:13:57,692 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 1664 [2019-11-24 01:13:57,789 WARN L227 Elim1Store]: Array PQE input equivalent to false