/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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:47:41,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:47:41,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:47:41,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:47:41,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:47:41,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:47:41,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:47:41,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:47:41,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:47:41,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:47:41,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:47:41,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:47:41,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:47:41,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:47:41,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:47:41,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:47:41,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:47:41,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:47:41,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:47:41,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:47:41,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:47:41,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:47:41,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:47:41,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:47:41,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:47:41,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:47:41,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:47:41,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:47:41,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:47:41,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:47:41,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:47:41,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:47:41,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:47:41,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:47:41,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:47:41,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:47:41,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:47:41,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:47:41,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:47:41,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:47:41,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:47:41,661 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 03:47:41,681 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:47:41,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:47:41,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:47:41,685 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:47:41,686 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:47:41,686 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:47:41,686 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:47:41,686 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:47:41,686 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:47:41,687 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:47:41,687 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:47:41,687 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:47:41,687 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:47:41,687 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:47:41,688 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:47:41,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:47:41,688 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:47:41,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:47:41,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:47:41,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:47:41,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:47:41,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:47:41,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:47:41,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:47:41,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:47:41,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:47:41,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:47:41,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:47:41,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:47:41,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:47:41,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:47:41,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:47:41,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:47:41,695 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:47:41,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:47:41,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:47:41,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:47:41,696 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:47:41,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:47:42,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:47:42,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:47:42,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:47:42,012 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:47:42,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i [2019-11-24 03:47:42,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8851d7b39/ebd96cec61694775af051e93bee9c06d/FLAGd9279f70e [2019-11-24 03:47:42,963 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:47:42,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i [2019-11-24 03:47:43,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8851d7b39/ebd96cec61694775af051e93bee9c06d/FLAGd9279f70e [2019-11-24 03:47:43,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8851d7b39/ebd96cec61694775af051e93bee9c06d [2019-11-24 03:47:43,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:47:43,490 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:47:43,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:47:43,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:47:43,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:47:43,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:47:43" (1/1) ... [2019-11-24 03:47:43,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429c8cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:43, skipping insertion in model container [2019-11-24 03:47:43,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:47:43" (1/1) ... [2019-11-24 03:47:43,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:47:43,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:47:45,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:47:45,494 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:47:45,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:47:45,976 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:47:45,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45 WrapperNode [2019-11-24 03:47:45,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:47:45,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:47:45,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:47:45,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:47:45,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:46,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:47,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:47:47,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:47:47,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:47:47,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:47:47,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:47,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:47,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:47,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:47,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:47,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:47,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (1/1) ... [2019-11-24 03:47:48,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:47:48,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:47:48,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:47:48,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:47:48,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (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 03:47:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 03:47:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 03:47:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:47:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 03:47:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:47:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:47:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:47:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:47:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 03:47:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:47:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:48:25,968 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:48:25,968 INFO L284 CfgBuilder]: Removed 6814 assume(true) statements. [2019-11-24 03:48:25,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:48:25 BoogieIcfgContainer [2019-11-24 03:48:25,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:48:25,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:48:25,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:48:25,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:48:25,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:47:43" (1/3) ... [2019-11-24 03:48:25,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b39238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:48:25, skipping insertion in model container [2019-11-24 03:48:25,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:47:45" (2/3) ... [2019-11-24 03:48:25,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b39238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:48:25, skipping insertion in model container [2019-11-24 03:48:25,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:48:25" (3/3) ... [2019-11-24 03:48:25,979 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--net--ethernet--realtek--atp.ko-entry_point.cil.out.i [2019-11-24 03:48:25,988 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:48:25,996 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-24 03:48:26,006 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-24 03:48:26,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:48:26,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:48:26,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:48:26,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:48:26,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:48:26,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:48:26,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:48:26,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:48:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states. [2019-11-24 03:48:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 03:48:26,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:26,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:26,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:26,089 INFO L82 PathProgramCache]: Analyzing trace with hash 835685828, now seen corresponding path program 1 times [2019-11-24 03:48:26,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:26,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278560815] [2019-11-24 03:48:26,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:26,670 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 03:48:26,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278560815] [2019-11-24 03:48:26,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:26,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:48:26,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203417163] [2019-11-24 03:48:26,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:48:26,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:26,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:48:26,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:48:26,697 INFO L87 Difference]: Start difference. First operand 514 states. Second operand 4 states. [2019-11-24 03:48:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:27,015 INFO L93 Difference]: Finished difference Result 1557 states and 2554 transitions. [2019-11-24 03:48:27,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:48:27,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-24 03:48:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:27,041 INFO L225 Difference]: With dead ends: 1557 [2019-11-24 03:48:27,041 INFO L226 Difference]: Without dead ends: 1019 [2019-11-24 03:48:27,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:48:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-24 03:48:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 603. [2019-11-24 03:48:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-11-24 03:48:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 987 transitions. [2019-11-24 03:48:27,142 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 987 transitions. Word has length 24 [2019-11-24 03:48:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:27,142 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 987 transitions. [2019-11-24 03:48:27,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:48:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 987 transitions. [2019-11-24 03:48:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 03:48:27,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:27,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:27,152 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1196020657, now seen corresponding path program 1 times [2019-11-24 03:48:27,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:27,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880155600] [2019-11-24 03:48:27,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:27,343 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 03:48:27,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880155600] [2019-11-24 03:48:27,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:27,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:48:27,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093760617] [2019-11-24 03:48:27,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:48:27,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:48:27,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:48:27,348 INFO L87 Difference]: Start difference. First operand 603 states and 987 transitions. Second operand 4 states. [2019-11-24 03:48:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:27,585 INFO L93 Difference]: Finished difference Result 1717 states and 2807 transitions. [2019-11-24 03:48:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:48:27,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-24 03:48:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:27,598 INFO L225 Difference]: With dead ends: 1717 [2019-11-24 03:48:27,598 INFO L226 Difference]: Without dead ends: 1218 [2019-11-24 03:48:27,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:48:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-11-24 03:48:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 990. [2019-11-24 03:48:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-11-24 03:48:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1626 transitions. [2019-11-24 03:48:27,660 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1626 transitions. Word has length 25 [2019-11-24 03:48:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:27,661 INFO L462 AbstractCegarLoop]: Abstraction has 990 states and 1626 transitions. [2019-11-24 03:48:27,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:48:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1626 transitions. [2019-11-24 03:48:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 03:48:27,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:27,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:27,666 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1704765619, now seen corresponding path program 1 times [2019-11-24 03:48:27,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:27,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852682462] [2019-11-24 03:48:27,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:27,849 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 03:48:27,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852682462] [2019-11-24 03:48:27,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:27,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:48:27,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167336981] [2019-11-24 03:48:27,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:48:27,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:27,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:48:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:48:27,853 INFO L87 Difference]: Start difference. First operand 990 states and 1626 transitions. Second operand 4 states. [2019-11-24 03:48:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:28,083 INFO L93 Difference]: Finished difference Result 2006 states and 3291 transitions. [2019-11-24 03:48:28,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:48:28,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-24 03:48:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:28,090 INFO L225 Difference]: With dead ends: 2006 [2019-11-24 03:48:28,090 INFO L226 Difference]: Without dead ends: 1120 [2019-11-24 03:48:28,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:48:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-11-24 03:48:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 898. [2019-11-24 03:48:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-11-24 03:48:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1475 transitions. [2019-11-24 03:48:28,123 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1475 transitions. Word has length 26 [2019-11-24 03:48:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:28,123 INFO L462 AbstractCegarLoop]: Abstraction has 898 states and 1475 transitions. [2019-11-24 03:48:28,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:48:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1475 transitions. [2019-11-24 03:48:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 03:48:28,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:28,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:28,125 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash -866320736, now seen corresponding path program 1 times [2019-11-24 03:48:28,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:28,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542434743] [2019-11-24 03:48:28,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:28,235 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 03:48:28,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542434743] [2019-11-24 03:48:28,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:28,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:48:28,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139764775] [2019-11-24 03:48:28,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:48:28,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:28,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:48:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:48:28,237 INFO L87 Difference]: Start difference. First operand 898 states and 1475 transitions. Second operand 4 states. [2019-11-24 03:48:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:28,679 INFO L93 Difference]: Finished difference Result 1816 states and 2985 transitions. [2019-11-24 03:48:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:48:28,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-24 03:48:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:28,685 INFO L225 Difference]: With dead ends: 1816 [2019-11-24 03:48:28,685 INFO L226 Difference]: Without dead ends: 1022 [2019-11-24 03:48:28,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:48:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-11-24 03:48:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 806. [2019-11-24 03:48:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-11-24 03:48:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1324 transitions. [2019-11-24 03:48:28,715 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1324 transitions. Word has length 27 [2019-11-24 03:48:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:28,715 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1324 transitions. [2019-11-24 03:48:28,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:48:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1324 transitions. [2019-11-24 03:48:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 03:48:28,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:28,717 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:28,717 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:28,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 946611156, now seen corresponding path program 1 times [2019-11-24 03:48:28,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:28,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111094892] [2019-11-24 03:48:28,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 03:48:28,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111094892] [2019-11-24 03:48:28,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:28,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:48:28,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936287733] [2019-11-24 03:48:28,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 03:48:28,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 03:48:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:48:28,898 INFO L87 Difference]: Start difference. First operand 806 states and 1324 transitions. Second operand 5 states. [2019-11-24 03:48:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:29,267 INFO L93 Difference]: Finished difference Result 1932 states and 3157 transitions. [2019-11-24 03:48:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 03:48:29,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-24 03:48:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:29,274 INFO L225 Difference]: With dead ends: 1932 [2019-11-24 03:48:29,275 INFO L226 Difference]: Without dead ends: 1230 [2019-11-24 03:48:29,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 03:48:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-11-24 03:48:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 722. [2019-11-24 03:48:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-11-24 03:48:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1181 transitions. [2019-11-24 03:48:29,315 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1181 transitions. Word has length 31 [2019-11-24 03:48:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:29,316 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1181 transitions. [2019-11-24 03:48:29,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 03:48:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1181 transitions. [2019-11-24 03:48:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 03:48:29,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:29,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:29,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2042669010, now seen corresponding path program 1 times [2019-11-24 03:48:29,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:29,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517633721] [2019-11-24 03:48:29,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:29,443 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 03:48:29,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517633721] [2019-11-24 03:48:29,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:29,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:48:29,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319566846] [2019-11-24 03:48:29,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:48:29,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:29,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:48:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:48:29,446 INFO L87 Difference]: Start difference. First operand 722 states and 1181 transitions. Second operand 3 states. [2019-11-24 03:48:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:29,750 INFO L93 Difference]: Finished difference Result 2052 states and 3336 transitions. [2019-11-24 03:48:29,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:48:29,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 03:48:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:29,760 INFO L225 Difference]: With dead ends: 2052 [2019-11-24 03:48:29,760 INFO L226 Difference]: Without dead ends: 1334 [2019-11-24 03:48:29,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:48:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-11-24 03:48:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1288. [2019-11-24 03:48:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-11-24 03:48:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 2103 transitions. [2019-11-24 03:48:29,821 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 2103 transitions. Word has length 37 [2019-11-24 03:48:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:29,824 INFO L462 AbstractCegarLoop]: Abstraction has 1288 states and 2103 transitions. [2019-11-24 03:48:29,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:48:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 2103 transitions. [2019-11-24 03:48:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 03:48:29,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:29,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:29,829 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:29,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1767239960, now seen corresponding path program 1 times [2019-11-24 03:48:29,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:29,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331914684] [2019-11-24 03:48:29,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:48:29,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331914684] [2019-11-24 03:48:29,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:29,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:48:29,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487662437] [2019-11-24 03:48:29,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:48:29,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:29,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:48:29,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:48:29,992 INFO L87 Difference]: Start difference. First operand 1288 states and 2103 transitions. Second operand 3 states. [2019-11-24 03:48:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:30,104 INFO L93 Difference]: Finished difference Result 2620 states and 4295 transitions. [2019-11-24 03:48:30,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:48:30,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-24 03:48:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:30,111 INFO L225 Difference]: With dead ends: 2620 [2019-11-24 03:48:30,112 INFO L226 Difference]: Without dead ends: 1336 [2019-11-24 03:48:30,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:48:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2019-11-24 03:48:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2019-11-24 03:48:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-11-24 03:48:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2151 transitions. [2019-11-24 03:48:30,163 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2151 transitions. Word has length 59 [2019-11-24 03:48:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:30,163 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 2151 transitions. [2019-11-24 03:48:30,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:48:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2151 transitions. [2019-11-24 03:48:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 03:48:30,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:30,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:30,166 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1243498913, now seen corresponding path program 1 times [2019-11-24 03:48:30,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:30,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544252107] [2019-11-24 03:48:30,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 03:48:30,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544252107] [2019-11-24 03:48:30,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:30,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:48:30,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619415368] [2019-11-24 03:48:30,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:48:30,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:48:30,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:48:30,306 INFO L87 Difference]: Start difference. First operand 1336 states and 2151 transitions. Second operand 4 states. [2019-11-24 03:48:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:30,453 INFO L93 Difference]: Finished difference Result 2704 states and 4343 transitions. [2019-11-24 03:48:30,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:48:30,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-24 03:48:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:30,460 INFO L225 Difference]: With dead ends: 2704 [2019-11-24 03:48:30,461 INFO L226 Difference]: Without dead ends: 1372 [2019-11-24 03:48:30,463 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 03:48:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-11-24 03:48:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1360. [2019-11-24 03:48:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-11-24 03:48:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2175 transitions. [2019-11-24 03:48:30,513 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2175 transitions. Word has length 60 [2019-11-24 03:48:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:30,514 INFO L462 AbstractCegarLoop]: Abstraction has 1360 states and 2175 transitions. [2019-11-24 03:48:30,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:48:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2175 transitions. [2019-11-24 03:48:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 03:48:30,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:30,516 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:30,516 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash 57282710, now seen corresponding path program 1 times [2019-11-24 03:48:30,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:30,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338622887] [2019-11-24 03:48:30,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 03:48:30,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338622887] [2019-11-24 03:48:30,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:30,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:48:30,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246178028] [2019-11-24 03:48:30,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:48:30,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:48:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:48:30,699 INFO L87 Difference]: Start difference. First operand 1360 states and 2175 transitions. Second operand 3 states. [2019-11-24 03:48:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:30,829 INFO L93 Difference]: Finished difference Result 2746 states and 4385 transitions. [2019-11-24 03:48:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:48:30,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-24 03:48:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:30,838 INFO L225 Difference]: With dead ends: 2746 [2019-11-24 03:48:30,838 INFO L226 Difference]: Without dead ends: 1390 [2019-11-24 03:48:30,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:48:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-11-24 03:48:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1366. [2019-11-24 03:48:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2019-11-24 03:48:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2181 transitions. [2019-11-24 03:48:30,889 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2181 transitions. Word has length 62 [2019-11-24 03:48:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:30,889 INFO L462 AbstractCegarLoop]: Abstraction has 1366 states and 2181 transitions. [2019-11-24 03:48:30,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:48:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2181 transitions. [2019-11-24 03:48:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 03:48:30,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:30,892 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:30,892 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1685307363, now seen corresponding path program 1 times [2019-11-24 03:48:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:30,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804978297] [2019-11-24 03:48:30,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 03:48:31,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804978297] [2019-11-24 03:48:31,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:31,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:48:31,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898770086] [2019-11-24 03:48:31,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:48:31,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:31,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:48:31,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:48:31,096 INFO L87 Difference]: Start difference. First operand 1366 states and 2181 transitions. Second operand 4 states. [2019-11-24 03:48:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:31,623 INFO L93 Difference]: Finished difference Result 4108 states and 6518 transitions. [2019-11-24 03:48:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:48:31,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-24 03:48:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:31,637 INFO L225 Difference]: With dead ends: 4108 [2019-11-24 03:48:31,638 INFO L226 Difference]: Without dead ends: 2746 [2019-11-24 03:48:31,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 03:48:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2019-11-24 03:48:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2594. [2019-11-24 03:48:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2594 states. [2019-11-24 03:48:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 4154 transitions. [2019-11-24 03:48:31,735 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 4154 transitions. Word has length 67 [2019-11-24 03:48:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:31,735 INFO L462 AbstractCegarLoop]: Abstraction has 2594 states and 4154 transitions. [2019-11-24 03:48:31,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:48:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 4154 transitions. [2019-11-24 03:48:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-24 03:48:31,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:31,738 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:31,738 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1049144663, now seen corresponding path program 1 times [2019-11-24 03:48:31,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:31,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480924852] [2019-11-24 03:48:31,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-24 03:48:31,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480924852] [2019-11-24 03:48:31,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:48:31,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:48:31,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138101434] [2019-11-24 03:48:31,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:48:31,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:48:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:48:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:48:31,947 INFO L87 Difference]: Start difference. First operand 2594 states and 4154 transitions. Second operand 4 states. [2019-11-24 03:48:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:48:33,181 INFO L93 Difference]: Finished difference Result 5198 states and 8237 transitions. [2019-11-24 03:48:33,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:48:33,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-24 03:48:33,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:48:33,194 INFO L225 Difference]: With dead ends: 5198 [2019-11-24 03:48:33,195 INFO L226 Difference]: Without dead ends: 2978 [2019-11-24 03:48:33,198 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 03:48:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-11-24 03:48:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2850. [2019-11-24 03:48:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2850 states. [2019-11-24 03:48:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 4410 transitions. [2019-11-24 03:48:33,308 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 4410 transitions. Word has length 81 [2019-11-24 03:48:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:48:33,309 INFO L462 AbstractCegarLoop]: Abstraction has 2850 states and 4410 transitions. [2019-11-24 03:48:33,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:48:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 4410 transitions. [2019-11-24 03:48:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-24 03:48:33,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:48:33,312 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:48:33,312 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:48:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:48:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1858886701, now seen corresponding path program 1 times [2019-11-24 03:48:33,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:48:33,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712482522] [2019-11-24 03:48:33,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:48:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-24 03:48:33,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712482522] [2019-11-24 03:48:33,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839246391] [2019-11-24 03:48:33,655 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 03:48:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:48:34,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 2128 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 03:48:34,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:48:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-24 03:48:34,923 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:48:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-24 03:48:34,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1753267000] [2019-11-24 03:48:35,007 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2019-11-24 03:48:35,008 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 03:48:35,014 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 03:48:35,023 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 03:48:35,024 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 03:48:35,842 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:48:36,560 WARN L192 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 1187