./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9caca1067e52a4490439beb955df6129aef4eea8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:04:52,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:04:52,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:04:52,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:04:52,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:04:52,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:04:52,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:04:52,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:04:52,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:04:52,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:04:52,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:04:52,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:04:52,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:04:52,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:04:52,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:04:52,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:04:52,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:04:52,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:04:52,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:04:52,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:04:52,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:04:52,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:04:52,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:04:52,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:04:52,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:04:52,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:04:52,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:04:52,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:04:52,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:04:52,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:04:52,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:04:52,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:04:52,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:04:52,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:04:52,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:04:52,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:04:52,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:04:52,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:04:52,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:04:52,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:04:52,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:04:52,551 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:04:52,575 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:04:52,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:04:52,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:04:52,576 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:04:52,577 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:04:52,577 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:04:52,577 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:04:52,577 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:04:52,577 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:04:52,577 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:04:52,578 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:04:52,578 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:04:52,578 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:04:52,578 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:04:52,578 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:04:52,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:04:52,579 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:04:52,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:04:52,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:04:52,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:04:52,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:04:52,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:04:52,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:04:52,580 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:04:52,581 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:04:52,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:04:52,581 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:04:52,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:04:52,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:04:52,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:04:52,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:04:52,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:04:52,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:04:52,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:04:52,583 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:04:52,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:04:52,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:04:52,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:04:52,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:04:52,583 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9caca1067e52a4490439beb955df6129aef4eea8 [2021-10-13 07:04:52,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:04:52,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:04:52,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:04:52,846 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:04:52,846 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:04:52,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-10-13 07:04:52,954 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/data/3db53c2cc/f1f49c166efb469db694fe2a038325ca/FLAGe4f2024c4 [2021-10-13 07:04:53,452 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:04:53,452 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-10-13 07:04:53,466 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/data/3db53c2cc/f1f49c166efb469db694fe2a038325ca/FLAGe4f2024c4 [2021-10-13 07:04:53,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/data/3db53c2cc/f1f49c166efb469db694fe2a038325ca [2021-10-13 07:04:53,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:04:53,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:04:53,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:04:53,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:04:53,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:04:53,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:04:53" (1/1) ... [2021-10-13 07:04:53,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a39c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:53, skipping insertion in model container [2021-10-13 07:04:53,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:04:53" (1/1) ... [2021-10-13 07:04:53,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:04:53,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:04:54,045 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-10-13 07:04:54,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:04:54,230 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:04:54,262 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-10-13 07:04:54,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:04:54,396 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:04:54,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54 WrapperNode [2021-10-13 07:04:54,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:04:54,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:04:54,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:04:54,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:04:54,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:04:54,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:04:54,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:04:54,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:04:54,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:04:54,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:04:54,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:04:54,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:04:54,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (1/1) ... [2021-10-13 07:04:54,632 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:04:54,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:04:54,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:04:54,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:04:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:04:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:04:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:04:54,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:04:54,979 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:54,986 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:54,993 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:54,998 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,001 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,005 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,010 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,015 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,017 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,018 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,025 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,031 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,033 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,034 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,039 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,044 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,053 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,061 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,067 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,074 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,082 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,085 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,087 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:55,093 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:04:56,097 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-10-13 07:04:56,097 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-10-13 07:04:56,098 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-10-13 07:04:56,098 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-10-13 07:04:56,098 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-10-13 07:04:56,098 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-10-13 07:04:56,098 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-10-13 07:04:56,098 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-10-13 07:04:56,099 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-10-13 07:04:56,099 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-10-13 07:04:56,099 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-10-13 07:04:56,099 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-13 07:04:56,099 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-13 07:04:56,100 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-10-13 07:04:56,100 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-10-13 07:04:56,100 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-10-13 07:04:56,100 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-10-13 07:04:56,100 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-10-13 07:04:56,101 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-10-13 07:04:56,101 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-10-13 07:04:56,101 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-10-13 07:04:56,101 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-10-13 07:04:56,102 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-13 07:04:56,102 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-13 07:04:56,102 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-10-13 07:04:56,103 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-10-13 07:04:56,103 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-10-13 07:04:56,103 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-10-13 07:04:56,103 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-10-13 07:04:56,104 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-10-13 07:04:56,104 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-10-13 07:04:56,104 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-10-13 07:04:56,104 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-10-13 07:04:56,104 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-10-13 07:04:56,105 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-10-13 07:04:56,105 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-10-13 07:04:56,105 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-10-13 07:04:56,105 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-10-13 07:04:56,105 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-10-13 07:04:56,106 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-10-13 07:04:56,106 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-10-13 07:04:56,106 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-10-13 07:04:56,107 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-10-13 07:04:56,107 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-10-13 07:04:56,107 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-10-13 07:04:56,107 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-10-13 07:04:56,107 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-10-13 07:04:56,107 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-10-13 07:04:56,987 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:04:56,988 INFO L299 CfgBuilder]: Removed 205 assume(true) statements. [2021-10-13 07:04:56,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:04:56 BoogieIcfgContainer [2021-10-13 07:04:56,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:04:56,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:04:56,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:04:56,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:04:57,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:04:53" (1/3) ... [2021-10-13 07:04:57,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e6b158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:04:57, skipping insertion in model container [2021-10-13 07:04:57,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:04:54" (2/3) ... [2021-10-13 07:04:57,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e6b158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:04:57, skipping insertion in model container [2021-10-13 07:04:57,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:04:56" (3/3) ... [2021-10-13 07:04:57,007 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2021-10-13 07:04:57,017 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:04:57,017 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2021-10-13 07:04:57,086 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:04:57,092 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:04:57,093 INFO L340 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2021-10-13 07:04:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 214 states have (on average 1.7757009345794392) internal successors, (380), 254 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 07:04:57,118 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:57,119 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:57,120 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash 119908539, now seen corresponding path program 1 times [2021-10-13 07:04:57,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:57,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421601342] [2021-10-13 07:04:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:57,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:57,402 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:57,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421601342] [2021-10-13 07:04:57,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421601342] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:57,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:57,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:57,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369508423] [2021-10-13 07:04:57,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:57,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:57,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:57,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:57,426 INFO L87 Difference]: Start difference. First operand has 255 states, 214 states have (on average 1.7757009345794392) internal successors, (380), 254 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:57,698 INFO L93 Difference]: Finished difference Result 480 states and 716 transitions. [2021-10-13 07:04:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:57,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 07:04:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:57,727 INFO L225 Difference]: With dead ends: 480 [2021-10-13 07:04:57,727 INFO L226 Difference]: Without dead ends: 256 [2021-10-13 07:04:57,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-13 07:04:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-10-13 07:04:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.4912280701754386) internal successors, (340), 255 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 340 transitions. [2021-10-13 07:04:57,804 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 340 transitions. Word has length 7 [2021-10-13 07:04:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:57,805 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 340 transitions. [2021-10-13 07:04:57,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 340 transitions. [2021-10-13 07:04:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:04:57,806 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:57,806 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:57,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:04:57,807 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash -672701586, now seen corresponding path program 1 times [2021-10-13 07:04:57,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:57,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843174404] [2021-10-13 07:04:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:57,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:57,895 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:57,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843174404] [2021-10-13 07:04:57,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843174404] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:57,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:57,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:57,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246917000] [2021-10-13 07:04:57,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:57,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:57,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:57,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:57,900 INFO L87 Difference]: Start difference. First operand 256 states and 340 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:57,973 INFO L93 Difference]: Finished difference Result 472 states and 620 transitions. [2021-10-13 07:04:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:57,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 07:04:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:57,977 INFO L225 Difference]: With dead ends: 472 [2021-10-13 07:04:57,977 INFO L226 Difference]: Without dead ends: 330 [2021-10-13 07:04:57,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-13 07:04:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2021-10-13 07:04:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 243 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2021-10-13 07:04:58,021 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 9 [2021-10-13 07:04:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:58,023 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2021-10-13 07:04:58,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2021-10-13 07:04:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:04:58,024 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:58,024 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:58,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:04:58,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1551307607, now seen corresponding path program 1 times [2021-10-13 07:04:58,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:58,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870494775] [2021-10-13 07:04:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:58,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:58,104 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:58,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870494775] [2021-10-13 07:04:58,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870494775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:58,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:58,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:04:58,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486911925] [2021-10-13 07:04:58,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:58,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:58,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:58,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,109 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:58,131 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2021-10-13 07:04:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:58,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 07:04:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:58,134 INFO L225 Difference]: With dead ends: 263 [2021-10-13 07:04:58,134 INFO L226 Difference]: Without dead ends: 244 [2021-10-13 07:04:58,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-13 07:04:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-10-13 07:04:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 224 states have (on average 1.4375) internal successors, (322), 243 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 322 transitions. [2021-10-13 07:04:58,148 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 322 transitions. Word has length 10 [2021-10-13 07:04:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:58,148 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 322 transitions. [2021-10-13 07:04:58,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 322 transitions. [2021-10-13 07:04:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:04:58,150 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:58,150 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:58,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:04:58,150 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1935314780, now seen corresponding path program 1 times [2021-10-13 07:04:58,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:58,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048863402] [2021-10-13 07:04:58,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:58,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:58,199 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:58,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048863402] [2021-10-13 07:04:58,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048863402] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:58,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:58,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:58,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332426231] [2021-10-13 07:04:58,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:58,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,202 INFO L87 Difference]: Start difference. First operand 244 states and 322 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:58,228 INFO L93 Difference]: Finished difference Result 301 states and 390 transitions. [2021-10-13 07:04:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:58,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 07:04:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:58,254 INFO L225 Difference]: With dead ends: 301 [2021-10-13 07:04:58,254 INFO L226 Difference]: Without dead ends: 281 [2021-10-13 07:04:58,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-10-13 07:04:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2021-10-13 07:04:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 243 states have (on average 1.4320987654320987) internal successors, (348), 261 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 348 transitions. [2021-10-13 07:04:58,270 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 348 transitions. Word has length 13 [2021-10-13 07:04:58,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:58,270 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 348 transitions. [2021-10-13 07:04:58,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 348 transitions. [2021-10-13 07:04:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:04:58,272 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:58,272 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:58,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:04:58,273 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:58,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash -684354150, now seen corresponding path program 1 times [2021-10-13 07:04:58,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:58,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288590771] [2021-10-13 07:04:58,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:58,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:58,331 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:58,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288590771] [2021-10-13 07:04:58,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288590771] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:58,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:58,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:04:58,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527473951] [2021-10-13 07:04:58,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:04:58,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:58,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:04:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:04:58,334 INFO L87 Difference]: Start difference. First operand 262 states and 348 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:58,366 INFO L93 Difference]: Finished difference Result 325 states and 414 transitions. [2021-10-13 07:04:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:04:58,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-13 07:04:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:58,369 INFO L225 Difference]: With dead ends: 325 [2021-10-13 07:04:58,369 INFO L226 Difference]: Without dead ends: 289 [2021-10-13 07:04:58,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:04:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-13 07:04:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 249. [2021-10-13 07:04:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 230 states have (on average 1.4217391304347826) internal successors, (327), 248 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 327 transitions. [2021-10-13 07:04:58,384 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 327 transitions. Word has length 16 [2021-10-13 07:04:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:58,384 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 327 transitions. [2021-10-13 07:04:58,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 327 transitions. [2021-10-13 07:04:58,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:04:58,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:58,386 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:58,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:04:58,387 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:58,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:58,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1690048014, now seen corresponding path program 1 times [2021-10-13 07:04:58,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:58,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992288609] [2021-10-13 07:04:58,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:58,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:58,423 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:58,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992288609] [2021-10-13 07:04:58,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992288609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:58,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:58,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:58,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021452156] [2021-10-13 07:04:58,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:58,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:58,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:58,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,426 INFO L87 Difference]: Start difference. First operand 249 states and 327 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:58,548 INFO L93 Difference]: Finished difference Result 271 states and 353 transitions. [2021-10-13 07:04:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:58,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-13 07:04:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:58,550 INFO L225 Difference]: With dead ends: 271 [2021-10-13 07:04:58,550 INFO L226 Difference]: Without dead ends: 266 [2021-10-13 07:04:58,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-13 07:04:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-10-13 07:04:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 247 states have (on average 1.408906882591093) internal successors, (348), 265 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 348 transitions. [2021-10-13 07:04:58,567 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 348 transitions. Word has length 16 [2021-10-13 07:04:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:58,568 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 348 transitions. [2021-10-13 07:04:58,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 348 transitions. [2021-10-13 07:04:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:04:58,572 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:58,572 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:58,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:04:58,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1122523632, now seen corresponding path program 1 times [2021-10-13 07:04:58,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:58,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78043454] [2021-10-13 07:04:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:58,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:58,640 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:58,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78043454] [2021-10-13 07:04:58,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78043454] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:58,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:58,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:58,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989574807] [2021-10-13 07:04:58,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:58,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:58,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:58,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,642 INFO L87 Difference]: Start difference. First operand 266 states and 348 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:58,775 INFO L93 Difference]: Finished difference Result 266 states and 348 transitions. [2021-10-13 07:04:58,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:58,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 07:04:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:58,777 INFO L225 Difference]: With dead ends: 266 [2021-10-13 07:04:58,777 INFO L226 Difference]: Without dead ends: 254 [2021-10-13 07:04:58,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-13 07:04:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-10-13 07:04:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 253 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 336 transitions. [2021-10-13 07:04:58,792 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 336 transitions. Word has length 17 [2021-10-13 07:04:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:58,792 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 336 transitions. [2021-10-13 07:04:58,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 336 transitions. [2021-10-13 07:04:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:04:58,793 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:58,793 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:58,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:04:58,794 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:58,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:58,794 INFO L82 PathProgramCache]: Analyzing trace with hash -984746365, now seen corresponding path program 1 times [2021-10-13 07:04:58,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:58,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339167451] [2021-10-13 07:04:58,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:58,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:58,877 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:58,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339167451] [2021-10-13 07:04:58,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339167451] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:58,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:58,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:58,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459975263] [2021-10-13 07:04:58,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:58,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:58,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:58,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,880 INFO L87 Difference]: Start difference. First operand 254 states and 336 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:58,985 INFO L93 Difference]: Finished difference Result 354 states and 469 transitions. [2021-10-13 07:04:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 07:04:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:58,989 INFO L225 Difference]: With dead ends: 354 [2021-10-13 07:04:58,989 INFO L226 Difference]: Without dead ends: 251 [2021-10-13 07:04:58,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-10-13 07:04:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-10-13 07:04:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.3833333333333333) internal successors, (332), 250 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 332 transitions. [2021-10-13 07:04:59,005 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 332 transitions. Word has length 17 [2021-10-13 07:04:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:59,006 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 332 transitions. [2021-10-13 07:04:59,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2021-10-13 07:04:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:04:59,007 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:59,007 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:59,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:04:59,008 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:59,008 INFO L82 PathProgramCache]: Analyzing trace with hash -834424813, now seen corresponding path program 1 times [2021-10-13 07:04:59,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:59,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415770630] [2021-10-13 07:04:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:59,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:59,078 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:59,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415770630] [2021-10-13 07:04:59,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415770630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:59,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:59,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:59,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750483252] [2021-10-13 07:04:59,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:04:59,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:04:59,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:04:59,085 INFO L87 Difference]: Start difference. First operand 251 states and 332 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:59,213 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2021-10-13 07:04:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:04:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 07:04:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:59,216 INFO L225 Difference]: With dead ends: 256 [2021-10-13 07:04:59,216 INFO L226 Difference]: Without dead ends: 251 [2021-10-13 07:04:59,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:04:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-10-13 07:04:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-10-13 07:04:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.3791666666666667) internal successors, (331), 250 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2021-10-13 07:04:59,233 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 17 [2021-10-13 07:04:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:59,233 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2021-10-13 07:04:59,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2021-10-13 07:04:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 07:04:59,234 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:59,235 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:59,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:04:59,235 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash -590061255, now seen corresponding path program 1 times [2021-10-13 07:04:59,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:59,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398906190] [2021-10-13 07:04:59,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:59,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:59,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:59,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398906190] [2021-10-13 07:04:59,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398906190] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:59,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:59,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:59,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986598068] [2021-10-13 07:04:59,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:59,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:59,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:59,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:59,293 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:59,325 INFO L93 Difference]: Finished difference Result 344 states and 443 transitions. [2021-10-13 07:04:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:59,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 07:04:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:59,327 INFO L225 Difference]: With dead ends: 344 [2021-10-13 07:04:59,328 INFO L226 Difference]: Without dead ends: 249 [2021-10-13 07:04:59,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-10-13 07:04:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 235. [2021-10-13 07:04:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 224 states have (on average 1.3571428571428572) internal successors, (304), 234 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 304 transitions. [2021-10-13 07:04:59,346 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 304 transitions. Word has length 18 [2021-10-13 07:04:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:59,346 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 304 transitions. [2021-10-13 07:04:59,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 304 transitions. [2021-10-13 07:04:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 07:04:59,347 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:59,347 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:59,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:04:59,348 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:59,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:59,348 INFO L82 PathProgramCache]: Analyzing trace with hash -626633759, now seen corresponding path program 1 times [2021-10-13 07:04:59,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:59,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572242670] [2021-10-13 07:04:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:59,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:59,420 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:59,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572242670] [2021-10-13 07:04:59,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572242670] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:59,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:59,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:59,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109152579] [2021-10-13 07:04:59,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:04:59,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:59,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:04:59,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:04:59,424 INFO L87 Difference]: Start difference. First operand 235 states and 304 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:59,563 INFO L93 Difference]: Finished difference Result 240 states and 308 transitions. [2021-10-13 07:04:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:04:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 07:04:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:59,567 INFO L225 Difference]: With dead ends: 240 [2021-10-13 07:04:59,567 INFO L226 Difference]: Without dead ends: 235 [2021-10-13 07:04:59,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:04:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-10-13 07:04:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-10-13 07:04:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 234 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 303 transitions. [2021-10-13 07:04:59,589 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 303 transitions. Word has length 18 [2021-10-13 07:04:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:59,589 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 303 transitions. [2021-10-13 07:04:59,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 303 transitions. [2021-10-13 07:04:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:04:59,590 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:59,590 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:59,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:04:59,592 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash 964254453, now seen corresponding path program 1 times [2021-10-13 07:04:59,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:59,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935574864] [2021-10-13 07:04:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:59,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:59,627 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:59,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935574864] [2021-10-13 07:04:59,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935574864] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:59,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:59,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:59,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115408318] [2021-10-13 07:04:59,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:04:59,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:04:59,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:59,631 INFO L87 Difference]: Start difference. First operand 235 states and 303 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:59,757 INFO L93 Difference]: Finished difference Result 306 states and 388 transitions. [2021-10-13 07:04:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:04:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 07:04:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:59,760 INFO L225 Difference]: With dead ends: 306 [2021-10-13 07:04:59,760 INFO L226 Difference]: Without dead ends: 298 [2021-10-13 07:04:59,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:04:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-13 07:04:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 243. [2021-10-13 07:04:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 232 states have (on average 1.3577586206896552) internal successors, (315), 242 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 315 transitions. [2021-10-13 07:04:59,781 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 315 transitions. Word has length 19 [2021-10-13 07:04:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:59,782 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 315 transitions. [2021-10-13 07:04:59,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 315 transitions. [2021-10-13 07:04:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:04:59,783 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:59,783 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:59,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:04:59,783 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1688925962, now seen corresponding path program 1 times [2021-10-13 07:04:59,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:59,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809958984] [2021-10-13 07:04:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:59,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:59,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:59,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809958984] [2021-10-13 07:04:59,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809958984] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:59,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:59,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:04:59,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83764882] [2021-10-13 07:04:59,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:04:59,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:59,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:04:59,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:04:59,819 INFO L87 Difference]: Start difference. First operand 243 states and 315 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:04:59,858 INFO L93 Difference]: Finished difference Result 256 states and 327 transitions. [2021-10-13 07:04:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:04:59,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 07:04:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:04:59,860 INFO L225 Difference]: With dead ends: 256 [2021-10-13 07:04:59,860 INFO L226 Difference]: Without dead ends: 241 [2021-10-13 07:04:59,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:04:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-13 07:04:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-10-13 07:04:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 230 states have (on average 1.3565217391304347) internal successors, (312), 240 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 312 transitions. [2021-10-13 07:04:59,879 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 312 transitions. Word has length 19 [2021-10-13 07:04:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:04:59,879 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 312 transitions. [2021-10-13 07:04:59,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:04:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 312 transitions. [2021-10-13 07:04:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 07:04:59,881 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:04:59,881 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:04:59,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:04:59,881 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:04:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:04:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -180541531, now seen corresponding path program 1 times [2021-10-13 07:04:59,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:04:59,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607452783] [2021-10-13 07:04:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:04:59,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:04:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:04:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:04:59,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:04:59,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607452783] [2021-10-13 07:04:59,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607452783] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:04:59,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:04:59,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:04:59,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027298911] [2021-10-13 07:04:59,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:04:59,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:04:59,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:04:59,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:04:59,931 INFO L87 Difference]: Start difference. First operand 241 states and 312 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:00,078 INFO L93 Difference]: Finished difference Result 273 states and 349 transitions. [2021-10-13 07:05:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:05:00,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 07:05:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:00,081 INFO L225 Difference]: With dead ends: 273 [2021-10-13 07:05:00,081 INFO L226 Difference]: Without dead ends: 236 [2021-10-13 07:05:00,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-13 07:05:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-10-13 07:05:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.345132743362832) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2021-10-13 07:05:00,102 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 20 [2021-10-13 07:05:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:00,102 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2021-10-13 07:05:00,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2021-10-13 07:05:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 07:05:00,103 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:00,104 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:00,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:05:00,104 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash 217229373, now seen corresponding path program 1 times [2021-10-13 07:05:00,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:00,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864208015] [2021-10-13 07:05:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:00,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:00,140 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:00,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864208015] [2021-10-13 07:05:00,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864208015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:00,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:00,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:05:00,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727703480] [2021-10-13 07:05:00,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:05:00,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:05:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:05:00,142 INFO L87 Difference]: Start difference. First operand 236 states and 304 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:00,179 INFO L93 Difference]: Finished difference Result 353 states and 446 transitions. [2021-10-13 07:05:00,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:05:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 07:05:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:00,183 INFO L225 Difference]: With dead ends: 353 [2021-10-13 07:05:00,183 INFO L226 Difference]: Without dead ends: 259 [2021-10-13 07:05:00,185 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:05:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-13 07:05:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 224. [2021-10-13 07:05:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 217 states have (on average 1.3179723502304148) internal successors, (286), 223 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2021-10-13 07:05:00,207 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 20 [2021-10-13 07:05:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:00,207 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2021-10-13 07:05:00,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2021-10-13 07:05:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 07:05:00,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:00,211 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:00,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:05:00,211 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -112139151, now seen corresponding path program 1 times [2021-10-13 07:05:00,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:00,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541250839] [2021-10-13 07:05:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:00,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:00,372 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:00,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541250839] [2021-10-13 07:05:00,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541250839] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:00,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:00,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:05:00,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224930038] [2021-10-13 07:05:00,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:05:00,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:00,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:05:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:05:00,377 INFO L87 Difference]: Start difference. First operand 224 states and 286 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:00,427 INFO L93 Difference]: Finished difference Result 324 states and 408 transitions. [2021-10-13 07:05:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:05:00,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 07:05:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:00,429 INFO L225 Difference]: With dead ends: 324 [2021-10-13 07:05:00,430 INFO L226 Difference]: Without dead ends: 226 [2021-10-13 07:05:00,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:05:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-13 07:05:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2021-10-13 07:05:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 211 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 268 transitions. [2021-10-13 07:05:00,457 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 268 transitions. Word has length 21 [2021-10-13 07:05:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:00,458 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 268 transitions. [2021-10-13 07:05:00,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2021-10-13 07:05:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:05:00,459 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:00,459 INFO L512 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] [2021-10-13 07:05:00,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 07:05:00,460 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash 135545772, now seen corresponding path program 1 times [2021-10-13 07:05:00,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:00,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147289424] [2021-10-13 07:05:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:00,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:00,513 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:00,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147289424] [2021-10-13 07:05:00,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147289424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:00,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:00,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:05:00,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178508559] [2021-10-13 07:05:00,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:05:00,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:00,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:05:00,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:05:00,515 INFO L87 Difference]: Start difference. First operand 212 states and 268 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:00,678 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2021-10-13 07:05:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:05:00,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 07:05:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:00,680 INFO L225 Difference]: With dead ends: 324 [2021-10-13 07:05:00,680 INFO L226 Difference]: Without dead ends: 238 [2021-10-13 07:05:00,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-13 07:05:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 212. [2021-10-13 07:05:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2864077669902914) internal successors, (265), 211 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 265 transitions. [2021-10-13 07:05:00,705 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 265 transitions. Word has length 22 [2021-10-13 07:05:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:00,705 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 265 transitions. [2021-10-13 07:05:00,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 265 transitions. [2021-10-13 07:05:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:05:00,706 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:00,707 INFO L512 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] [2021-10-13 07:05:00,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 07:05:00,707 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash -458730667, now seen corresponding path program 1 times [2021-10-13 07:05:00,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:00,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93291056] [2021-10-13 07:05:00,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:00,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:00,775 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:00,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93291056] [2021-10-13 07:05:00,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93291056] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:00,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:00,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:05:00,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487846712] [2021-10-13 07:05:00,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:05:00,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:05:00,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:00,779 INFO L87 Difference]: Start difference. First operand 212 states and 265 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:01,009 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2021-10-13 07:05:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:05:01,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 07:05:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:01,012 INFO L225 Difference]: With dead ends: 278 [2021-10-13 07:05:01,012 INFO L226 Difference]: Without dead ends: 274 [2021-10-13 07:05:01,013 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.2ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-10-13 07:05:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 212. [2021-10-13 07:05:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2864077669902914) internal successors, (265), 211 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 265 transitions. [2021-10-13 07:05:01,042 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 265 transitions. Word has length 23 [2021-10-13 07:05:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:01,042 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 265 transitions. [2021-10-13 07:05:01,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 265 transitions. [2021-10-13 07:05:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:05:01,043 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:01,043 INFO L512 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] [2021-10-13 07:05:01,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 07:05:01,044 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1186277304, now seen corresponding path program 1 times [2021-10-13 07:05:01,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:01,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487765839] [2021-10-13 07:05:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:01,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:01,091 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:01,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487765839] [2021-10-13 07:05:01,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487765839] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:01,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:01,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:05:01,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748501664] [2021-10-13 07:05:01,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:05:01,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:05:01,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:05:01,094 INFO L87 Difference]: Start difference. First operand 212 states and 265 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:01,230 INFO L93 Difference]: Finished difference Result 271 states and 330 transitions. [2021-10-13 07:05:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:05:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:05:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:01,232 INFO L225 Difference]: With dead ends: 271 [2021-10-13 07:05:01,232 INFO L226 Difference]: Without dead ends: 238 [2021-10-13 07:05:01,233 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-13 07:05:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 212. [2021-10-13 07:05:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2572815533980584) internal successors, (259), 211 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 259 transitions. [2021-10-13 07:05:01,258 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 259 transitions. Word has length 24 [2021-10-13 07:05:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:01,259 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 259 transitions. [2021-10-13 07:05:01,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 259 transitions. [2021-10-13 07:05:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:05:01,260 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:01,268 INFO L512 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] [2021-10-13 07:05:01,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 07:05:01,269 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1566284008, now seen corresponding path program 1 times [2021-10-13 07:05:01,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:01,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217697467] [2021-10-13 07:05:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:01,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:01,302 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:01,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217697467] [2021-10-13 07:05:01,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217697467] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:01,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:01,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:05:01,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568782546] [2021-10-13 07:05:01,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:05:01,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:05:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:05:01,304 INFO L87 Difference]: Start difference. First operand 212 states and 259 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:01,412 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2021-10-13 07:05:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:05:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 07:05:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:01,414 INFO L225 Difference]: With dead ends: 245 [2021-10-13 07:05:01,414 INFO L226 Difference]: Without dead ends: 212 [2021-10-13 07:05:01,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-13 07:05:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-10-13 07:05:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2281553398058251) internal successors, (253), 211 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-10-13 07:05:01,439 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 25 [2021-10-13 07:05:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:01,439 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-10-13 07:05:01,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-10-13 07:05:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:05:01,440 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:01,440 INFO L512 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] [2021-10-13 07:05:01,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 07:05:01,441 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:01,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:01,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1594212847, now seen corresponding path program 1 times [2021-10-13 07:05:01,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:01,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743749115] [2021-10-13 07:05:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:01,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:01,502 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:01,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743749115] [2021-10-13 07:05:01,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743749115] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:01,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:01,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:05:01,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426333357] [2021-10-13 07:05:01,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:05:01,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:05:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:01,504 INFO L87 Difference]: Start difference. First operand 212 states and 253 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:01,722 INFO L93 Difference]: Finished difference Result 232 states and 279 transitions. [2021-10-13 07:05:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:05:01,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 07:05:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:01,724 INFO L225 Difference]: With dead ends: 232 [2021-10-13 07:05:01,724 INFO L226 Difference]: Without dead ends: 230 [2021-10-13 07:05:01,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.8ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-13 07:05:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2021-10-13 07:05:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2281553398058251) internal successors, (253), 211 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-10-13 07:05:01,750 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 25 [2021-10-13 07:05:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:01,751 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-10-13 07:05:01,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-10-13 07:05:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:05:01,752 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:01,752 INFO L512 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] [2021-10-13 07:05:01,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 07:05:01,753 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1509861448, now seen corresponding path program 1 times [2021-10-13 07:05:01,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:01,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18908363] [2021-10-13 07:05:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:01,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:01,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:01,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18908363] [2021-10-13 07:05:01,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18908363] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:01,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:01,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:05:01,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202820426] [2021-10-13 07:05:01,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:05:01,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:05:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:01,793 INFO L87 Difference]: Start difference. First operand 212 states and 253 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:01,863 INFO L93 Difference]: Finished difference Result 226 states and 266 transitions. [2021-10-13 07:05:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:05:01,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:05:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:01,865 INFO L225 Difference]: With dead ends: 226 [2021-10-13 07:05:01,865 INFO L226 Difference]: Without dead ends: 202 [2021-10-13 07:05:01,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:05:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-13 07:05:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-13 07:05:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.2091836734693877) internal successors, (237), 201 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 237 transitions. [2021-10-13 07:05:01,902 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 237 transitions. Word has length 26 [2021-10-13 07:05:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:01,902 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 237 transitions. [2021-10-13 07:05:01,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 237 transitions. [2021-10-13 07:05:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:05:01,903 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:01,903 INFO L512 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] [2021-10-13 07:05:01,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 07:05:01,904 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:01,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:01,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2072887667, now seen corresponding path program 1 times [2021-10-13 07:05:01,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:01,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098423116] [2021-10-13 07:05:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:01,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:01,938 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:01,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098423116] [2021-10-13 07:05:01,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098423116] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:01,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:01,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:05:01,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752818149] [2021-10-13 07:05:01,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:05:01,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:05:01,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:05:01,941 INFO L87 Difference]: Start difference. First operand 202 states and 237 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:02,032 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2021-10-13 07:05:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:05:02,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:05:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:02,034 INFO L225 Difference]: With dead ends: 215 [2021-10-13 07:05:02,034 INFO L226 Difference]: Without dead ends: 201 [2021-10-13 07:05:02,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:05:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-13 07:05:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2021-10-13 07:05:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.1968911917098446) internal successors, (231), 197 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2021-10-13 07:05:02,065 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 26 [2021-10-13 07:05:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:02,065 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2021-10-13 07:05:02,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2021-10-13 07:05:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:05:02,066 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:02,067 INFO L512 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] [2021-10-13 07:05:02,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 07:05:02,067 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash 182459748, now seen corresponding path program 1 times [2021-10-13 07:05:02,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:02,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557539658] [2021-10-13 07:05:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:02,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:02,104 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:02,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557539658] [2021-10-13 07:05:02,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557539658] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:02,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:02,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:05:02,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119874554] [2021-10-13 07:05:02,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:05:02,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:02,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:05:02,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:02,106 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:02,217 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2021-10-13 07:05:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:05:02,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 07:05:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:02,219 INFO L225 Difference]: With dead ends: 212 [2021-10-13 07:05:02,219 INFO L226 Difference]: Without dead ends: 209 [2021-10-13 07:05:02,219 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:05:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-13 07:05:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2021-10-13 07:05:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 203 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2021-10-13 07:05:02,246 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 27 [2021-10-13 07:05:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:02,246 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2021-10-13 07:05:02,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2021-10-13 07:05:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:05:02,247 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:02,247 INFO L512 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] [2021-10-13 07:05:02,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 07:05:02,248 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:02,248 INFO L82 PathProgramCache]: Analyzing trace with hash 182447832, now seen corresponding path program 1 times [2021-10-13 07:05:02,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:02,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927837540] [2021-10-13 07:05:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:02,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:02,289 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:02,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927837540] [2021-10-13 07:05:02,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927837540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:02,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:02,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:05:02,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301428325] [2021-10-13 07:05:02,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:05:02,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:02,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:05:02,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:05:02,291 INFO L87 Difference]: Start difference. First operand 204 states and 237 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:02,398 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2021-10-13 07:05:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:05:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 07:05:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:02,400 INFO L225 Difference]: With dead ends: 209 [2021-10-13 07:05:02,400 INFO L226 Difference]: Without dead ends: 190 [2021-10-13 07:05:02,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-10-13 07:05:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-10-13 07:05:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.1945945945945946) internal successors, (221), 189 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2021-10-13 07:05:02,425 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 27 [2021-10-13 07:05:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:02,426 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2021-10-13 07:05:02,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2021-10-13 07:05:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:05:02,427 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:02,427 INFO L512 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] [2021-10-13 07:05:02,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 07:05:02,427 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash -959516531, now seen corresponding path program 1 times [2021-10-13 07:05:02,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:02,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095055340] [2021-10-13 07:05:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:02,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:02,481 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:02,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095055340] [2021-10-13 07:05:02,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095055340] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:02,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:02,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:05:02,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102740802] [2021-10-13 07:05:02,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:05:02,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:02,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:05:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:02,484 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:02,671 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2021-10-13 07:05:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:05:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 07:05:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:02,672 INFO L225 Difference]: With dead ends: 266 [2021-10-13 07:05:02,673 INFO L226 Difference]: Without dead ends: 198 [2021-10-13 07:05:02,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-13 07:05:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2021-10-13 07:05:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.1818181818181819) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2021-10-13 07:05:02,696 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 27 [2021-10-13 07:05:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:02,697 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2021-10-13 07:05:02,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2021-10-13 07:05:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:05:02,698 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:02,698 INFO L512 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, 1, 1] [2021-10-13 07:05:02,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 07:05:02,698 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1342183885, now seen corresponding path program 1 times [2021-10-13 07:05:02,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:02,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764623676] [2021-10-13 07:05:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:02,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:02,733 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:02,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764623676] [2021-10-13 07:05:02,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764623676] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:02,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:02,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:05:02,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469986728] [2021-10-13 07:05:02,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:05:02,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:02,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:05:02,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:05:02,735 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:02,827 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2021-10-13 07:05:02,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:05:02,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-13 07:05:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:02,829 INFO L225 Difference]: With dead ends: 212 [2021-10-13 07:05:02,829 INFO L226 Difference]: Without dead ends: 208 [2021-10-13 07:05:02,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:05:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-13 07:05:02,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 174. [2021-10-13 07:05:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 171 states have (on average 1.1812865497076024) internal successors, (202), 173 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2021-10-13 07:05:02,852 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 29 [2021-10-13 07:05:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:02,852 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2021-10-13 07:05:02,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2021-10-13 07:05:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 07:05:02,853 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:02,853 INFO L512 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, 1, 1, 1] [2021-10-13 07:05:02,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 07:05:02,854 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash -238254628, now seen corresponding path program 1 times [2021-10-13 07:05:02,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:02,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878203577] [2021-10-13 07:05:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:02,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:02,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:02,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878203577] [2021-10-13 07:05:02,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878203577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:02,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:02,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:05:02,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804075647] [2021-10-13 07:05:02,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:05:02,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:02,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:05:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:02,894 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:03,019 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2021-10-13 07:05:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:05:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 07:05:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:03,021 INFO L225 Difference]: With dead ends: 190 [2021-10-13 07:05:03,021 INFO L226 Difference]: Without dead ends: 116 [2021-10-13 07:05:03,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:05:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-13 07:05:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2021-10-13 07:05:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 99 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2021-10-13 07:05:03,036 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 30 [2021-10-13 07:05:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:03,037 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2021-10-13 07:05:03,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2021-10-13 07:05:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 07:05:03,038 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:03,038 INFO L512 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, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:03,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 07:05:03,038 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:03,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:03,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1741353200, now seen corresponding path program 1 times [2021-10-13 07:05:03,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:03,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325737033] [2021-10-13 07:05:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:03,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:03,117 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:03,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325737033] [2021-10-13 07:05:03,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325737033] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:03,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:03,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:05:03,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425550329] [2021-10-13 07:05:03,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:05:03,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:05:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:05:03,119 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:03,326 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2021-10-13 07:05:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 07:05:03,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-13 07:05:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:03,327 INFO L225 Difference]: With dead ends: 133 [2021-10-13 07:05:03,327 INFO L226 Difference]: Without dead ends: 131 [2021-10-13 07:05:03,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 77.6ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:05:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-13 07:05:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2021-10-13 07:05:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 99 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2021-10-13 07:05:03,342 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 33 [2021-10-13 07:05:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:03,343 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2021-10-13 07:05:03,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2021-10-13 07:05:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:05:03,343 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:03,343 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:03,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 07:05:03,344 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2037279919, now seen corresponding path program 1 times [2021-10-13 07:05:03,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:03,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744821255] [2021-10-13 07:05:03,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:03,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:03,438 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:03,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744821255] [2021-10-13 07:05:03,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744821255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:03,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:03,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:05:03,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481652630] [2021-10-13 07:05:03,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:05:03,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:03,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:05:03,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:03,440 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:03,535 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2021-10-13 07:05:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:05:03,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:05:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:03,537 INFO L225 Difference]: With dead ends: 132 [2021-10-13 07:05:03,537 INFO L226 Difference]: Without dead ends: 130 [2021-10-13 07:05:03,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.4ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-10-13 07:05:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2021-10-13 07:05:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 85 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2021-10-13 07:05:03,552 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 36 [2021-10-13 07:05:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:03,552 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2021-10-13 07:05:03,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2021-10-13 07:05:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 07:05:03,553 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:03,553 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:03,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 07:05:03,554 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:03,554 INFO L82 PathProgramCache]: Analyzing trace with hash 781443528, now seen corresponding path program 1 times [2021-10-13 07:05:03,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:03,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725598678] [2021-10-13 07:05:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:03,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:03,634 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:03,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725598678] [2021-10-13 07:05:03,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725598678] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:03,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:03,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:05:03,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904006622] [2021-10-13 07:05:03,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:05:03,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:03,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:05:03,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:03,636 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:03,744 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2021-10-13 07:05:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:05:03,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-13 07:05:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:03,745 INFO L225 Difference]: With dead ends: 102 [2021-10-13 07:05:03,746 INFO L226 Difference]: Without dead ends: 86 [2021-10-13 07:05:03,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 80.3ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:05:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-10-13 07:05:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-10-13 07:05:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 85 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2021-10-13 07:05:03,760 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 37 [2021-10-13 07:05:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:03,760 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2021-10-13 07:05:03,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2021-10-13 07:05:03,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 07:05:03,761 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:03,761 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:03,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 07:05:03,762 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:03,763 INFO L82 PathProgramCache]: Analyzing trace with hash 807911961, now seen corresponding path program 1 times [2021-10-13 07:05:03,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:03,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437853810] [2021-10-13 07:05:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:03,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:03,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:03,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437853810] [2021-10-13 07:05:03,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437853810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:03,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:03,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:05:03,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337048646] [2021-10-13 07:05:03,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:05:03,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:05:03,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:03,833 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:03,912 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2021-10-13 07:05:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:05:03,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-13 07:05:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:03,913 INFO L225 Difference]: With dead ends: 106 [2021-10-13 07:05:03,913 INFO L226 Difference]: Without dead ends: 88 [2021-10-13 07:05:03,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:05:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-10-13 07:05:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-10-13 07:05:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2021-10-13 07:05:03,932 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 37 [2021-10-13 07:05:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:03,932 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2021-10-13 07:05:03,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2021-10-13 07:05:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 07:05:03,933 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:03,933 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:03,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 07:05:03,934 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash 605372770, now seen corresponding path program 1 times [2021-10-13 07:05:03,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:03,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250498536] [2021-10-13 07:05:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:03,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:03,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:03,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250498536] [2021-10-13 07:05:03,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250498536] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:03,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:03,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:05:03,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410642799] [2021-10-13 07:05:03,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:05:03,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:03,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:05:03,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:03,990 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:04,055 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2021-10-13 07:05:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:05:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-13 07:05:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:04,057 INFO L225 Difference]: With dead ends: 102 [2021-10-13 07:05:04,057 INFO L226 Difference]: Without dead ends: 64 [2021-10-13 07:05:04,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.6ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:05:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-13 07:05:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-13 07:05:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2021-10-13 07:05:04,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 40 [2021-10-13 07:05:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:04,073 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2021-10-13 07:05:04,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2021-10-13 07:05:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 07:05:04,074 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:04,074 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:04,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 07:05:04,074 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash 270788442, now seen corresponding path program 1 times [2021-10-13 07:05:04,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:04,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159854703] [2021-10-13 07:05:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:04,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:04,116 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:04,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159854703] [2021-10-13 07:05:04,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159854703] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:04,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:04,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:05:04,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427988358] [2021-10-13 07:05:04,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:05:04,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:05:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:05:04,118 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:04,155 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2021-10-13 07:05:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:05:04,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-13 07:05:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:04,156 INFO L225 Difference]: With dead ends: 92 [2021-10-13 07:05:04,157 INFO L226 Difference]: Without dead ends: 64 [2021-10-13 07:05:04,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:05:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-13 07:05:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-13 07:05:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-10-13 07:05:04,170 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 40 [2021-10-13 07:05:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:04,171 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-10-13 07:05:04,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-10-13 07:05:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-13 07:05:04,171 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:04,172 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:04,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 07:05:04,173 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:04,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash -216703206, now seen corresponding path program 1 times [2021-10-13 07:05:04,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:04,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150898467] [2021-10-13 07:05:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:04,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:04,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:04,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150898467] [2021-10-13 07:05:04,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150898467] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:04,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:04,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:05:04,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594283865] [2021-10-13 07:05:04,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:05:04,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:05:04,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:05:04,246 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:04,317 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-10-13 07:05:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:05:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-10-13 07:05:04,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:04,318 INFO L225 Difference]: With dead ends: 82 [2021-10-13 07:05:04,318 INFO L226 Difference]: Without dead ends: 64 [2021-10-13 07:05:04,318 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:05:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-13 07:05:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-13 07:05:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-10-13 07:05:04,331 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 49 [2021-10-13 07:05:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:04,331 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-10-13 07:05:04,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-10-13 07:05:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 07:05:04,332 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:04,332 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:05:04,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 07:05:04,333 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1728484254, now seen corresponding path program 1 times [2021-10-13 07:05:04,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:04,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942859782] [2021-10-13 07:05:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:04,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:04,457 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:04,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942859782] [2021-10-13 07:05:04,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942859782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:04,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:04,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 07:05:04,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356405091] [2021-10-13 07:05:04,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:05:04,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:04,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:05:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:05:04,459 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:04,760 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-10-13 07:05:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 07:05:04,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-13 07:05:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:04,761 INFO L225 Difference]: With dead ends: 109 [2021-10-13 07:05:04,761 INFO L226 Difference]: Without dead ends: 61 [2021-10-13 07:05:04,762 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 226.6ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-10-13 07:05:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-10-13 07:05:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-10-13 07:05:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2021-10-13 07:05:04,774 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 51 [2021-10-13 07:05:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:04,774 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2021-10-13 07:05:04,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2021-10-13 07:05:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 07:05:04,775 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:05:04,775 INFO L512 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, 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] [2021-10-13 07:05:04,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 07:05:04,776 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-13 07:05:04,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:05:04,776 INFO L82 PathProgramCache]: Analyzing trace with hash -467856665, now seen corresponding path program 1 times [2021-10-13 07:05:04,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:05:04,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010528802] [2021-10-13 07:05:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:05:04,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:05:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:05:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:05:04,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:05:04,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010528802] [2021-10-13 07:05:04,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010528802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:05:04,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:05:04,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 07:05:04,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144925370] [2021-10-13 07:05:04,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:05:04,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:05:04,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:05:04,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:05:04,899 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:05:05,097 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2021-10-13 07:05:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 07:05:05,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-13 07:05:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:05:05,098 INFO L225 Difference]: With dead ends: 78 [2021-10-13 07:05:05,098 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 07:05:05,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 152.2ms TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-10-13 07:05:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 07:05:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 07:05:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 07:05:05,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-10-13 07:05:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:05:05,099 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 07:05:05,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:05:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 07:05:05,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 07:05:05,102 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,102 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,104 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,104 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,104 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,107 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,107 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,107 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,108 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,110 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,110 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,110 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,110 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,110 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,111 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,117 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,117 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:05:05,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 07:05:05,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 07:05:05,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:05,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:06,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:05:13,807 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,807 INFO L857 garLoopResultBuilder]: For program point L630(lines 630 632) no Hoare annotation was computed. [2021-10-13 07:05:13,807 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,807 INFO L857 garLoopResultBuilder]: For program point L565(lines 565 567) no Hoare annotation was computed. [2021-10-13 07:05:13,807 INFO L857 garLoopResultBuilder]: For program point L499(lines 499 505) no Hoare annotation was computed. [2021-10-13 07:05:13,808 INFO L853 garLoopResultBuilder]: At program point L499-1(lines 1 1151) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 07:05:13,808 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,808 INFO L853 garLoopResultBuilder]: At program point L434(lines 163 436) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse2 (= 2 ~DC~0)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse16 (not (= ~SKIP2~0 2))) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (= ~s~0 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse14 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse15 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse8 (not (= ~MPR3~0 1))) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10) (and .cse16 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse12 .cse3 .cse13 .cse4 .cse10) (and .cse16 .cse12 .cse3 .cse13 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res|) 0)) (and .cse0 .cse12 .cse3 .cse13 .cse4 (= ~myStatus~0 0) .cse5 (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse10) (and .cse0 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse6 .cse7 .cse15 .cse8 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse9 .cse10))) [2021-10-13 07:05:13,809 INFO L853 garLoopResultBuilder]: At program point L765(lines 758 804) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse10 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse11 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~status~1 0) .cse2 .cse3 (= ~myStatus~0 0) .cse4 (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse9 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8) (and (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0) (not (= ~SKIP2~0 2)) (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse1 .cse2 .cse3) (and .cse0 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (= 2 ~DC~0) .cse3 .cse4 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse5 .cse6 .cse7 .cse8 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse4 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse5 .cse6 .cse11 .cse7 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse8))) [2021-10-13 07:05:13,819 INFO L860 garLoopResultBuilder]: At program point L766(lines 750 805) the Hoare annotation is: true [2021-10-13 07:05:13,819 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 310) no Hoare annotation was computed. [2021-10-13 07:05:13,819 INFO L857 garLoopResultBuilder]: For program point L767(lines 767 802) no Hoare annotation was computed. [2021-10-13 07:05:13,819 INFO L857 garLoopResultBuilder]: For program point L239-1(lines 232 420) no Hoare annotation was computed. [2021-10-13 07:05:13,819 INFO L857 garLoopResultBuilder]: For program point L768(lines 768 801) no Hoare annotation was computed. [2021-10-13 07:05:13,819 INFO L853 garLoopResultBuilder]: At program point L570(lines 531 596) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse17 (* 4294967296 .cse16))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (< (+ .cse17 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse5 (<= (+ .cse16 1) 0)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse17 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse13 (< 0 (+ .cse16 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ~pended~0 0))) (or (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse15) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) [2021-10-13 07:05:13,820 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,820 INFO L857 garLoopResultBuilder]: For program point L769(lines 769 779) no Hoare annotation was computed. [2021-10-13 07:05:13,820 INFO L857 garLoopResultBuilder]: For program point L770(lines 770 776) no Hoare annotation was computed. [2021-10-13 07:05:13,820 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,820 INFO L857 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-10-13 07:05:13,820 INFO L857 garLoopResultBuilder]: For program point L1036(lines 1036 1055) no Hoare annotation was computed. [2021-10-13 07:05:13,820 INFO L857 garLoopResultBuilder]: For program point L1036-1(lines 1036 1055) no Hoare annotation was computed. [2021-10-13 07:05:13,820 INFO L857 garLoopResultBuilder]: For program point L1036-2(lines 1036 1055) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point L1036-3(lines 1036 1055) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point L640(lines 640 645) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point L640-2(lines 640 645) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point L1037(lines 1037 1042) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point L1037-2(lines 1037 1042) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point L1037-4(lines 1037 1042) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point L1037-6(lines 1037 1042) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-10-13 07:05:13,821 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,822 INFO L853 garLoopResultBuilder]: At program point L710(lines 704 808) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse2 (= 2 ~DC~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse15 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse16 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 0)) (.cse17 (not (= ~SKIP2~0 2))) (.cse13 (= ~s~0 ~DC~0)) (.cse14 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse4 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse0 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse6 .cse7 .cse16 .cse8 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse9 .cse10) (and .cse0 .cse13 (= ULTIMATE.start_main_~status~1 0) .cse14 .cse3 (= ~myStatus~0 0) .cse4 (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse10) (and (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0) .cse17 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse13 .cse14 .cse3 .cse10) (and (<= (+ 1073741823 ULTIMATE.start_main_~status~1) 0) .cse17 .cse13 .cse14 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse3 .cse4 .cse6 .cse7 .cse8 (<= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res|) 0)))) [2021-10-13 07:05:13,822 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,822 INFO L857 garLoopResultBuilder]: For program point L380(lines 380 386) no Hoare annotation was computed. [2021-10-13 07:05:13,822 INFO L853 garLoopResultBuilder]: At program point L647(lines 615 649) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse17 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse5 (<= (+ .cse18 1) 0)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse13 (< 0 (+ .cse18 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (= ~pended~0 0))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse15 .cse16) (and .cse0 .cse1 (or .cse17 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))))) [2021-10-13 07:05:13,822 INFO L857 garLoopResultBuilder]: For program point L515(lines 515 520) no Hoare annotation was computed. [2021-10-13 07:05:13,822 INFO L853 garLoopResultBuilder]: At program point L515-2(lines 515 520) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 07:05:13,822 INFO L853 garLoopResultBuilder]: At program point L1044(lines 1036 1055) the Hoare annotation is: false [2021-10-13 07:05:13,823 INFO L853 garLoopResultBuilder]: At program point L1044-1(lines 1036 1055) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (= ~NP~0 1) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (not (= ~MPR3~0 ~s~0))))) [2021-10-13 07:05:13,823 INFO L853 garLoopResultBuilder]: At program point L1044-2(lines 1036 1055) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2021-10-13 07:05:13,823 INFO L853 garLoopResultBuilder]: At program point L1044-3(lines 1036 1055) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~pended~0 0) (not (= ~MPR3~0 ~s~0))))) [2021-10-13 07:05:13,823 INFO L853 garLoopResultBuilder]: At program point L979(lines 943 1007) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 07:05:13,823 INFO L853 garLoopResultBuilder]: At program point L979-1(lines 943 1007) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 07:05:13,823 INFO L853 garLoopResultBuilder]: At program point L979-2(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,823 INFO L853 garLoopResultBuilder]: At program point L979-3(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,824 INFO L853 garLoopResultBuilder]: At program point L979-4(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,824 INFO L853 garLoopResultBuilder]: At program point L979-5(lines 943 1007) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 07:05:13,824 INFO L853 garLoopResultBuilder]: At program point L979-6(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,824 INFO L853 garLoopResultBuilder]: At program point L781(lines 768 801) the Hoare annotation is: (let ((.cse6 (= ~s~0 ~DC~0)) (.cse7 (= 2 ~s~0)) (.cse8 (not (= ~IPC~0 2)))) (let ((.cse1 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse3 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse4 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse0 (let ((.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse10 (<= 3 ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (= ~NP~0 1)) (.cse13 (not (= ~MPR3~0 1)))) (or (and .cse9 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse8 .cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse11 .cse12 .cse13 (= ~SKIP2~0 ~s~0)) (and .cse9 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13)))) (.cse2 (= 2 ~DC~0)) (.cse5 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse4 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse5) (and .cse0 .cse2 (= ULTIMATE.start_main_~status~1 0) (= ~myStatus~0 0) (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse5 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (and (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0) (not (= ~SKIP2~0 2)) (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse6 .cse7 .cse8) (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 (not .cse7) .cse5)))) [2021-10-13 07:05:13,824 INFO L853 garLoopResultBuilder]: At program point L979-7(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,824 INFO L853 garLoopResultBuilder]: At program point L979-8(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,824 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,824 INFO L853 garLoopResultBuilder]: At program point L121(lines 121 151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,825 INFO L857 garLoopResultBuilder]: For program point L121-2(lines 113 161) no Hoare annotation was computed. [2021-10-13 07:05:13,825 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 334) no Hoare annotation was computed. [2021-10-13 07:05:13,825 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 07:05:13,825 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,825 INFO L857 garLoopResultBuilder]: For program point L1049(lines 1049 1053) no Hoare annotation was computed. [2021-10-13 07:05:13,825 INFO L853 garLoopResultBuilder]: At program point L1049-1(lines 1049 1053) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 07:05:13,825 INFO L857 garLoopResultBuilder]: For program point L1049-2(lines 1049 1053) no Hoare annotation was computed. [2021-10-13 07:05:13,825 INFO L853 garLoopResultBuilder]: At program point L1049-3(lines 1049 1053) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 07:05:13,825 INFO L857 garLoopResultBuilder]: For program point L1049-4(lines 1049 1053) no Hoare annotation was computed. [2021-10-13 07:05:13,825 INFO L853 garLoopResultBuilder]: At program point L1049-5(lines 1049 1053) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point L1049-6(lines 1049 1053) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L853 garLoopResultBuilder]: At program point L1049-7(lines 1049 1053) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ~pended~0 0)))) [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point L787(lines 787 799) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point L788(lines 788 792) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point L987(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,826 INFO L857 garLoopResultBuilder]: For program point L987-1(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L987-2(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L987-3(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L987-4(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L987-5(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L987-6(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L987-7(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L987-8(lines 987 1004) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L327(lines 327 333) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L853 garLoopResultBuilder]: At program point L327-1(lines 1 1151) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L263(lines 263 294) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,827 INFO L857 garLoopResultBuilder]: For program point L65-2(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-3(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-4(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-5(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-6(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-7(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-8(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-9(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-10(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-11(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-12(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-13(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,828 INFO L857 garLoopResultBuilder]: For program point L65-14(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-15(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-16(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-17(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-18(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-19(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-20(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-21(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-22(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-23(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-24(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-25(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-26(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-27(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,829 INFO L857 garLoopResultBuilder]: For program point L65-28(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,830 INFO L853 garLoopResultBuilder]: At program point L132(lines 132 139) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,830 INFO L857 garLoopResultBuilder]: For program point L65-29(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,846 INFO L857 garLoopResultBuilder]: For program point L65-30(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,846 INFO L853 garLoopResultBuilder]: At program point L66(lines 1009 1022) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,846 INFO L857 garLoopResultBuilder]: For program point L65-31(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,846 INFO L857 garLoopResultBuilder]: For program point L65-32(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,847 INFO L857 garLoopResultBuilder]: For program point L65-33(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,847 INFO L857 garLoopResultBuilder]: For program point L65-34(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,847 INFO L853 garLoopResultBuilder]: At program point L66-4(lines 1 1151) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (or (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~MPR3~0 ~s~0)) (= ~setEventCalled~0 1) (or (and (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (= ~s~0 ~NP~0)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 07:05:13,847 INFO L857 garLoopResultBuilder]: For program point L65-35(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,847 INFO L857 garLoopResultBuilder]: For program point L65-36(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,847 INFO L857 garLoopResultBuilder]: For program point L65-37(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,848 INFO L853 garLoopResultBuilder]: At program point L66-7(lines 1 1151) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (or (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~MPR3~0 ~s~0)) (= ~setEventCalled~0 1) (or (and (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (= ~s~0 ~NP~0)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 07:05:13,848 INFO L857 garLoopResultBuilder]: For program point L65-38(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,848 INFO L857 garLoopResultBuilder]: For program point L65-39(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,848 INFO L853 garLoopResultBuilder]: At program point L66-9(lines 1009 1022) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse17 (* 4294967296 .cse16))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= 2 ~s~0)) (.cse5 (< (+ .cse17 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse6 (<= (+ .cse16 1) 0)) (.cse7 (not (= ~IPC~0 2))) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse17 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse13 (< 0 (+ .cse16 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ~pended~0 0))) (or (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse15) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) [2021-10-13 07:05:13,849 INFO L853 garLoopResultBuilder]: At program point L66-10(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,849 INFO L853 garLoopResultBuilder]: At program point L66-12(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 07:05:13,849 INFO L853 garLoopResultBuilder]: At program point L66-13(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,849 INFO L853 garLoopResultBuilder]: At program point L66-15(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,849 INFO L853 garLoopResultBuilder]: At program point L66-17(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 07:05:13,850 INFO L853 garLoopResultBuilder]: At program point L66-19(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,850 INFO L853 garLoopResultBuilder]: At program point L66-21(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 07:05:13,850 INFO L853 garLoopResultBuilder]: At program point L66-25(lines 1 1151) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (or (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~MPR3~0 ~s~0)) (= ~setEventCalled~0 1) (or (and (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (= ~s~0 ~NP~0)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 07:05:13,850 INFO L853 garLoopResultBuilder]: At program point L66-28(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,850 INFO L853 garLoopResultBuilder]: At program point L66-30(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 07:05:13,851 INFO L853 garLoopResultBuilder]: At program point L66-31(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,851 INFO L853 garLoopResultBuilder]: At program point L66-33(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 07:05:13,851 INFO L853 garLoopResultBuilder]: At program point L66-34(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,851 INFO L857 garLoopResultBuilder]: For program point L926(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,851 INFO L853 garLoopResultBuilder]: At program point L66-36(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 07:05:13,852 INFO L857 garLoopResultBuilder]: For program point L926-2(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,852 INFO L857 garLoopResultBuilder]: For program point L926-4(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,852 INFO L857 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-10-13 07:05:13,852 INFO L857 garLoopResultBuilder]: For program point L926-6(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,852 INFO L857 garLoopResultBuilder]: For program point L926-8(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,852 INFO L857 garLoopResultBuilder]: For program point L926-10(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,852 INFO L857 garLoopResultBuilder]: For program point L926-12(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,853 INFO L857 garLoopResultBuilder]: For program point L926-14(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,853 INFO L857 garLoopResultBuilder]: For program point L926-16(lines 926 932) no Hoare annotation was computed. [2021-10-13 07:05:13,853 INFO L857 garLoopResultBuilder]: For program point L531(lines 531 596) no Hoare annotation was computed. [2021-10-13 07:05:13,853 INFO L857 garLoopResultBuilder]: For program point L531-1(lines 531 596) no Hoare annotation was computed. [2021-10-13 07:05:13,853 INFO L857 garLoopResultBuilder]: For program point L201(lines 201 209) no Hoare annotation was computed. [2021-10-13 07:05:13,853 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,854 INFO L857 garLoopResultBuilder]: For program point L533(lines 533 573) no Hoare annotation was computed. [2021-10-13 07:05:13,854 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,854 INFO L857 garLoopResultBuilder]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,854 INFO L857 garLoopResultBuilder]: For program point L996-2(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,854 INFO L857 garLoopResultBuilder]: For program point L996-4(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,854 INFO L857 garLoopResultBuilder]: For program point L996-6(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,854 INFO L857 garLoopResultBuilder]: For program point L996-8(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,855 INFO L857 garLoopResultBuilder]: For program point L996-10(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,855 INFO L857 garLoopResultBuilder]: For program point L996-12(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,855 INFO L853 garLoopResultBuilder]: At program point L534(lines 534 544) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse4 (= 2 ~DC~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ .cse19 1) 0)) (.cse3 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse8 (not (= ~IPC~0 2))) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse11 (<= 3 ~SKIP1~0)) (.cse12 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse13 (= ~NP~0 1)) (.cse14 (not (= ~MPR3~0 1))) (.cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse15 (< 0 (+ .cse19 2))) (.cse16 (<= 4 ~SKIP2~0)) (.cse17 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse18 (= ~pended~0 0))) (or (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse2) (or .cse3 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse4 .cse5 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse16 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse17 .cse18))))) [2021-10-13 07:05:13,855 INFO L857 garLoopResultBuilder]: For program point L996-14(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,855 INFO L857 garLoopResultBuilder]: For program point L996-16(lines 996 1003) no Hoare annotation was computed. [2021-10-13 07:05:13,856 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,856 INFO L853 garLoopResultBuilder]: At program point L733(lines 733 748) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,856 INFO L853 garLoopResultBuilder]: At program point L667(lines 727 729) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,856 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,856 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,857 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,857 INFO L857 garLoopResultBuilder]: For program point L274(lines 274 280) no Hoare annotation was computed. [2021-10-13 07:05:13,857 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,857 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,857 INFO L853 garLoopResultBuilder]: At program point L210(lines 210 429) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,857 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,858 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 348) no Hoare annotation was computed. [2021-10-13 07:05:13,858 INFO L857 garLoopResultBuilder]: For program point L343-2(lines 343 348) no Hoare annotation was computed. [2021-10-13 07:05:13,858 INFO L860 garLoopResultBuilder]: At program point L807(lines 670 809) the Hoare annotation is: true [2021-10-13 07:05:13,858 INFO L857 garLoopResultBuilder]: For program point L213(lines 213 428) no Hoare annotation was computed. [2021-10-13 07:05:13,858 INFO L857 garLoopResultBuilder]: For program point L147(lines 147 149) no Hoare annotation was computed. [2021-10-13 07:05:13,858 INFO L853 garLoopResultBuilder]: At program point L546(lines 533 573) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse4 (= 2 ~DC~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ .cse19 1) 0)) (.cse3 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse8 (not (= ~IPC~0 2))) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse11 (<= 3 ~SKIP1~0)) (.cse12 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse13 (= ~NP~0 1)) (.cse14 (not (= ~MPR3~0 1))) (.cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse15 (< 0 (+ .cse19 2))) (.cse16 (<= 4 ~SKIP2~0)) (.cse17 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse18 (= ~pended~0 0))) (or (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse2) (or .cse3 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse4 .cse5 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse16 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse17 .cse18))))) [2021-10-13 07:05:13,859 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,859 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 427) no Hoare annotation was computed. [2021-10-13 07:05:13,859 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,859 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,859 INFO L853 garLoopResultBuilder]: At program point L217(lines 213 428) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,860 INFO L853 garLoopResultBuilder]: At program point L944(lines 944 956) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 07:05:13,860 INFO L853 garLoopResultBuilder]: At program point L944-1(lines 944 956) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 07:05:13,860 INFO L853 garLoopResultBuilder]: At program point L944-2(lines 944 956) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 07:05:13,860 INFO L853 garLoopResultBuilder]: At program point L944-3(lines 944 956) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 07:05:13,861 INFO L853 garLoopResultBuilder]: At program point L944-4(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,861 INFO L853 garLoopResultBuilder]: At program point L944-5(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,861 INFO L853 garLoopResultBuilder]: At program point L944-6(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,861 INFO L853 garLoopResultBuilder]: At program point L944-7(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,861 INFO L853 garLoopResultBuilder]: At program point L944-8(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,862 INFO L853 garLoopResultBuilder]: At program point L944-9(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,862 INFO L853 garLoopResultBuilder]: At program point L944-10(lines 944 956) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 07:05:13,862 INFO L853 garLoopResultBuilder]: At program point L944-11(lines 944 956) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 07:05:13,862 INFO L853 garLoopResultBuilder]: At program point L944-12(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,862 INFO L853 garLoopResultBuilder]: At program point L944-13(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,863 INFO L853 garLoopResultBuilder]: At program point L944-14(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,863 INFO L853 garLoopResultBuilder]: At program point L944-15(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,863 INFO L853 garLoopResultBuilder]: At program point L944-16(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,863 INFO L853 garLoopResultBuilder]: At program point L944-17(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,863 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 07:05:13,864 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,864 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 426) no Hoare annotation was computed. [2021-10-13 07:05:13,864 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,864 INFO L853 garLoopResultBuilder]: At program point L88(lines 710 749) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= 2 ~s~0)) (not (= ~IPC~0 2)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1))) [2021-10-13 07:05:13,864 INFO L857 garLoopResultBuilder]: For program point L1013(lines 1013 1019) no Hoare annotation was computed. [2021-10-13 07:05:13,864 INFO L857 garLoopResultBuilder]: For program point L1013-2(lines 1013 1019) no Hoare annotation was computed. [2021-10-13 07:05:13,865 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,865 INFO L857 garLoopResultBuilder]: For program point L1013-4(lines 1013 1019) no Hoare annotation was computed. [2021-10-13 07:05:13,865 INFO L857 garLoopResultBuilder]: For program point L1013-6(lines 1013 1019) no Hoare annotation was computed. [2021-10-13 07:05:13,865 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 425) no Hoare annotation was computed. [2021-10-13 07:05:13,865 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,865 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,865 INFO L857 garLoopResultBuilder]: For program point L751(lines 751 755) no Hoare annotation was computed. [2021-10-13 07:05:13,866 INFO L853 garLoopResultBuilder]: At program point L553-2(lines 553 569) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse5 (<= (+ .cse19 1) 0)) (.cse18 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse17 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse13 (< 0 (+ .cse19 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (= ~pended~0 0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse17) (or .cse18 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse15 .cse16))))) [2021-10-13 07:05:13,866 INFO L853 garLoopResultBuilder]: At program point L421(lines 232 422) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~DC~0)) (.cse3 (= 2 ~s~0)) (.cse5 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse11 (= ~pended~0 0)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (not (= ~IPC~0 2))) (.cse6 (<= 3 ~SKIP1~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse9 (not (= ~MPR3~0 1))) (.cse10 (<= 4 ~SKIP2~0))) (or (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~myStatus~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse11) (and (not (= ~SKIP2~0 2)) .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse7 .cse8 .cse9 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse10 .cse11) (and .cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= 2 ~DC~0) .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~SKIP2~0 ~s~0)))) [2021-10-13 07:05:13,866 INFO L853 garLoopResultBuilder]: At program point L223(lines 219 426) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,866 INFO L857 garLoopResultBuilder]: For program point L950(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,867 INFO L857 garLoopResultBuilder]: For program point L950-2(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,867 INFO L857 garLoopResultBuilder]: For program point L950-4(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,867 INFO L857 garLoopResultBuilder]: For program point L950-6(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,867 INFO L857 garLoopResultBuilder]: For program point L950-8(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,867 INFO L857 garLoopResultBuilder]: For program point L950-10(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,868 INFO L853 garLoopResultBuilder]: At program point L554(lines 553 569) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse5 (<= (+ .cse19 1) 0)) (.cse18 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse17 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse13 (< 0 (+ .cse19 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (= ~pended~0 0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse17) (or .cse18 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse15 .cse16))))) [2021-10-13 07:05:13,868 INFO L857 garLoopResultBuilder]: For program point L950-12(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,868 INFO L857 garLoopResultBuilder]: For program point L950-14(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,868 INFO L857 garLoopResultBuilder]: For program point L950-16(lines 950 954) no Hoare annotation was computed. [2021-10-13 07:05:13,868 INFO L853 garLoopResultBuilder]: At program point L225(lines 225 424) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,868 INFO L853 garLoopResultBuilder]: At program point L160(lines 100 162) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (= ~compRegistered~0 0))) (or (and (not (= ~SKIP2~0 2)) .cse0 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~pended~0 0) .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 4 ~SKIP2~0) .cse8))) [2021-10-13 07:05:13,869 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,869 INFO L853 garLoopResultBuilder]: At program point L228(lines 228 423) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,869 INFO L853 garLoopResultBuilder]: At program point L757(lines 750 805) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse2 (= 2 ~DC~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse15 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse16 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 0)) (.cse17 (not (= ~SKIP2~0 2))) (.cse13 (= ~s~0 ~DC~0)) (.cse14 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse4 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse0 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse6 .cse7 .cse16 .cse8 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse9 .cse10) (and .cse0 .cse13 (= ULTIMATE.start_main_~status~1 0) .cse14 .cse3 (= ~myStatus~0 0) .cse4 (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse10) (and (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0) .cse17 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse13 .cse14 .cse3 .cse10) (and (<= (+ 1073741823 ULTIMATE.start_main_~status~1) 0) .cse17 .cse13 .cse14 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse3 .cse4 .cse6 .cse7 .cse8 (<= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res|) 0)))) [2021-10-13 07:05:13,869 INFO L857 garLoopResultBuilder]: For program point L494(lines 494 506) no Hoare annotation was computed. [2021-10-13 07:05:13,870 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,870 INFO L857 garLoopResultBuilder]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-10-13 07:05:13,870 INFO L857 garLoopResultBuilder]: For program point L363(lines 363 369) no Hoare annotation was computed. [2021-10-13 07:05:13,870 INFO L853 garLoopResultBuilder]: At program point L231(lines 230 423) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 07:05:13,870 INFO L857 garLoopResultBuilder]: For program point L298-1(lines 232 420) no Hoare annotation was computed. [2021-10-13 07:05:13,870 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,871 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-13 07:05:13,875 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:05:13,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:05:13 BoogieIcfgContainer [2021-10-13 07:05:13,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:05:13,957 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:05:13,957 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:05:13,957 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:05:13,958 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:04:56" (3/4) ... [2021-10-13 07:05:13,961 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 07:05:14,005 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 215 nodes and edges [2021-10-13 07:05:14,009 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2021-10-13 07:05:14,013 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-10-13 07:05:14,017 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-13 07:05:14,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((1073741823 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0) [2021-10-13 07:05:14,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((1073741823 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0) [2021-10-13 07:05:14,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) || ((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || ((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || (((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) [2021-10-13 07:05:14,050 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && (status <= 258 || 260 <= status)) && 2 == DC) && (260 <= ntStatus || ntStatus <= 258)) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) || (((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && 2 == DC) && status == 0) && myStatus == 0) && \result == 0) && 4 <= SKIP2) && ntStatus == 0)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((260 <= ntStatus || ntStatus <= 258) && (((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)))) && (status <= 258 || 260 <= status)) && 2 == DC) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 4 <= SKIP2)) || ((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && 2 == DC) && !(2 == s)) && 4 <= SKIP2) [2021-10-13 07:05:14,058 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0) [2021-10-13 07:05:14,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(SKIP2 == 2) && 2 == DC) && !(259 == \result)) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) || (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) [2021-10-13 07:05:14,067 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-13 07:05:14,068 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) [2021-10-13 07:05:14,068 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) [2021-10-13 07:05:14,068 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) [2021-10-13 07:05:14,069 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) [2021-10-13 07:05:14,216 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:05:14,216 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:05:14,217 INFO L168 Benchmark]: Toolchain (without parser) took 20425.36 ms. Allocated memory was 113.2 MB in the beginning and 327.2 MB in the end (delta: 213.9 MB). Free memory was 76.9 MB in the beginning and 186.0 MB in the end (delta: -109.1 MB). Peak memory consumption was 104.0 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:14,218 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 79.7 MB. Free memory was 50.9 MB in the beginning and 50.9 MB in the end (delta: 29.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:05:14,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.42 ms. Allocated memory is still 113.2 MB. Free memory was 76.7 MB in the beginning and 79.5 MB in the end (delta: -2.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:14,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.47 ms. Allocated memory is still 113.2 MB. Free memory was 79.5 MB in the beginning and 72.1 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:14,219 INFO L168 Benchmark]: Boogie Preprocessor took 101.29 ms. Allocated memory is still 113.2 MB. Free memory was 71.5 MB in the beginning and 66.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:14,219 INFO L168 Benchmark]: RCFGBuilder took 2368.85 ms. Allocated memory was 113.2 MB in the beginning and 157.3 MB in the end (delta: 44.0 MB). Free memory was 66.9 MB in the beginning and 81.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:14,220 INFO L168 Benchmark]: TraceAbstraction took 16960.58 ms. Allocated memory was 157.3 MB in the beginning and 327.2 MB in the end (delta: 169.9 MB). Free memory was 81.3 MB in the beginning and 219.6 MB in the end (delta: -138.3 MB). Peak memory consumption was 152.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:14,220 INFO L168 Benchmark]: Witness Printer took 259.23 ms. Allocated memory is still 327.2 MB. Free memory was 219.6 MB in the beginning and 186.0 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:05:14,223 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 79.7 MB. Free memory was 50.9 MB in the beginning and 50.9 MB in the end (delta: 29.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 602.42 ms. Allocated memory is still 113.2 MB. Free memory was 76.7 MB in the beginning and 79.5 MB in the end (delta: -2.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 122.47 ms. Allocated memory is still 113.2 MB. Free memory was 79.5 MB in the beginning and 72.1 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 101.29 ms. Allocated memory is still 113.2 MB. Free memory was 71.5 MB in the beginning and 66.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2368.85 ms. Allocated memory was 113.2 MB in the beginning and 157.3 MB in the end (delta: 44.0 MB). Free memory was 66.9 MB in the beginning and 81.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16960.58 ms. Allocated memory was 157.3 MB in the beginning and 327.2 MB in the end (delta: 169.9 MB). Free memory was 81.3 MB in the beginning and 219.6 MB in the end (delta: -138.3 MB). Peak memory consumption was 152.1 MB. Max. memory is 16.1 GB. * Witness Printer took 259.23 ms. Allocated memory is still 327.2 MB. Free memory was 219.6 MB in the beginning and 186.0 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 255 locations, 40 error locations. Started 1 CEGAR loops. OverallTime: 16790.7ms, OverallIterations: 37, TraceHistogramMax: 1, EmptinessCheckTime: 42.4ms, AutomataDifference: 4501.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 8688.3ms, InitialAbstractionConstructionTime: 15.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6718 SDtfs, 5346 SDslu, 7014 SDs, 0 SdLazy, 2938 SolverSat, 385 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2101.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 928.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=6, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 759.0ms AutomataMinimizationTime, 37 MinimizatonAttempts, 546 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 82 LocationsWithAnnotation, 82 PreInvPairs, 247 NumberOfFragments, 6910 HoareAnnotationTreeSize, 82 FomulaSimplifications, 440009 FormulaSimplificationTreeSizeReduction, 1525.4ms HoareSimplificationTime, 82 FomulaSimplificationsInter, 42180 FormulaSimplificationTreeSizeReductionInter, 7135.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 167.3ms SsaConstructionTime, 520.2ms SatisfiabilityAnalysisTime, 1584.7ms InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 2689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold - InvariantResult [Line: 704]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((1073741823 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0) - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 750]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 670]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (!(259 == returnVal2) || MPR3 == s)) && setEventCalled == 1) && ((259 <= returnVal2 && returnVal2 <= 259) || s == NP)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && !(259 == returnVal2)) && ntStatus == 0) && pended == 0) && !(MPR3 == s) - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 534]: Loop Invariant Derived loop invariant: (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 758]: Loop Invariant Derived loop invariant: (((((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) || ((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || ((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || (((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((!(SKIP2 == 2) && 2 == DC) && !(259 == \result)) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) || (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && setEventCalled == 1) && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && !(259 == returnVal2)) && pended == 0) && !(MPR3 == s) - InvariantResult [Line: 710]: Loop Invariant Derived loop invariant: ((((((((((((((2 == DC && status == 0) && !(2 == s)) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && !(MPR3 == s)) && !(s == 1) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: (((((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && (status <= 258 || 260 <= status)) && 2 == DC) && (260 <= ntStatus || ntStatus <= 258)) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) || (((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && 2 == DC) && status == 0) && myStatus == 0) && \result == 0) && 4 <= SKIP2) && ntStatus == 0)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((260 <= ntStatus || ntStatus <= 258) && (((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)))) && (status <= 258 || 260 <= status)) && 2 == DC) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 4 <= SKIP2)) || ((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && 2 == DC) && !(2 == s)) && 4 <= SKIP2) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) || ((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || (((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || ((((((((((lowerDriverReturn == returnVal2 && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 1009]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 727]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: (((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && !(MPR3 == s) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (!(259 == returnVal2) || MPR3 == s)) && setEventCalled == 1) && ((259 <= returnVal2 && returnVal2 <= 259) || s == NP)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (!(259 == returnVal2) || MPR3 == s)) && setEventCalled == 1) && ((259 <= returnVal2 && returnVal2 <= 259) || s == NP)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 750]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((1073741823 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1009]: Loop Invariant Derived loop invariant: (((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && status == 0) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && s == DC) && status == 0) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) RESULT: Ultimate proved your program to be correct! [2021-10-13 07:05:14,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10d321fc-ecee-4975-bbf4-e34b593bb02a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...