./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/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_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8 --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 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:24:41,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:24:41,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:24:41,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:24:41,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:24:41,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:24:41,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:24:41,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:24:41,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:24:41,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:24:41,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:24:41,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:24:41,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:24:41,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:24:41,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:24:41,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:24:41,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:24:41,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:24:41,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:24:41,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:24:41,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:24:41,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:24:41,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:24:41,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:24:41,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:24:41,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:24:41,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:24:41,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:24:41,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:24:41,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:24:41,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:24:41,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:24:41,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:24:41,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:24:41,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:24:41,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:24:41,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:24:41,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:24:41,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:24:41,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:24:41,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:24:41,619 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:24:41,669 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:24:41,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:24:41,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:24:41,672 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:24:41,672 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:24:41,672 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:24:41,673 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:24:41,673 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:24:41,680 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:24:41,681 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:24:41,682 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:24:41,682 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:24:41,683 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:24:41,683 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:24:41,683 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:24:41,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:24:41,684 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:24:41,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:24:41,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:24:41,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:24:41,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:24:41,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:24:41,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:24:41,686 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:24:41,687 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:24:41,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:24:41,687 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:24:41,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:24:41,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:24:41,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:24:41,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:24:41,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:24:41,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:24:41,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:24:41,690 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:24:41,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:24:41,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:24:41,690 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:24:41,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:24:41,691 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_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/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_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8 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 -> 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa [2021-11-07 02:24:41,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:24:42,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:24:42,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:24:42,037 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:24:42,037 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:24:42,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-11-07 02:24:42,130 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/data/db388f112/5aeeeed94fd34ae687203ce5e25856fd/FLAG2333f5bfe [2021-11-07 02:24:42,717 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:24:42,718 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-11-07 02:24:42,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/data/db388f112/5aeeeed94fd34ae687203ce5e25856fd/FLAG2333f5bfe [2021-11-07 02:24:43,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/data/db388f112/5aeeeed94fd34ae687203ce5e25856fd [2021-11-07 02:24:43,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:24:43,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:24:43,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:24:43,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:24:43,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:24:43,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101effba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43, skipping insertion in model container [2021-11-07 02:24:43,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:24:43,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:24:43,351 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_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-11-07 02:24:43,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:24:43,513 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:24:43,536 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_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-11-07 02:24:43,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:24:43,656 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:24:43,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43 WrapperNode [2021-11-07 02:24:43,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:24:43,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:24:43,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:24:43,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:24:43,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:24:43,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:24:43,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:24:43,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:24:43,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:24:43,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:24:43,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:24:43,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:24:43,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (1/1) ... [2021-11-07 02:24:43,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:24:43,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:24:43,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:24:44,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:24:44,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:24:44,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:24:44,328 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,353 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,371 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,377 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,380 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,399 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,404 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,422 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,424 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,425 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,430 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,441 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,443 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,443 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,446 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,449 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,455 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,460 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,463 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,466 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,470 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,471 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,472 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:44,474 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:24:45,510 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-11-07 02:24:45,510 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-11-07 02:24:45,510 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-11-07 02:24:45,511 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-11-07 02:24:45,511 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-11-07 02:24:45,511 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-11-07 02:24:45,511 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-11-07 02:24:45,512 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-11-07 02:24:45,512 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-11-07 02:24:45,512 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-11-07 02:24:45,512 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-11-07 02:24:45,512 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-11-07 02:24:45,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-11-07 02:24:45,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-11-07 02:24:45,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-11-07 02:24:45,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-11-07 02:24:45,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-11-07 02:24:45,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-11-07 02:24:45,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-11-07 02:24:45,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-11-07 02:24:45,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-11-07 02:24:45,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-11-07 02:24:45,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-07 02:24:45,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-07 02:24:45,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-11-07 02:24:45,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-11-07 02:24:45,516 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-11-07 02:24:45,516 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-11-07 02:24:45,516 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-11-07 02:24:45,516 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-11-07 02:24:45,517 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-11-07 02:24:45,517 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-11-07 02:24:45,517 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-11-07 02:24:45,517 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-11-07 02:24:45,517 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-11-07 02:24:45,518 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-11-07 02:24:45,518 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-11-07 02:24:45,518 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-11-07 02:24:45,518 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-11-07 02:24:45,518 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-11-07 02:24:45,519 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-11-07 02:24:45,519 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-11-07 02:24:45,519 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-11-07 02:24:45,519 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-11-07 02:24:45,519 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-11-07 02:24:45,520 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-11-07 02:24:45,520 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-11-07 02:24:45,520 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-11-07 02:24:46,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:24:46,516 INFO L299 CfgBuilder]: Removed 205 assume(true) statements. [2021-11-07 02:24:46,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:24:46 BoogieIcfgContainer [2021-11-07 02:24:46,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:24:46,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:24:46,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:24:46,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:24:46,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:24:43" (1/3) ... [2021-11-07 02:24:46,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db98d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:24:46, skipping insertion in model container [2021-11-07 02:24:46,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:24:43" (2/3) ... [2021-11-07 02:24:46,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db98d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:24:46, skipping insertion in model container [2021-11-07 02:24:46,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:24:46" (3/3) ... [2021-11-07 02:24:46,535 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2021-11-07 02:24:46,546 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:24:46,546 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2021-11-07 02:24:46,631 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:24:46,640 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, mAutomataTypeConcurrency=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-11-07 02:24:46,641 INFO L340 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2021-11-07 02:24:46,667 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-11-07 02:24:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 02:24:46,673 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:46,674 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:46,675 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-11-07 02:24:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 119908539, now seen corresponding path program 1 times [2021-11-07 02:24:46,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:46,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830286629] [2021-11-07 02:24:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:46,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:46,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-11-07 02:24:46,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:46,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830286629] [2021-11-07 02:24:46,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830286629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:46,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:46,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:46,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83719380] [2021-11-07 02:24:46,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:46,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:46,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:46,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:46,974 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-11-07 02:24:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:47,353 INFO L93 Difference]: Finished difference Result 480 states and 716 transitions. [2021-11-07 02:24:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:47,362 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-11-07 02:24:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:47,389 INFO L225 Difference]: With dead ends: 480 [2021-11-07 02:24:47,389 INFO L226 Difference]: Without dead ends: 256 [2021-11-07 02:24:47,395 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-07 02:24:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-07 02:24:47,458 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-11-07 02:24:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 340 transitions. [2021-11-07 02:24:47,462 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 340 transitions. Word has length 7 [2021-11-07 02:24:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:47,463 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 340 transitions. [2021-11-07 02:24:47,463 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-11-07 02:24:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 340 transitions. [2021-11-07 02:24:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:24:47,464 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:47,465 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:47,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:24:47,465 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-11-07 02:24:47,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash -672701586, now seen corresponding path program 1 times [2021-11-07 02:24:47,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:47,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084924092] [2021-11-07 02:24:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:47,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:47,553 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:47,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084924092] [2021-11-07 02:24:47,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084924092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:47,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:47,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:47,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883091315] [2021-11-07 02:24:47,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:47,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:47,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:47,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:47,557 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-11-07 02:24:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:47,617 INFO L93 Difference]: Finished difference Result 472 states and 620 transitions. [2021-11-07 02:24:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:47,618 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-11-07 02:24:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:47,621 INFO L225 Difference]: With dead ends: 472 [2021-11-07 02:24:47,621 INFO L226 Difference]: Without dead ends: 330 [2021-11-07 02:24:47,623 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-07 02:24:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2021-11-07 02:24:47,646 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-11-07 02:24:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2021-11-07 02:24:47,648 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 9 [2021-11-07 02:24:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:47,648 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2021-11-07 02:24:47,649 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-11-07 02:24:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2021-11-07 02:24:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:24:47,650 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:47,650 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:47,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:24:47,651 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-11-07 02:24:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1551307607, now seen corresponding path program 1 times [2021-11-07 02:24:47,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:47,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484112797] [2021-11-07 02:24:47,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:47,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:47,700 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:47,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484112797] [2021-11-07 02:24:47,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484112797] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:47,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:47,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:24:47,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67213084] [2021-11-07 02:24:47,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:47,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:47,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:47,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:47,703 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-11-07 02:24:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:47,725 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2021-11-07 02:24:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:47,726 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-11-07 02:24:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:47,728 INFO L225 Difference]: With dead ends: 263 [2021-11-07 02:24:47,728 INFO L226 Difference]: Without dead ends: 244 [2021-11-07 02:24:47,729 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-07 02:24:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-11-07 02:24:47,764 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-11-07 02:24:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 322 transitions. [2021-11-07 02:24:47,767 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 322 transitions. Word has length 10 [2021-11-07 02:24:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:47,767 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 322 transitions. [2021-11-07 02:24:47,768 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-11-07 02:24:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 322 transitions. [2021-11-07 02:24:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:24:47,772 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:47,772 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:47,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:24:47,773 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-11-07 02:24:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1935314780, now seen corresponding path program 1 times [2021-11-07 02:24:47,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:47,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356892786] [2021-11-07 02:24:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:47,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:47,903 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:47,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356892786] [2021-11-07 02:24:47,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356892786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:47,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:47,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:47,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52209117] [2021-11-07 02:24:47,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:47,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:47,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:47,912 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-11-07 02:24:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:47,944 INFO L93 Difference]: Finished difference Result 301 states and 390 transitions. [2021-11-07 02:24:47,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:47,945 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-11-07 02:24:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:47,947 INFO L225 Difference]: With dead ends: 301 [2021-11-07 02:24:47,947 INFO L226 Difference]: Without dead ends: 281 [2021-11-07 02:24:47,948 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-07 02:24:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2021-11-07 02:24:47,971 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-11-07 02:24:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 348 transitions. [2021-11-07 02:24:47,973 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 348 transitions. Word has length 13 [2021-11-07 02:24:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:47,974 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 348 transitions. [2021-11-07 02:24:47,974 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-11-07 02:24:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 348 transitions. [2021-11-07 02:24:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:24:47,976 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:47,976 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:47,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:24:47,977 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-11-07 02:24:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash -684354150, now seen corresponding path program 1 times [2021-11-07 02:24:47,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:47,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043551762] [2021-11-07 02:24:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:47,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:48,077 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:48,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043551762] [2021-11-07 02:24:48,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043551762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:48,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:48,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:24:48,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060786708] [2021-11-07 02:24:48,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:48,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:48,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:48,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:48,081 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-11-07 02:24:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:48,122 INFO L93 Difference]: Finished difference Result 325 states and 414 transitions. [2021-11-07 02:24:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:24:48,123 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-11-07 02:24:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:48,125 INFO L225 Difference]: With dead ends: 325 [2021-11-07 02:24:48,125 INFO L226 Difference]: Without dead ends: 289 [2021-11-07 02:24:48,127 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-07 02:24:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 249. [2021-11-07 02:24:48,162 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-11-07 02:24:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 327 transitions. [2021-11-07 02:24:48,164 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 327 transitions. Word has length 16 [2021-11-07 02:24:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:48,165 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 327 transitions. [2021-11-07 02:24:48,165 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-11-07 02:24:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 327 transitions. [2021-11-07 02:24:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:24:48,173 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:48,173 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:48,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:24:48,174 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-11-07 02:24:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1690048014, now seen corresponding path program 1 times [2021-11-07 02:24:48,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:48,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487633255] [2021-11-07 02:24:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:48,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:48,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:48,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487633255] [2021-11-07 02:24:48,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487633255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:48,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:48,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:48,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156197097] [2021-11-07 02:24:48,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:48,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:48,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:48,261 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-11-07 02:24:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:48,415 INFO L93 Difference]: Finished difference Result 271 states and 353 transitions. [2021-11-07 02:24:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:48,416 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-11-07 02:24:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:48,418 INFO L225 Difference]: With dead ends: 271 [2021-11-07 02:24:48,419 INFO L226 Difference]: Without dead ends: 266 [2021-11-07 02:24:48,419 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-07 02:24:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-11-07 02:24:48,438 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-11-07 02:24:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 348 transitions. [2021-11-07 02:24:48,440 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 348 transitions. Word has length 16 [2021-11-07 02:24:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:48,440 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 348 transitions. [2021-11-07 02:24:48,440 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-11-07 02:24:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 348 transitions. [2021-11-07 02:24:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:24:48,444 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:48,444 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:48,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:24:48,444 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-11-07 02:24:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1122523632, now seen corresponding path program 1 times [2021-11-07 02:24:48,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:48,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844396601] [2021-11-07 02:24:48,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:48,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:48,511 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:48,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844396601] [2021-11-07 02:24:48,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844396601] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:48,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:48,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:48,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551484161] [2021-11-07 02:24:48,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:48,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:48,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:48,515 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-11-07 02:24:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:48,650 INFO L93 Difference]: Finished difference Result 266 states and 348 transitions. [2021-11-07 02:24:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:48,652 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-11-07 02:24:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:48,656 INFO L225 Difference]: With dead ends: 266 [2021-11-07 02:24:48,656 INFO L226 Difference]: Without dead ends: 254 [2021-11-07 02:24:48,657 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-11-07 02:24:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-11-07 02:24:48,672 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-11-07 02:24:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 336 transitions. [2021-11-07 02:24:48,674 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 336 transitions. Word has length 17 [2021-11-07 02:24:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:48,675 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 336 transitions. [2021-11-07 02:24:48,675 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-11-07 02:24:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 336 transitions. [2021-11-07 02:24:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:24:48,676 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:48,677 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:48,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:24:48,678 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-11-07 02:24:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash -984746365, now seen corresponding path program 1 times [2021-11-07 02:24:48,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:48,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519020900] [2021-11-07 02:24:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:48,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:48,752 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:48,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519020900] [2021-11-07 02:24:48,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519020900] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:48,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:48,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:48,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519134114] [2021-11-07 02:24:48,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:48,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:48,754 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-11-07 02:24:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:48,878 INFO L93 Difference]: Finished difference Result 354 states and 469 transitions. [2021-11-07 02:24:48,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:48,879 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-11-07 02:24:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:48,881 INFO L225 Difference]: With dead ends: 354 [2021-11-07 02:24:48,881 INFO L226 Difference]: Without dead ends: 251 [2021-11-07 02:24:48,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-07 02:24:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-11-07 02:24:48,895 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-11-07 02:24:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 332 transitions. [2021-11-07 02:24:48,897 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 332 transitions. Word has length 17 [2021-11-07 02:24:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:48,897 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 332 transitions. [2021-11-07 02:24:48,898 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-11-07 02:24:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2021-11-07 02:24:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:24:48,898 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:48,899 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:48,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:24:48,899 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-11-07 02:24:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash -834424813, now seen corresponding path program 1 times [2021-11-07 02:24:48,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:48,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624094281] [2021-11-07 02:24:48,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:48,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:48,969 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:48,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624094281] [2021-11-07 02:24:48,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624094281] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:48,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:48,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:48,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057654309] [2021-11-07 02:24:48,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:48,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:48,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:48,977 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-11-07 02:24:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:49,115 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2021-11-07 02:24:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:49,115 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-11-07 02:24:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:49,117 INFO L225 Difference]: With dead ends: 256 [2021-11-07 02:24:49,118 INFO L226 Difference]: Without dead ends: 251 [2021-11-07 02:24:49,118 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-07 02:24:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-11-07 02:24:49,151 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-11-07 02:24:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2021-11-07 02:24:49,153 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 17 [2021-11-07 02:24:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:49,154 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2021-11-07 02:24:49,154 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-11-07 02:24:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2021-11-07 02:24:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 02:24:49,155 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:49,155 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:49,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:24:49,156 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-11-07 02:24:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -590061255, now seen corresponding path program 1 times [2021-11-07 02:24:49,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:49,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159027522] [2021-11-07 02:24:49,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:49,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:49,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:49,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159027522] [2021-11-07 02:24:49,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159027522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:49,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:49,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:49,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912737731] [2021-11-07 02:24:49,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:49,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:49,215 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-11-07 02:24:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:49,252 INFO L93 Difference]: Finished difference Result 344 states and 443 transitions. [2021-11-07 02:24:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:49,252 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-11-07 02:24:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:49,254 INFO L225 Difference]: With dead ends: 344 [2021-11-07 02:24:49,255 INFO L226 Difference]: Without dead ends: 249 [2021-11-07 02:24:49,255 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-07 02:24:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 235. [2021-11-07 02:24:49,272 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-11-07 02:24:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 304 transitions. [2021-11-07 02:24:49,273 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 304 transitions. Word has length 18 [2021-11-07 02:24:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:49,274 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 304 transitions. [2021-11-07 02:24:49,274 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-11-07 02:24:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 304 transitions. [2021-11-07 02:24:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 02:24:49,275 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:49,275 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:49,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:24:49,276 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-11-07 02:24:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash -626633759, now seen corresponding path program 1 times [2021-11-07 02:24:49,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:49,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407805745] [2021-11-07 02:24:49,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:49,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:49,339 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:49,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407805745] [2021-11-07 02:24:49,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407805745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:49,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:49,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:49,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485946878] [2021-11-07 02:24:49,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:49,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:49,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:49,343 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-11-07 02:24:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:49,481 INFO L93 Difference]: Finished difference Result 240 states and 308 transitions. [2021-11-07 02:24:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:49,482 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-11-07 02:24:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:49,484 INFO L225 Difference]: With dead ends: 240 [2021-11-07 02:24:49,484 INFO L226 Difference]: Without dead ends: 235 [2021-11-07 02:24:49,484 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-07 02:24:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-11-07 02:24:49,502 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-11-07 02:24:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 303 transitions. [2021-11-07 02:24:49,504 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 303 transitions. Word has length 18 [2021-11-07 02:24:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:49,504 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 303 transitions. [2021-11-07 02:24:49,504 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-11-07 02:24:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 303 transitions. [2021-11-07 02:24:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:24:49,505 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:49,505 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:49,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:24:49,506 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-11-07 02:24:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash 964254453, now seen corresponding path program 1 times [2021-11-07 02:24:49,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:49,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554585311] [2021-11-07 02:24:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:49,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:49,535 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:49,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554585311] [2021-11-07 02:24:49,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554585311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:49,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:49,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:49,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134639791] [2021-11-07 02:24:49,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:49,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:49,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:49,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:49,537 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-11-07 02:24:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:49,671 INFO L93 Difference]: Finished difference Result 306 states and 388 transitions. [2021-11-07 02:24:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:49,671 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-11-07 02:24:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:49,673 INFO L225 Difference]: With dead ends: 306 [2021-11-07 02:24:49,673 INFO L226 Difference]: Without dead ends: 298 [2021-11-07 02:24:49,674 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-07 02:24:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 243. [2021-11-07 02:24:49,693 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-11-07 02:24:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 315 transitions. [2021-11-07 02:24:49,694 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 315 transitions. Word has length 19 [2021-11-07 02:24:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:49,695 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 315 transitions. [2021-11-07 02:24:49,695 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-11-07 02:24:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 315 transitions. [2021-11-07 02:24:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:24:49,696 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:49,696 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:49,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:24:49,696 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-11-07 02:24:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1688925962, now seen corresponding path program 1 times [2021-11-07 02:24:49,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:49,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347779485] [2021-11-07 02:24:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:49,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:49,730 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:49,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347779485] [2021-11-07 02:24:49,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347779485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:49,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:49,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:24:49,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475418579] [2021-11-07 02:24:49,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:49,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:49,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:49,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:49,732 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-11-07 02:24:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:49,780 INFO L93 Difference]: Finished difference Result 256 states and 327 transitions. [2021-11-07 02:24:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:49,781 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-11-07 02:24:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:49,783 INFO L225 Difference]: With dead ends: 256 [2021-11-07 02:24:49,783 INFO L226 Difference]: Without dead ends: 241 [2021-11-07 02:24:49,783 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-07 02:24:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-11-07 02:24:49,823 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-11-07 02:24:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 312 transitions. [2021-11-07 02:24:49,824 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 312 transitions. Word has length 19 [2021-11-07 02:24:49,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:49,825 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 312 transitions. [2021-11-07 02:24:49,825 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-11-07 02:24:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 312 transitions. [2021-11-07 02:24:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:24:49,826 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:49,826 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:49,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 02:24:49,827 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-11-07 02:24:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash -180541531, now seen corresponding path program 1 times [2021-11-07 02:24:49,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:49,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377697186] [2021-11-07 02:24:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:49,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:49,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-11-07 02:24:49,895 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:49,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377697186] [2021-11-07 02:24:49,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377697186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:49,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:49,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:49,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922713159] [2021-11-07 02:24:49,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:49,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:49,897 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-11-07 02:24:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:50,058 INFO L93 Difference]: Finished difference Result 273 states and 349 transitions. [2021-11-07 02:24:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:50,059 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-11-07 02:24:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:50,061 INFO L225 Difference]: With dead ends: 273 [2021-11-07 02:24:50,061 INFO L226 Difference]: Without dead ends: 236 [2021-11-07 02:24:50,063 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-07 02:24:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-11-07 02:24:50,087 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-11-07 02:24:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2021-11-07 02:24:50,088 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 20 [2021-11-07 02:24:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:50,089 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2021-11-07 02:24:50,089 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-11-07 02:24:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2021-11-07 02:24:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:24:50,091 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:50,091 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:24:50,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 02:24:50,092 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-11-07 02:24:50,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:50,092 INFO L85 PathProgramCache]: Analyzing trace with hash 217229373, now seen corresponding path program 1 times [2021-11-07 02:24:50,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:50,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780499966] [2021-11-07 02:24:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:50,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:50,150 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:50,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780499966] [2021-11-07 02:24:50,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780499966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:50,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:50,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:50,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620134537] [2021-11-07 02:24:50,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:50,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:50,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:50,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:50,153 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-11-07 02:24:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:50,193 INFO L93 Difference]: Finished difference Result 353 states and 446 transitions. [2021-11-07 02:24:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:50,193 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-11-07 02:24:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:50,195 INFO L225 Difference]: With dead ends: 353 [2021-11-07 02:24:50,195 INFO L226 Difference]: Without dead ends: 259 [2021-11-07 02:24:50,198 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-07 02:24:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 224. [2021-11-07 02:24:50,219 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-11-07 02:24:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2021-11-07 02:24:50,221 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 20 [2021-11-07 02:24:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:50,223 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2021-11-07 02:24:50,223 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-11-07 02:24:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2021-11-07 02:24:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 02:24:50,227 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:50,227 INFO L513 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-11-07 02:24:50,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 02:24:50,228 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-11-07 02:24:50,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash -112139151, now seen corresponding path program 1 times [2021-11-07 02:24:50,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:50,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58942115] [2021-11-07 02:24:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:50,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:50,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:50,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58942115] [2021-11-07 02:24:50,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58942115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:50,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:50,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:50,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964377174] [2021-11-07 02:24:50,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:50,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:50,416 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-11-07 02:24:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:50,470 INFO L93 Difference]: Finished difference Result 324 states and 408 transitions. [2021-11-07 02:24:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:50,471 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-11-07 02:24:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:50,473 INFO L225 Difference]: With dead ends: 324 [2021-11-07 02:24:50,473 INFO L226 Difference]: Without dead ends: 226 [2021-11-07 02:24:50,474 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-07 02:24:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2021-11-07 02:24:50,497 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-11-07 02:24:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 268 transitions. [2021-11-07 02:24:50,499 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 268 transitions. Word has length 21 [2021-11-07 02:24:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:50,499 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 268 transitions. [2021-11-07 02:24:50,499 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-11-07 02:24:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2021-11-07 02:24:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:24:50,501 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:50,501 INFO L513 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-11-07 02:24:50,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 02:24:50,501 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-11-07 02:24:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 135545772, now seen corresponding path program 1 times [2021-11-07 02:24:50,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:50,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379709504] [2021-11-07 02:24:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:50,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:50,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:50,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379709504] [2021-11-07 02:24:50,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379709504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:50,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:50,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:50,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556957980] [2021-11-07 02:24:50,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:50,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:50,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:50,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:50,584 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-11-07 02:24:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:50,752 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2021-11-07 02:24:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:50,753 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-11-07 02:24:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:50,754 INFO L225 Difference]: With dead ends: 324 [2021-11-07 02:24:50,755 INFO L226 Difference]: Without dead ends: 238 [2021-11-07 02:24:50,755 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-07 02:24:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 212. [2021-11-07 02:24:50,782 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-11-07 02:24:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 265 transitions. [2021-11-07 02:24:50,783 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 265 transitions. Word has length 22 [2021-11-07 02:24:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:50,783 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 265 transitions. [2021-11-07 02:24:50,784 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-11-07 02:24:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 265 transitions. [2021-11-07 02:24:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 02:24:50,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:50,785 INFO L513 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-11-07 02:24:50,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 02:24:50,785 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-11-07 02:24:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -458730667, now seen corresponding path program 1 times [2021-11-07 02:24:50,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:50,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072744339] [2021-11-07 02:24:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:50,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:50,855 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:50,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072744339] [2021-11-07 02:24:50,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072744339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:50,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:50,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:24:50,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29646515] [2021-11-07 02:24:50,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:24:50,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:50,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:24:50,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:50,859 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-11-07 02:24:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:51,127 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2021-11-07 02:24:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:51,127 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-11-07 02:24:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:51,130 INFO L225 Difference]: With dead ends: 278 [2021-11-07 02:24:51,130 INFO L226 Difference]: Without dead ends: 274 [2021-11-07 02:24:51,131 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-11-07 02:24:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 212. [2021-11-07 02:24:51,155 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-11-07 02:24:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 265 transitions. [2021-11-07 02:24:51,157 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 265 transitions. Word has length 23 [2021-11-07 02:24:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:51,157 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 265 transitions. [2021-11-07 02:24:51,158 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-11-07 02:24:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 265 transitions. [2021-11-07 02:24:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:24:51,159 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:51,159 INFO L513 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-11-07 02:24:51,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 02:24:51,159 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-11-07 02:24:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1186277304, now seen corresponding path program 1 times [2021-11-07 02:24:51,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:51,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789114888] [2021-11-07 02:24:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:51,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:51,208 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:51,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789114888] [2021-11-07 02:24:51,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789114888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:51,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:51,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:51,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495409829] [2021-11-07 02:24:51,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:51,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:51,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:51,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:51,212 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-11-07 02:24:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:51,365 INFO L93 Difference]: Finished difference Result 271 states and 330 transitions. [2021-11-07 02:24:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:51,366 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-11-07 02:24:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:51,368 INFO L225 Difference]: With dead ends: 271 [2021-11-07 02:24:51,368 INFO L226 Difference]: Without dead ends: 238 [2021-11-07 02:24:51,368 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-07 02:24:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 212. [2021-11-07 02:24:51,416 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-11-07 02:24:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 259 transitions. [2021-11-07 02:24:51,417 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 259 transitions. Word has length 24 [2021-11-07 02:24:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:51,418 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 259 transitions. [2021-11-07 02:24:51,418 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-11-07 02:24:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 259 transitions. [2021-11-07 02:24:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:24:51,419 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:51,419 INFO L513 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-11-07 02:24:51,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 02:24:51,420 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-11-07 02:24:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1566284008, now seen corresponding path program 1 times [2021-11-07 02:24:51,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:51,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165670990] [2021-11-07 02:24:51,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:51,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:51,460 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:51,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165670990] [2021-11-07 02:24:51,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165670990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:51,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:51,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:51,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797529688] [2021-11-07 02:24:51,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:51,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:51,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:51,462 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-11-07 02:24:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:51,595 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2021-11-07 02:24:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:51,595 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-11-07 02:24:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:51,597 INFO L225 Difference]: With dead ends: 245 [2021-11-07 02:24:51,597 INFO L226 Difference]: Without dead ends: 212 [2021-11-07 02:24:51,598 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-07 02:24:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-11-07 02:24:51,628 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-11-07 02:24:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-11-07 02:24:51,629 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 25 [2021-11-07 02:24:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:51,630 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-11-07 02:24:51,630 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-11-07 02:24:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-11-07 02:24:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:24:51,631 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:51,631 INFO L513 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-11-07 02:24:51,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 02:24:51,632 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-11-07 02:24:51,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1594212847, now seen corresponding path program 1 times [2021-11-07 02:24:51,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:51,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140096233] [2021-11-07 02:24:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:51,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:51,703 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:51,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140096233] [2021-11-07 02:24:51,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140096233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:51,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:51,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:24:51,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497277890] [2021-11-07 02:24:51,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:24:51,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:51,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:24:51,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:51,706 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-11-07 02:24:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:51,912 INFO L93 Difference]: Finished difference Result 232 states and 279 transitions. [2021-11-07 02:24:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:24:51,913 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-11-07 02:24:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:51,914 INFO L225 Difference]: With dead ends: 232 [2021-11-07 02:24:51,914 INFO L226 Difference]: Without dead ends: 230 [2021-11-07 02:24:51,915 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-07 02:24:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2021-11-07 02:24:51,940 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-11-07 02:24:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-11-07 02:24:51,941 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 25 [2021-11-07 02:24:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:51,941 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-11-07 02:24:51,942 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-11-07 02:24:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-11-07 02:24:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 02:24:51,943 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:51,943 INFO L513 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-11-07 02:24:51,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 02:24:51,943 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-11-07 02:24:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1509861448, now seen corresponding path program 1 times [2021-11-07 02:24:51,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:51,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132263685] [2021-11-07 02:24:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:51,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:51,982 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:51,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132263685] [2021-11-07 02:24:51,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132263685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:51,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:51,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:24:51,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008538327] [2021-11-07 02:24:51,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:24:51,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:24:51,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:51,985 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-11-07 02:24:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:52,056 INFO L93 Difference]: Finished difference Result 226 states and 266 transitions. [2021-11-07 02:24:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:24:52,058 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-11-07 02:24:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:52,060 INFO L225 Difference]: With dead ends: 226 [2021-11-07 02:24:52,060 INFO L226 Difference]: Without dead ends: 202 [2021-11-07 02:24:52,060 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:24:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-07 02:24:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-11-07 02:24:52,084 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-11-07 02:24:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 237 transitions. [2021-11-07 02:24:52,085 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 237 transitions. Word has length 26 [2021-11-07 02:24:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:52,086 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 237 transitions. [2021-11-07 02:24:52,086 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-11-07 02:24:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 237 transitions. [2021-11-07 02:24:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 02:24:52,087 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:52,087 INFO L513 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-11-07 02:24:52,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 02:24:52,088 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-11-07 02:24:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2072887667, now seen corresponding path program 1 times [2021-11-07 02:24:52,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:52,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602397280] [2021-11-07 02:24:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:52,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:52,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-11-07 02:24:52,115 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:52,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602397280] [2021-11-07 02:24:52,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602397280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:52,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:52,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:52,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476431186] [2021-11-07 02:24:52,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:24:52,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:52,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:24:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:52,118 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-11-07 02:24:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:52,207 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2021-11-07 02:24:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:24:52,208 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-11-07 02:24:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:52,209 INFO L225 Difference]: With dead ends: 215 [2021-11-07 02:24:52,210 INFO L226 Difference]: Without dead ends: 201 [2021-11-07 02:24:52,210 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:24:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-11-07 02:24:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2021-11-07 02:24:52,235 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-11-07 02:24:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2021-11-07 02:24:52,236 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 26 [2021-11-07 02:24:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:52,237 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2021-11-07 02:24:52,237 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-11-07 02:24:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2021-11-07 02:24:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:24:52,258 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:52,258 INFO L513 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-11-07 02:24:52,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 02:24:52,259 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-11-07 02:24:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 182459748, now seen corresponding path program 1 times [2021-11-07 02:24:52,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:52,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811185913] [2021-11-07 02:24:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:52,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:52,298 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:52,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811185913] [2021-11-07 02:24:52,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811185913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:52,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:52,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:24:52,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367840766] [2021-11-07 02:24:52,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:24:52,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:52,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:24:52,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:52,301 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-11-07 02:24:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:52,431 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2021-11-07 02:24:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:52,432 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-11-07 02:24:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:52,434 INFO L225 Difference]: With dead ends: 212 [2021-11-07 02:24:52,434 INFO L226 Difference]: Without dead ends: 209 [2021-11-07 02:24:52,434 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:24:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-07 02:24:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2021-11-07 02:24:52,463 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-11-07 02:24:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2021-11-07 02:24:52,464 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 27 [2021-11-07 02:24:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:52,465 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2021-11-07 02:24:52,465 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-11-07 02:24:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2021-11-07 02:24:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:24:52,466 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:52,466 INFO L513 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-11-07 02:24:52,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 02:24:52,467 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-11-07 02:24:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash 182447832, now seen corresponding path program 1 times [2021-11-07 02:24:52,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:52,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520954850] [2021-11-07 02:24:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:52,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:52,516 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:52,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520954850] [2021-11-07 02:24:52,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520954850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:52,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:52,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:24:52,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586269658] [2021-11-07 02:24:52,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:52,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:52,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:52,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:52,518 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-11-07 02:24:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:52,648 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2021-11-07 02:24:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:52,648 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-11-07 02:24:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:52,650 INFO L225 Difference]: With dead ends: 209 [2021-11-07 02:24:52,650 INFO L226 Difference]: Without dead ends: 190 [2021-11-07 02:24:52,651 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-07 02:24:52,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-11-07 02:24:52,678 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-11-07 02:24:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2021-11-07 02:24:52,679 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 27 [2021-11-07 02:24:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:52,680 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2021-11-07 02:24:52,680 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-11-07 02:24:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2021-11-07 02:24:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:24:52,681 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:52,681 INFO L513 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-11-07 02:24:52,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 02:24:52,682 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-11-07 02:24:52,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -959516531, now seen corresponding path program 1 times [2021-11-07 02:24:52,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:52,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669725810] [2021-11-07 02:24:52,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:52,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:52,738 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:52,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669725810] [2021-11-07 02:24:52,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669725810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:52,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:52,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:24:52,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134394355] [2021-11-07 02:24:52,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:24:52,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:52,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:24:52,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:52,741 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-11-07 02:24:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:52,920 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2021-11-07 02:24:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:52,920 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-11-07 02:24:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:52,922 INFO L225 Difference]: With dead ends: 266 [2021-11-07 02:24:52,922 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 02:24:52,923 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 02:24:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2021-11-07 02:24:52,948 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-11-07 02:24:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2021-11-07 02:24:52,949 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 27 [2021-11-07 02:24:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:52,949 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2021-11-07 02:24:52,949 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-11-07 02:24:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2021-11-07 02:24:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 02:24:52,950 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:52,951 INFO L513 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-11-07 02:24:52,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 02:24:52,951 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-11-07 02:24:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1342183885, now seen corresponding path program 1 times [2021-11-07 02:24:52,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:52,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913601229] [2021-11-07 02:24:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:52,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:52,990 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:52,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913601229] [2021-11-07 02:24:52,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913601229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:52,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:52,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:24:52,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847371538] [2021-11-07 02:24:52,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:52,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:52,992 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-11-07 02:24:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:53,102 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2021-11-07 02:24:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:53,103 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-11-07 02:24:53,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:53,104 INFO L225 Difference]: With dead ends: 212 [2021-11-07 02:24:53,105 INFO L226 Difference]: Without dead ends: 208 [2021-11-07 02:24:53,105 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-07 02:24:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 174. [2021-11-07 02:24:53,153 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-11-07 02:24:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2021-11-07 02:24:53,155 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 29 [2021-11-07 02:24:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:53,155 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2021-11-07 02:24:53,155 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-11-07 02:24:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2021-11-07 02:24:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:24:53,156 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:53,157 INFO L513 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-11-07 02:24:53,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 02:24:53,157 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-11-07 02:24:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash -238254628, now seen corresponding path program 1 times [2021-11-07 02:24:53,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:53,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115365315] [2021-11-07 02:24:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:53,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:53,201 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:53,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115365315] [2021-11-07 02:24:53,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115365315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:53,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:53,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:24:53,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603324170] [2021-11-07 02:24:53,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:24:53,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:24:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:53,203 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-11-07 02:24:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:53,360 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2021-11-07 02:24:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:24:53,360 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-11-07 02:24:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:53,361 INFO L225 Difference]: With dead ends: 190 [2021-11-07 02:24:53,361 INFO L226 Difference]: Without dead ends: 116 [2021-11-07 02:24:53,362 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:24:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-07 02:24:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2021-11-07 02:24:53,377 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-11-07 02:24:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2021-11-07 02:24:53,378 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 30 [2021-11-07 02:24:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:53,379 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2021-11-07 02:24:53,379 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-11-07 02:24:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2021-11-07 02:24:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 02:24:53,380 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:53,380 INFO L513 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-11-07 02:24:53,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 02:24:53,380 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-11-07 02:24:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1741353200, now seen corresponding path program 1 times [2021-11-07 02:24:53,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:53,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796804357] [2021-11-07 02:24:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:53,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:53,485 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:53,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796804357] [2021-11-07 02:24:53,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796804357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:53,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:53,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 02:24:53,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051275932] [2021-11-07 02:24:53,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 02:24:53,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 02:24:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:24:53,487 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-11-07 02:24:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:53,769 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2021-11-07 02:24:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 02:24:53,770 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-11-07 02:24:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:53,771 INFO L225 Difference]: With dead ends: 133 [2021-11-07 02:24:53,771 INFO L226 Difference]: Without dead ends: 131 [2021-11-07 02:24:53,773 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-07 02:24:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-07 02:24:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2021-11-07 02:24:53,790 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-11-07 02:24:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2021-11-07 02:24:53,791 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 33 [2021-11-07 02:24:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:53,792 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2021-11-07 02:24:53,792 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-11-07 02:24:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2021-11-07 02:24:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 02:24:53,793 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:53,793 INFO L513 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-11-07 02:24:53,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 02:24:53,793 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-11-07 02:24:53,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2037279919, now seen corresponding path program 1 times [2021-11-07 02:24:53,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:53,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654829797] [2021-11-07 02:24:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:53,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:53,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-11-07 02:24:53,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:53,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654829797] [2021-11-07 02:24:53,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654829797] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:53,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:53,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:24:53,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941808822] [2021-11-07 02:24:53,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:24:53,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:53,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:24:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:53,897 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-11-07 02:24:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:54,018 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2021-11-07 02:24:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:24:54,019 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-11-07 02:24:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:54,020 INFO L225 Difference]: With dead ends: 132 [2021-11-07 02:24:54,020 INFO L226 Difference]: Without dead ends: 130 [2021-11-07 02:24:54,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-07 02:24:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2021-11-07 02:24:54,036 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-11-07 02:24:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2021-11-07 02:24:54,037 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 36 [2021-11-07 02:24:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:54,037 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2021-11-07 02:24:54,038 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-11-07 02:24:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2021-11-07 02:24:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 02:24:54,038 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:54,039 INFO L513 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-11-07 02:24:54,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 02:24:54,039 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-11-07 02:24:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 781443528, now seen corresponding path program 1 times [2021-11-07 02:24:54,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:54,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812662545] [2021-11-07 02:24:54,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:54,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:54,147 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:54,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812662545] [2021-11-07 02:24:54,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812662545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:54,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:54,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:24:54,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385404687] [2021-11-07 02:24:54,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:24:54,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:24:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:54,149 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-11-07 02:24:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:54,305 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2021-11-07 02:24:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:24:54,306 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-11-07 02:24:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:54,307 INFO L225 Difference]: With dead ends: 102 [2021-11-07 02:24:54,309 INFO L226 Difference]: Without dead ends: 86 [2021-11-07 02:24:54,309 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:24:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-07 02:24:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-11-07 02:24:54,326 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-11-07 02:24:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2021-11-07 02:24:54,327 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 37 [2021-11-07 02:24:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:54,327 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2021-11-07 02:24:54,328 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-11-07 02:24:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2021-11-07 02:24:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 02:24:54,328 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:54,329 INFO L513 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-11-07 02:24:54,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 02:24:54,329 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-11-07 02:24:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:54,330 INFO L85 PathProgramCache]: Analyzing trace with hash 807911961, now seen corresponding path program 1 times [2021-11-07 02:24:54,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:54,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321635932] [2021-11-07 02:24:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:54,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:54,406 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:54,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321635932] [2021-11-07 02:24:54,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321635932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:54,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:54,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:24:54,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525550904] [2021-11-07 02:24:54,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:24:54,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:54,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:24:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:54,409 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-11-07 02:24:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:54,498 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2021-11-07 02:24:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:54,499 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-11-07 02:24:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:54,499 INFO L225 Difference]: With dead ends: 106 [2021-11-07 02:24:54,500 INFO L226 Difference]: Without dead ends: 88 [2021-11-07 02:24:54,500 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:24:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-07 02:24:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-11-07 02:24:54,517 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-11-07 02:24:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2021-11-07 02:24:54,518 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 37 [2021-11-07 02:24:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:54,518 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2021-11-07 02:24:54,518 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-11-07 02:24:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2021-11-07 02:24:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 02:24:54,519 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:54,519 INFO L513 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-11-07 02:24:54,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 02:24:54,519 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-11-07 02:24:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash 605372770, now seen corresponding path program 1 times [2021-11-07 02:24:54,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:54,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091373248] [2021-11-07 02:24:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:54,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:54,576 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:54,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091373248] [2021-11-07 02:24:54,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091373248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:54,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:54,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:24:54,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312349858] [2021-11-07 02:24:54,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:24:54,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:54,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:24:54,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:54,579 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-11-07 02:24:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:54,657 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2021-11-07 02:24:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:24:54,657 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-11-07 02:24:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:54,658 INFO L225 Difference]: With dead ends: 102 [2021-11-07 02:24:54,658 INFO L226 Difference]: Without dead ends: 64 [2021-11-07 02:24:54,661 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:24:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-07 02:24:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-07 02:24:54,675 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-11-07 02:24:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2021-11-07 02:24:54,677 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 40 [2021-11-07 02:24:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:54,677 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2021-11-07 02:24:54,678 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-11-07 02:24:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2021-11-07 02:24:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 02:24:54,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:54,679 INFO L513 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-11-07 02:24:54,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 02:24:54,679 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-11-07 02:24:54,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 270788442, now seen corresponding path program 1 times [2021-11-07 02:24:54,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:54,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885802874] [2021-11-07 02:24:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:54,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:54,726 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:54,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885802874] [2021-11-07 02:24:54,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885802874] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:54,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:54,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:24:54,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784830284] [2021-11-07 02:24:54,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:54,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:54,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:54,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:54,729 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-11-07 02:24:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:54,772 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2021-11-07 02:24:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:54,772 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-11-07 02:24:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:54,773 INFO L225 Difference]: With dead ends: 92 [2021-11-07 02:24:54,773 INFO L226 Difference]: Without dead ends: 64 [2021-11-07 02:24:54,774 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:24:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-07 02:24:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-07 02:24:54,788 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-11-07 02:24:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-11-07 02:24:54,789 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 40 [2021-11-07 02:24:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:54,789 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-11-07 02:24:54,789 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-11-07 02:24:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-11-07 02:24:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 02:24:54,790 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:54,790 INFO L513 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-11-07 02:24:54,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 02:24:54,792 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-11-07 02:24:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash -216703206, now seen corresponding path program 1 times [2021-11-07 02:24:54,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:54,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094750831] [2021-11-07 02:24:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:54,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:54,867 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:54,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094750831] [2021-11-07 02:24:54,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094750831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:54,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:54,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:24:54,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257440858] [2021-11-07 02:24:54,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:24:54,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:54,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:24:54,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:54,870 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-11-07 02:24:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:54,954 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-11-07 02:24:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:54,955 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-11-07 02:24:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:54,956 INFO L225 Difference]: With dead ends: 82 [2021-11-07 02:24:54,956 INFO L226 Difference]: Without dead ends: 64 [2021-11-07 02:24:54,956 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:24:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-07 02:24:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-07 02:24:54,971 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-11-07 02:24:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-11-07 02:24:54,971 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 49 [2021-11-07 02:24:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:54,972 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-11-07 02:24:54,972 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-11-07 02:24:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-11-07 02:24:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 02:24:54,973 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:54,973 INFO L513 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-11-07 02:24:54,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 02:24:54,973 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-11-07 02:24:54,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:54,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1728484254, now seen corresponding path program 1 times [2021-11-07 02:24:54,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:54,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351633351] [2021-11-07 02:24:54,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:54,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:55,177 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:55,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351633351] [2021-11-07 02:24:55,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351633351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:55,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:55,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:24:55,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648947273] [2021-11-07 02:24:55,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 02:24:55,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:55,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 02:24:55,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:24:55,178 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-11-07 02:24:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:55,572 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-11-07 02:24:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:24:55,572 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-11-07 02:24:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:55,573 INFO L225 Difference]: With dead ends: 109 [2021-11-07 02:24:55,573 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 02:24:55,574 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:24:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 02:24:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-07 02:24:55,592 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-11-07 02:24:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2021-11-07 02:24:55,593 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 51 [2021-11-07 02:24:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:55,593 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2021-11-07 02:24:55,593 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-11-07 02:24:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2021-11-07 02:24:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 02:24:55,594 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:55,595 INFO L513 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-11-07 02:24:55,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 02:24:55,595 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-11-07 02:24:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:55,596 INFO L85 PathProgramCache]: Analyzing trace with hash -467856665, now seen corresponding path program 1 times [2021-11-07 02:24:55,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:55,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133052335] [2021-11-07 02:24:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:55,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:55,742 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:55,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133052335] [2021-11-07 02:24:55,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133052335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:55,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:55,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:24:55,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799495959] [2021-11-07 02:24:55,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 02:24:55,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 02:24:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:24:55,747 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-11-07 02:24:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:55,979 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2021-11-07 02:24:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:24:55,980 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-11-07 02:24:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:55,980 INFO L225 Difference]: With dead ends: 78 [2021-11-07 02:24:55,980 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 02:24:55,980 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:24:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 02:24:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 02:24:55,981 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-11-07 02:24:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 02:24:55,981 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-11-07 02:24:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:55,981 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 02:24:55,981 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-11-07 02:24:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 02:24:55,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 02:24:55,983 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,984 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,984 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,984 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,984 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,986 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,986 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,986 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,986 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,987 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,987 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,987 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,987 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,987 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,989 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,989 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,989 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,989 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,990 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,990 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,990 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,990 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,991 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,991 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,991 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,991 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,991 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,992 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,992 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,992 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:55,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 02:24:55,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 02:24:56,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:56,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:24:57,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:25:04,566 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,566 INFO L857 garLoopResultBuilder]: For program point L630(lines 630 632) no Hoare annotation was computed. [2021-11-07 02:25:04,566 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,566 INFO L857 garLoopResultBuilder]: For program point L565(lines 565 567) no Hoare annotation was computed. [2021-11-07 02:25:04,566 INFO L857 garLoopResultBuilder]: For program point L499(lines 499 505) no Hoare annotation was computed. [2021-11-07 02:25:04,566 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-11-07 02:25:04,566 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,567 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-11-07 02:25:04,567 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-11-07 02:25:04,567 INFO L860 garLoopResultBuilder]: At program point L766(lines 750 805) the Hoare annotation is: true [2021-11-07 02:25:04,567 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 310) no Hoare annotation was computed. [2021-11-07 02:25:04,567 INFO L857 garLoopResultBuilder]: For program point L767(lines 767 802) no Hoare annotation was computed. [2021-11-07 02:25:04,567 INFO L857 garLoopResultBuilder]: For program point L239-1(lines 232 420) no Hoare annotation was computed. [2021-11-07 02:25:04,567 INFO L857 garLoopResultBuilder]: For program point L768(lines 768 801) no Hoare annotation was computed. [2021-11-07 02:25:04,567 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-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point L769(lines 769 779) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point L770(lines 770 776) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point L1036(lines 1036 1055) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point L1036-1(lines 1036 1055) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point L1036-2(lines 1036 1055) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point L1036-3(lines 1036 1055) no Hoare annotation was computed. [2021-11-07 02:25:04,568 INFO L857 garLoopResultBuilder]: For program point L640(lines 640 645) no Hoare annotation was computed. [2021-11-07 02:25:04,569 INFO L857 garLoopResultBuilder]: For program point L640-2(lines 640 645) no Hoare annotation was computed. [2021-11-07 02:25:04,569 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,569 INFO L857 garLoopResultBuilder]: For program point L1037(lines 1037 1042) no Hoare annotation was computed. [2021-11-07 02:25:04,569 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,569 INFO L857 garLoopResultBuilder]: For program point L1037-2(lines 1037 1042) no Hoare annotation was computed. [2021-11-07 02:25:04,569 INFO L857 garLoopResultBuilder]: For program point L1037-4(lines 1037 1042) no Hoare annotation was computed. [2021-11-07 02:25:04,570 INFO L857 garLoopResultBuilder]: For program point L1037-6(lines 1037 1042) no Hoare annotation was computed. [2021-11-07 02:25:04,570 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,570 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,570 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-11-07 02:25:04,570 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,571 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-11-07 02:25:04,571 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,571 INFO L857 garLoopResultBuilder]: For program point L380(lines 380 386) no Hoare annotation was computed. [2021-11-07 02:25:04,571 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-11-07 02:25:04,571 INFO L857 garLoopResultBuilder]: For program point L515(lines 515 520) no Hoare annotation was computed. [2021-11-07 02:25:04,572 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-11-07 02:25:04,572 INFO L853 garLoopResultBuilder]: At program point L1044(lines 1036 1055) the Hoare annotation is: false [2021-11-07 02:25:04,572 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-11-07 02:25:04,572 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-11-07 02:25:04,573 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-11-07 02:25:04,573 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-11-07 02:25:04,573 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-11-07 02:25:04,574 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-11-07 02:25:04,574 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-11-07 02:25:04,574 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-11-07 02:25:04,574 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-11-07 02:25:04,575 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-11-07 02:25:04,575 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-11-07 02:25:04,575 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-11-07 02:25:04,575 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-11-07 02:25:04,576 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,576 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-11-07 02:25:04,576 INFO L857 garLoopResultBuilder]: For program point L121-2(lines 113 161) no Hoare annotation was computed. [2021-11-07 02:25:04,576 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 334) no Hoare annotation was computed. [2021-11-07 02:25:04,576 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 02:25:04,577 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,577 INFO L857 garLoopResultBuilder]: For program point L1049(lines 1049 1053) no Hoare annotation was computed. [2021-11-07 02:25:04,577 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-11-07 02:25:04,577 INFO L857 garLoopResultBuilder]: For program point L1049-2(lines 1049 1053) no Hoare annotation was computed. [2021-11-07 02:25:04,577 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-11-07 02:25:04,578 INFO L857 garLoopResultBuilder]: For program point L1049-4(lines 1049 1053) no Hoare annotation was computed. [2021-11-07 02:25:04,578 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-11-07 02:25:04,578 INFO L857 garLoopResultBuilder]: For program point L1049-6(lines 1049 1053) no Hoare annotation was computed. [2021-11-07 02:25:04,578 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-11-07 02:25:04,579 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,579 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,579 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,579 INFO L857 garLoopResultBuilder]: For program point L787(lines 787 799) no Hoare annotation was computed. [2021-11-07 02:25:04,579 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,579 INFO L857 garLoopResultBuilder]: For program point L788(lines 788 792) no Hoare annotation was computed. [2021-11-07 02:25:04,580 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,580 INFO L857 garLoopResultBuilder]: For program point L987(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,580 INFO L857 garLoopResultBuilder]: For program point L987-1(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,580 INFO L857 garLoopResultBuilder]: For program point L987-2(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,580 INFO L857 garLoopResultBuilder]: For program point L987-3(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,581 INFO L857 garLoopResultBuilder]: For program point L987-4(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,581 INFO L857 garLoopResultBuilder]: For program point L987-5(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,581 INFO L857 garLoopResultBuilder]: For program point L987-6(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,581 INFO L857 garLoopResultBuilder]: For program point L987-7(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,581 INFO L857 garLoopResultBuilder]: For program point L987-8(lines 987 1004) no Hoare annotation was computed. [2021-11-07 02:25:04,581 INFO L857 garLoopResultBuilder]: For program point L327(lines 327 333) no Hoare annotation was computed. [2021-11-07 02:25:04,582 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-11-07 02:25:04,582 INFO L857 garLoopResultBuilder]: For program point L263(lines 263 294) no Hoare annotation was computed. [2021-11-07 02:25:04,582 INFO L857 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,582 INFO L857 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,582 INFO L857 garLoopResultBuilder]: For program point L65-2(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,582 INFO L857 garLoopResultBuilder]: For program point L65-3(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,583 INFO L857 garLoopResultBuilder]: For program point L65-4(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,583 INFO L857 garLoopResultBuilder]: For program point L65-5(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,583 INFO L857 garLoopResultBuilder]: For program point L65-6(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,583 INFO L857 garLoopResultBuilder]: For program point L65-7(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,583 INFO L857 garLoopResultBuilder]: For program point L65-8(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,583 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,584 INFO L857 garLoopResultBuilder]: For program point L65-9(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,584 INFO L857 garLoopResultBuilder]: For program point L65-10(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,584 INFO L857 garLoopResultBuilder]: For program point L65-11(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,584 INFO L857 garLoopResultBuilder]: For program point L65-12(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,584 INFO L857 garLoopResultBuilder]: For program point L65-13(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,584 INFO L857 garLoopResultBuilder]: For program point L65-14(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,585 INFO L857 garLoopResultBuilder]: For program point L65-15(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,585 INFO L857 garLoopResultBuilder]: For program point L65-16(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,585 INFO L857 garLoopResultBuilder]: For program point L65-17(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,585 INFO L857 garLoopResultBuilder]: For program point L65-18(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,585 INFO L857 garLoopResultBuilder]: For program point L65-19(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,585 INFO L857 garLoopResultBuilder]: For program point L65-20(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,586 INFO L857 garLoopResultBuilder]: For program point L65-21(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,586 INFO L857 garLoopResultBuilder]: For program point L65-22(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,586 INFO L857 garLoopResultBuilder]: For program point L65-23(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,586 INFO L857 garLoopResultBuilder]: For program point L65-24(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,586 INFO L857 garLoopResultBuilder]: For program point L65-25(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,586 INFO L857 garLoopResultBuilder]: For program point L65-26(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,586 INFO L857 garLoopResultBuilder]: For program point L65-27(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,587 INFO L857 garLoopResultBuilder]: For program point L65-28(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,587 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-11-07 02:25:04,587 INFO L857 garLoopResultBuilder]: For program point L65-29(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,587 INFO L857 garLoopResultBuilder]: For program point L65-30(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,587 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-11-07 02:25:04,588 INFO L857 garLoopResultBuilder]: For program point L65-31(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,588 INFO L857 garLoopResultBuilder]: For program point L65-32(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,588 INFO L857 garLoopResultBuilder]: For program point L65-33(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,588 INFO L857 garLoopResultBuilder]: For program point L65-34(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,588 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-11-07 02:25:04,588 INFO L857 garLoopResultBuilder]: For program point L65-35(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,589 INFO L857 garLoopResultBuilder]: For program point L65-36(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,589 INFO L857 garLoopResultBuilder]: For program point L65-37(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,589 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-11-07 02:25:04,589 INFO L857 garLoopResultBuilder]: For program point L65-38(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,589 INFO L857 garLoopResultBuilder]: For program point L65-39(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,590 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-11-07 02:25:04,590 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-11-07 02:25:04,590 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-11-07 02:25:04,590 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-11-07 02:25:04,591 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-11-07 02:25:04,591 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-11-07 02:25:04,591 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-11-07 02:25:04,591 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-11-07 02:25:04,592 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-11-07 02:25:04,592 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-11-07 02:25:04,592 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-11-07 02:25:04,592 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-11-07 02:25:04,592 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-11-07 02:25:04,593 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-11-07 02:25:04,593 INFO L857 garLoopResultBuilder]: For program point L926(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,593 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-11-07 02:25:04,593 INFO L857 garLoopResultBuilder]: For program point L926-2(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,593 INFO L857 garLoopResultBuilder]: For program point L926-4(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,594 INFO L857 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-11-07 02:25:04,594 INFO L857 garLoopResultBuilder]: For program point L926-6(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,594 INFO L857 garLoopResultBuilder]: For program point L926-8(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,594 INFO L857 garLoopResultBuilder]: For program point L926-10(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,594 INFO L857 garLoopResultBuilder]: For program point L926-12(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,594 INFO L857 garLoopResultBuilder]: For program point L926-14(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,595 INFO L857 garLoopResultBuilder]: For program point L926-16(lines 926 932) no Hoare annotation was computed. [2021-11-07 02:25:04,595 INFO L857 garLoopResultBuilder]: For program point L531(lines 531 596) no Hoare annotation was computed. [2021-11-07 02:25:04,595 INFO L857 garLoopResultBuilder]: For program point L531-1(lines 531 596) no Hoare annotation was computed. [2021-11-07 02:25:04,595 INFO L857 garLoopResultBuilder]: For program point L201(lines 201 209) no Hoare annotation was computed. [2021-11-07 02:25:04,595 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,595 INFO L857 garLoopResultBuilder]: For program point L533(lines 533 573) no Hoare annotation was computed. [2021-11-07 02:25:04,596 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,596 INFO L857 garLoopResultBuilder]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,596 INFO L857 garLoopResultBuilder]: For program point L996-2(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,596 INFO L857 garLoopResultBuilder]: For program point L996-4(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,596 INFO L857 garLoopResultBuilder]: For program point L996-6(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,596 INFO L857 garLoopResultBuilder]: For program point L996-8(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,596 INFO L857 garLoopResultBuilder]: For program point L996-10(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,597 INFO L857 garLoopResultBuilder]: For program point L996-12(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,597 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-11-07 02:25:04,597 INFO L857 garLoopResultBuilder]: For program point L996-14(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,597 INFO L857 garLoopResultBuilder]: For program point L996-16(lines 996 1003) no Hoare annotation was computed. [2021-11-07 02:25:04,598 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,598 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-11-07 02:25:04,598 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-11-07 02:25:04,598 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,598 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,599 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,599 INFO L857 garLoopResultBuilder]: For program point L274(lines 274 280) no Hoare annotation was computed. [2021-11-07 02:25:04,599 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,599 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,599 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-11-07 02:25:04,600 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,600 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 348) no Hoare annotation was computed. [2021-11-07 02:25:04,600 INFO L857 garLoopResultBuilder]: For program point L343-2(lines 343 348) no Hoare annotation was computed. [2021-11-07 02:25:04,600 INFO L860 garLoopResultBuilder]: At program point L807(lines 670 809) the Hoare annotation is: true [2021-11-07 02:25:04,600 INFO L857 garLoopResultBuilder]: For program point L213(lines 213 428) no Hoare annotation was computed. [2021-11-07 02:25:04,600 INFO L857 garLoopResultBuilder]: For program point L147(lines 147 149) no Hoare annotation was computed. [2021-11-07 02:25:04,601 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-11-07 02:25:04,601 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,601 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 427) no Hoare annotation was computed. [2021-11-07 02:25:04,601 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,602 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,602 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-11-07 02:25:04,602 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-11-07 02:25:04,602 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-11-07 02:25:04,603 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-11-07 02:25:04,603 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-11-07 02:25:04,603 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-11-07 02:25:04,603 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-11-07 02:25:04,604 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-11-07 02:25:04,604 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-11-07 02:25:04,604 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-11-07 02:25:04,604 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-11-07 02:25:04,605 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-11-07 02:25:04,605 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-11-07 02:25:04,605 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-11-07 02:25:04,605 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-11-07 02:25:04,605 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-11-07 02:25:04,606 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-11-07 02:25:04,606 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-11-07 02:25:04,606 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-11-07 02:25:04,606 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 02:25:04,607 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,607 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 426) no Hoare annotation was computed. [2021-11-07 02:25:04,607 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,607 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-11-07 02:25:04,607 INFO L857 garLoopResultBuilder]: For program point L1013(lines 1013 1019) no Hoare annotation was computed. [2021-11-07 02:25:04,608 INFO L857 garLoopResultBuilder]: For program point L1013-2(lines 1013 1019) no Hoare annotation was computed. [2021-11-07 02:25:04,608 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,608 INFO L857 garLoopResultBuilder]: For program point L1013-4(lines 1013 1019) no Hoare annotation was computed. [2021-11-07 02:25:04,608 INFO L857 garLoopResultBuilder]: For program point L1013-6(lines 1013 1019) no Hoare annotation was computed. [2021-11-07 02:25:04,608 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 425) no Hoare annotation was computed. [2021-11-07 02:25:04,609 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,609 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,609 INFO L857 garLoopResultBuilder]: For program point L751(lines 751 755) no Hoare annotation was computed. [2021-11-07 02:25:04,609 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-11-07 02:25:04,610 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-11-07 02:25:04,610 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-11-07 02:25:04,610 INFO L857 garLoopResultBuilder]: For program point L950(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,610 INFO L857 garLoopResultBuilder]: For program point L950-2(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,610 INFO L857 garLoopResultBuilder]: For program point L950-4(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,611 INFO L857 garLoopResultBuilder]: For program point L950-6(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,611 INFO L857 garLoopResultBuilder]: For program point L950-8(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,611 INFO L857 garLoopResultBuilder]: For program point L950-10(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,611 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-11-07 02:25:04,612 INFO L857 garLoopResultBuilder]: For program point L950-12(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,612 INFO L857 garLoopResultBuilder]: For program point L950-14(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,612 INFO L857 garLoopResultBuilder]: For program point L950-16(lines 950 954) no Hoare annotation was computed. [2021-11-07 02:25:04,612 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-11-07 02:25:04,612 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-11-07 02:25:04,613 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,613 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-11-07 02:25:04,613 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-11-07 02:25:04,613 INFO L857 garLoopResultBuilder]: For program point L494(lines 494 506) no Hoare annotation was computed. [2021-11-07 02:25:04,614 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,614 INFO L857 garLoopResultBuilder]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-11-07 02:25:04,614 INFO L857 garLoopResultBuilder]: For program point L363(lines 363 369) no Hoare annotation was computed. [2021-11-07 02:25:04,614 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-11-07 02:25:04,614 INFO L857 garLoopResultBuilder]: For program point L298-1(lines 232 420) no Hoare annotation was computed. [2021-11-07 02:25:04,615 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,615 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-11-07 02:25:04,618 INFO L731 BasicCegarLoop]: Path program 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-11-07 02:25:04,620 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:25:04,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:25:04 BoogieIcfgContainer [2021-11-07 02:25:04,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:25:04,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:25:04,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:25:04,746 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:25:04,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:24:46" (3/4) ... [2021-11-07 02:25:04,750 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 02:25:04,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 215 nodes and edges [2021-11-07 02:25:04,790 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2021-11-07 02:25:04,795 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-11-07 02:25:04,799 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-07 02:25:04,832 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-11-07 02:25:04,833 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-11-07 02:25:04,833 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-11-07 02:25:04,833 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-11-07 02:25:04,836 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-11-07 02:25:04,841 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-11-07 02:25:04,847 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-11-07 02:25:04,848 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-11-07 02:25:04,848 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-11-07 02:25:04,849 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-11-07 02:25:04,849 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-11-07 02:25:05,007 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:25:05,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:25:05,009 INFO L168 Benchmark]: Toolchain (without parser) took 21975.50 ms. Allocated memory was 113.2 MB in the beginning and 339.7 MB in the end (delta: 226.5 MB). Free memory was 82.4 MB in the beginning and 267.5 MB in the end (delta: -185.1 MB). Peak memory consumption was 39.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:25:05,010 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 113.2 MB. Free memory is still 68.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:25:05,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.13 ms. Allocated memory was 113.2 MB in the beginning and 153.1 MB in the end (delta: 39.8 MB). Free memory was 82.1 MB in the beginning and 118.0 MB in the end (delta: -35.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:25:05,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.79 ms. Allocated memory is still 153.1 MB. Free memory was 118.0 MB in the beginning and 110.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:25:05,011 INFO L168 Benchmark]: Boogie Preprocessor took 94.65 ms. Allocated memory is still 153.1 MB. Free memory was 110.2 MB in the beginning and 105.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:25:05,011 INFO L168 Benchmark]: RCFGBuilder took 2595.33 ms. Allocated memory is still 153.1 MB. Free memory was 104.8 MB in the beginning and 79.3 MB in the end (delta: 25.5 MB). Peak memory consumption was 62.0 MB. Max. memory is 16.1 GB. [2021-11-07 02:25:05,012 INFO L168 Benchmark]: TraceAbstraction took 18221.75 ms. Allocated memory was 153.1 MB in the beginning and 339.7 MB in the end (delta: 186.6 MB). Free memory was 79.3 MB in the beginning and 301.1 MB in the end (delta: -221.8 MB). Peak memory consumption was 163.0 MB. Max. memory is 16.1 GB. [2021-11-07 02:25:05,012 INFO L168 Benchmark]: Witness Printer took 261.69 ms. Allocated memory is still 339.7 MB. Free memory was 301.1 MB in the beginning and 267.5 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:25:05,014 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.28 ms. Allocated memory is still 113.2 MB. Free memory is still 68.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 613.13 ms. Allocated memory was 113.2 MB in the beginning and 153.1 MB in the end (delta: 39.8 MB). Free memory was 82.1 MB in the beginning and 118.0 MB in the end (delta: -35.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 171.79 ms. Allocated memory is still 153.1 MB. Free memory was 118.0 MB in the beginning and 110.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 94.65 ms. Allocated memory is still 153.1 MB. Free memory was 110.2 MB in the beginning and 105.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2595.33 ms. Allocated memory is still 153.1 MB. Free memory was 104.8 MB in the beginning and 79.3 MB in the end (delta: 25.5 MB). Peak memory consumption was 62.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18221.75 ms. Allocated memory was 153.1 MB in the beginning and 339.7 MB in the end (delta: 186.6 MB). Free memory was 79.3 MB in the beginning and 301.1 MB in the end (delta: -221.8 MB). Peak memory consumption was 163.0 MB. Max. memory is 16.1 GB. * Witness Printer took 261.69 ms. Allocated memory is still 339.7 MB. Free memory was 301.1 MB in the beginning and 267.5 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: 17.9s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6718 SDtfs, 5346 SDslu, 7014 SDs, 0 SdLazy, 2938 SolverSat, 385 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 546 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 82 PreInvPairs, 247 NumberOfFragments, 6910 HoareAnnotationTreeSize, 82 FomulaSimplifications, 440009 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 82 FomulaSimplificationsInter, 42180 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s 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-11-07 02:25:05,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5745e3d6-ab2d-462c-a6fa-2f7b9053ed58/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE