./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG --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 b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 05:44:31,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:44:31,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:44:31,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:44:31,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:44:31,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:44:31,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:44:31,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:44:31,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:44:31,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:44:31,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:44:31,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:44:31,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:44:31,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:44:31,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:44:31,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:44:31,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:44:31,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:44:31,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:44:31,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:44:31,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:44:31,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:44:31,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:44:31,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:44:31,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:44:31,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:44:31,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:44:31,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:44:31,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:44:31,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:44:31,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:44:31,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:44:31,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:44:31,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:44:31,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:44:31,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:44:31,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:44:31,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:44:31,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:44:31,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:44:31,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:44:31,317 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:44:31,339 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:44:31,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:44:31,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:44:31,341 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:44:31,341 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:44:31,342 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:44:31,342 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:44:31,342 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:44:31,342 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:44:31,343 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:44:31,343 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:44:31,343 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:44:31,344 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:44:31,344 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:44:31,344 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:44:31,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:44:31,345 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:44:31,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:44:31,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:44:31,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:44:31,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:44:31,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:44:31,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:44:31,347 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:44:31,347 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:44:31,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:44:31,348 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:44:31,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:44:31,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:44:31,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:44:31,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:44:31,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:44:31,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:44:31,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:44:31,350 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:44:31,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:44:31,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:44:31,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:44:31,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:44:31,352 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_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/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_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG 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 -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2021-10-29 05:44:31,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:44:31,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:44:31,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:44:31,697 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:44:31,698 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:44:31,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-29 05:44:31,788 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/data/b673330cb/c238e46cbdbf4d70932cbe243dea6cd9/FLAGc28e3db07 [2021-10-29 05:44:32,327 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:44:32,328 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-29 05:44:32,356 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/data/b673330cb/c238e46cbdbf4d70932cbe243dea6cd9/FLAGc28e3db07 [2021-10-29 05:44:32,631 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/data/b673330cb/c238e46cbdbf4d70932cbe243dea6cd9 [2021-10-29 05:44:32,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:44:32,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:44:32,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:44:32,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:44:32,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:44:32,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:44:32" (1/1) ... [2021-10-29 05:44:32,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410f2c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:32, skipping insertion in model container [2021-10-29 05:44:32,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:44:32" (1/1) ... [2021-10-29 05:44:32,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:44:32,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:44:33,188 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_4ed93f9d-a45a-4c4f-9e65-53b983412743/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-29 05:44:33,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:44:33,207 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:44:33,289 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_4ed93f9d-a45a-4c4f-9e65-53b983412743/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-29 05:44:33,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:44:33,307 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:44:33,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33 WrapperNode [2021-10-29 05:44:33,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:44:33,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:44:33,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:44:33,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:44:33,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:44:33,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:44:33,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:44:33,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:44:33,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:44:33,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:44:33,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:44:33,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:44:33,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (1/1) ... [2021-10-29 05:44:33,588 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:44:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:44:33,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:44:33,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:44:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:44:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:44:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:44:33,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:44:33,864 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,882 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,887 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,897 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,899 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,901 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,908 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,919 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,926 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,931 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,933 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,943 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,948 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,959 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,961 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,962 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,969 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,974 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,976 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,978 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,982 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,987 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:33,995 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:34,002 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:34,008 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:34,014 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:34,021 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:34,024 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:34,026 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:34,031 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:44:35,296 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-10-29 05:44:35,296 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-10-29 05:44:35,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-10-29 05:44:35,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-10-29 05:44:35,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-10-29 05:44:35,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-10-29 05:44:35,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-29 05:44:35,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-29 05:44:35,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-10-29 05:44:35,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-10-29 05:44:35,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-29 05:44:35,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-29 05:44:35,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-10-29 05:44:35,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-10-29 05:44:35,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-10-29 05:44:35,298 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-10-29 05:44:35,299 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-10-29 05:44:35,299 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-10-29 05:44:35,299 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-10-29 05:44:35,300 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-10-29 05:44:35,300 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-10-29 05:44:35,301 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-10-29 05:44:35,301 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-10-29 05:44:35,301 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-10-29 05:44:35,301 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-10-29 05:44:35,301 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-10-29 05:44:35,302 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-10-29 05:44:35,302 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-10-29 05:44:35,302 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-10-29 05:44:35,302 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-10-29 05:44:35,302 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-10-29 05:44:35,302 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-10-29 05:44:35,302 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-10-29 05:44:35,302 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-10-29 05:44:35,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-10-29 05:44:35,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-10-29 05:44:35,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-29 05:44:35,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-29 05:44:35,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-10-29 05:44:35,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-10-29 05:44:35,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-10-29 05:44:35,304 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-10-29 05:44:35,304 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-10-29 05:44:35,304 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-10-29 05:44:35,304 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-10-29 05:44:35,304 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-10-29 05:44:35,304 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-10-29 05:44:35,304 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-10-29 05:44:35,305 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-10-29 05:44:35,305 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-10-29 05:44:35,305 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-29 05:44:35,305 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-29 05:44:35,305 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-10-29 05:44:35,306 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-10-29 05:44:35,306 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-10-29 05:44:35,306 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-10-29 05:44:35,306 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-10-29 05:44:35,307 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-10-29 05:44:35,307 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-10-29 05:44:35,308 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-10-29 05:44:36,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:44:36,488 INFO L299 CfgBuilder]: Removed 275 assume(true) statements. [2021-10-29 05:44:36,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:44:36 BoogieIcfgContainer [2021-10-29 05:44:36,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:44:36,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:44:36,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:44:36,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:44:36,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:44:32" (1/3) ... [2021-10-29 05:44:36,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec2194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:44:36, skipping insertion in model container [2021-10-29 05:44:36,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:44:33" (2/3) ... [2021-10-29 05:44:36,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec2194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:44:36, skipping insertion in model container [2021-10-29 05:44:36,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:44:36" (3/3) ... [2021-10-29 05:44:36,506 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-10-29 05:44:36,515 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:44:36,515 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2021-10-29 05:44:36,564 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:44:36,570 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-10-29 05:44:36,570 INFO L340 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2021-10-29 05:44:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 297 states have (on average 1.7744107744107744) internal successors, (527), 350 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 05:44:36,595 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:36,596 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-29 05:44:36,596 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 3916932, now seen corresponding path program 1 times [2021-10-29 05:44:36,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:36,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077372074] [2021-10-29 05:44:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:36,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:36,841 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:36,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077372074] [2021-10-29 05:44:36,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077372074] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:36,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:36,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:36,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209951180] [2021-10-29 05:44:36,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:36,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:36,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:36,889 INFO L87 Difference]: Start difference. First operand has 351 states, 297 states have (on average 1.7744107744107744) internal successors, (527), 350 states have internal predecessors, (527), 0 states have call successors, (0), 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.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:37,240 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2021-10-29 05:44:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:37,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-29 05:44:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:37,256 INFO L225 Difference]: With dead ends: 637 [2021-10-29 05:44:37,257 INFO L226 Difference]: Without dead ends: 359 [2021-10-29 05:44:37,261 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-10-29 05:44:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-10-29 05:44:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2021-10-29 05:44:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 308 states have (on average 1.5064935064935066) internal successors, (464), 341 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 464 transitions. [2021-10-29 05:44:37,320 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 464 transitions. Word has length 6 [2021-10-29 05:44:37,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:37,320 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 464 transitions. [2021-10-29 05:44:37,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2021-10-29 05:44:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:44:37,322 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:37,322 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:44:37,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:44:37,322 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:37,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1581488811, now seen corresponding path program 1 times [2021-10-29 05:44:37,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:37,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237010300] [2021-10-29 05:44:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:37,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:37,370 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:37,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237010300] [2021-10-29 05:44:37,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237010300] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:37,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:37,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:44:37,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131480790] [2021-10-29 05:44:37,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:37,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:37,373 INFO L87 Difference]: Start difference. First operand 342 states and 464 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:37,401 INFO L93 Difference]: Finished difference Result 378 states and 507 transitions. [2021-10-29 05:44:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:37,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-29 05:44:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:37,410 INFO L225 Difference]: With dead ends: 378 [2021-10-29 05:44:37,410 INFO L226 Difference]: Without dead ends: 358 [2021-10-29 05:44:37,411 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-10-29 05:44:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-29 05:44:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2021-10-29 05:44:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 319 states have (on average 1.5015673981191222) internal successors, (479), 352 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 479 transitions. [2021-10-29 05:44:37,470 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 479 transitions. Word has length 10 [2021-10-29 05:44:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:37,470 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 479 transitions. [2021-10-29 05:44:37,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 479 transitions. [2021-10-29 05:44:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 05:44:37,471 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:37,472 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:44:37,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:44:37,472 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1365717038, now seen corresponding path program 1 times [2021-10-29 05:44:37,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:37,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701787724] [2021-10-29 05:44:37,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:37,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:37,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:37,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701787724] [2021-10-29 05:44:37,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701787724] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:37,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:37,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:37,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426058826] [2021-10-29 05:44:37,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:37,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:37,553 INFO L87 Difference]: Start difference. First operand 353 states and 479 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:37,590 INFO L93 Difference]: Finished difference Result 431 states and 575 transitions. [2021-10-29 05:44:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:37,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-10-29 05:44:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:37,594 INFO L225 Difference]: With dead ends: 431 [2021-10-29 05:44:37,594 INFO L226 Difference]: Without dead ends: 397 [2021-10-29 05:44:37,595 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-10-29 05:44:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-10-29 05:44:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 373. [2021-10-29 05:44:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 342 states have (on average 1.4883040935672514) internal successors, (509), 372 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 509 transitions. [2021-10-29 05:44:37,620 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 509 transitions. Word has length 11 [2021-10-29 05:44:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:37,620 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 509 transitions. [2021-10-29 05:44:37,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 509 transitions. [2021-10-29 05:44:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 05:44:37,622 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:37,622 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:44:37,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:44:37,622 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash -698114258, now seen corresponding path program 1 times [2021-10-29 05:44:37,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:37,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053544418] [2021-10-29 05:44:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:37,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:37,746 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:37,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053544418] [2021-10-29 05:44:37,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053544418] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:37,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:37,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:37,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990776543] [2021-10-29 05:44:37,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:37,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:37,754 INFO L87 Difference]: Start difference. First operand 373 states and 509 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:37,819 INFO L93 Difference]: Finished difference Result 611 states and 816 transitions. [2021-10-29 05:44:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:37,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-29 05:44:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:37,822 INFO L225 Difference]: With dead ends: 611 [2021-10-29 05:44:37,823 INFO L226 Difference]: Without dead ends: 435 [2021-10-29 05:44:37,826 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-10-29 05:44:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-10-29 05:44:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 351. [2021-10-29 05:44:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 330 states have (on average 1.4393939393939394) internal successors, (475), 350 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2021-10-29 05:44:37,849 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 12 [2021-10-29 05:44:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:37,850 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2021-10-29 05:44:37,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2021-10-29 05:44:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 05:44:37,856 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:37,856 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:44:37,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:44:37,857 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash 968473548, now seen corresponding path program 1 times [2021-10-29 05:44:37,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:37,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268558104] [2021-10-29 05:44:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:37,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:37,934 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:37,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268558104] [2021-10-29 05:44:37,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268558104] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:37,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:37,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:37,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167305665] [2021-10-29 05:44:37,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:37,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:37,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:37,938 INFO L87 Difference]: Start difference. First operand 351 states and 475 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:38,090 INFO L93 Difference]: Finished difference Result 375 states and 503 transitions. [2021-10-29 05:44:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-10-29 05:44:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:38,093 INFO L225 Difference]: With dead ends: 375 [2021-10-29 05:44:38,094 INFO L226 Difference]: Without dead ends: 357 [2021-10-29 05:44:38,095 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-10-29 05:44:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-29 05:44:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-29 05:44:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 336 states have (on average 1.4285714285714286) internal successors, (480), 356 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2021-10-29 05:44:38,117 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 14 [2021-10-29 05:44:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:38,119 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2021-10-29 05:44:38,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2021-10-29 05:44:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 05:44:38,123 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:38,123 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:44:38,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:44:38,124 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1947817000, now seen corresponding path program 1 times [2021-10-29 05:44:38,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:38,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608723151] [2021-10-29 05:44:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:38,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:38,200 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:38,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608723151] [2021-10-29 05:44:38,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608723151] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:38,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:38,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:38,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920317215] [2021-10-29 05:44:38,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:38,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:38,202 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:38,341 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2021-10-29 05:44:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-29 05:44:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:38,344 INFO L225 Difference]: With dead ends: 357 [2021-10-29 05:44:38,344 INFO L226 Difference]: Without dead ends: 341 [2021-10-29 05:44:38,345 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-10-29 05:44:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-29 05:44:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-10-29 05:44:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 328 states have (on average 1.4115853658536586) internal successors, (463), 340 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 463 transitions. [2021-10-29 05:44:38,364 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 463 transitions. Word has length 17 [2021-10-29 05:44:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:38,365 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 463 transitions. [2021-10-29 05:44:38,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2021-10-29 05:44:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 05:44:38,366 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:38,367 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-10-29 05:44:38,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:44:38,368 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 670796967, now seen corresponding path program 1 times [2021-10-29 05:44:38,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:38,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602896543] [2021-10-29 05:44:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:38,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:38,483 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:38,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602896543] [2021-10-29 05:44:38,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602896543] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:38,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:38,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:44:38,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205145901] [2021-10-29 05:44:38,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:38,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:38,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:38,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:38,488 INFO L87 Difference]: Start difference. First operand 341 states and 463 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:38,542 INFO L93 Difference]: Finished difference Result 425 states and 555 transitions. [2021-10-29 05:44:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:38,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-29 05:44:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:38,546 INFO L225 Difference]: With dead ends: 425 [2021-10-29 05:44:38,546 INFO L226 Difference]: Without dead ends: 389 [2021-10-29 05:44:38,547 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-10-29 05:44:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-10-29 05:44:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 328. [2021-10-29 05:44:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 315 states have (on average 1.4063492063492065) internal successors, (443), 327 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 443 transitions. [2021-10-29 05:44:38,569 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 443 transitions. Word has length 19 [2021-10-29 05:44:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:38,570 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 443 transitions. [2021-10-29 05:44:38,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 443 transitions. [2021-10-29 05:44:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 05:44:38,571 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:38,571 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-10-29 05:44:38,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:44:38,572 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:38,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash 276863221, now seen corresponding path program 1 times [2021-10-29 05:44:38,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:38,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584378101] [2021-10-29 05:44:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:38,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:38,646 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:38,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584378101] [2021-10-29 05:44:38,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584378101] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:38,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:38,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:38,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114070886] [2021-10-29 05:44:38,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:38,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:38,649 INFO L87 Difference]: Start difference. First operand 328 states and 443 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:38,776 INFO L93 Difference]: Finished difference Result 428 states and 576 transitions. [2021-10-29 05:44:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-29 05:44:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:38,779 INFO L225 Difference]: With dead ends: 428 [2021-10-29 05:44:38,779 INFO L226 Difference]: Without dead ends: 325 [2021-10-29 05:44:38,780 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-10-29 05:44:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-29 05:44:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-10-29 05:44:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 314 states have (on average 1.3980891719745223) internal successors, (439), 324 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 439 transitions. [2021-10-29 05:44:38,801 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 439 transitions. Word has length 20 [2021-10-29 05:44:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:38,801 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 439 transitions. [2021-10-29 05:44:38,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 439 transitions. [2021-10-29 05:44:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 05:44:38,803 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:38,803 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-10-29 05:44:38,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:44:38,803 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1071552806, now seen corresponding path program 1 times [2021-10-29 05:44:38,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:38,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653272831] [2021-10-29 05:44:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:38,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:38,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:38,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653272831] [2021-10-29 05:44:38,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653272831] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:38,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:38,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:38,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101643496] [2021-10-29 05:44:38,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:38,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:38,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:38,897 INFO L87 Difference]: Start difference. First operand 325 states and 439 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:39,050 INFO L93 Difference]: Finished difference Result 330 states and 443 transitions. [2021-10-29 05:44:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:39,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-29 05:44:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:39,053 INFO L225 Difference]: With dead ends: 330 [2021-10-29 05:44:39,053 INFO L226 Difference]: Without dead ends: 325 [2021-10-29 05:44:39,054 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-10-29 05:44:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-29 05:44:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-10-29 05:44:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 314 states have (on average 1.394904458598726) internal successors, (438), 324 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 438 transitions. [2021-10-29 05:44:39,075 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 438 transitions. Word has length 20 [2021-10-29 05:44:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:39,076 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 438 transitions. [2021-10-29 05:44:39,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 438 transitions. [2021-10-29 05:44:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 05:44:39,081 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:39,081 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-10-29 05:44:39,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:44:39,081 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2030436846, now seen corresponding path program 1 times [2021-10-29 05:44:39,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:39,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945887284] [2021-10-29 05:44:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:39,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:39,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:39,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945887284] [2021-10-29 05:44:39,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945887284] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:39,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:39,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:39,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266212872] [2021-10-29 05:44:39,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:39,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:39,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:39,132 INFO L87 Difference]: Start difference. First operand 325 states and 438 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:39,186 INFO L93 Difference]: Finished difference Result 418 states and 550 transitions. [2021-10-29 05:44:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:39,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-29 05:44:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:39,188 INFO L225 Difference]: With dead ends: 418 [2021-10-29 05:44:39,188 INFO L226 Difference]: Without dead ends: 323 [2021-10-29 05:44:39,189 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-10-29 05:44:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-10-29 05:44:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2021-10-29 05:44:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 298 states have (on average 1.3791946308724832) internal successors, (411), 308 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 411 transitions. [2021-10-29 05:44:39,211 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 411 transitions. Word has length 21 [2021-10-29 05:44:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:39,212 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 411 transitions. [2021-10-29 05:44:39,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 411 transitions. [2021-10-29 05:44:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 05:44:39,214 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:39,214 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-10-29 05:44:39,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:44:39,214 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash 612333619, now seen corresponding path program 1 times [2021-10-29 05:44:39,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:39,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352243693] [2021-10-29 05:44:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:39,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:39,275 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:39,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352243693] [2021-10-29 05:44:39,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352243693] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:39,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:39,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:39,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4827426] [2021-10-29 05:44:39,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:39,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:39,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:39,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:39,279 INFO L87 Difference]: Start difference. First operand 309 states and 411 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:39,440 INFO L93 Difference]: Finished difference Result 314 states and 415 transitions. [2021-10-29 05:44:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:39,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-29 05:44:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:39,443 INFO L225 Difference]: With dead ends: 314 [2021-10-29 05:44:39,443 INFO L226 Difference]: Without dead ends: 309 [2021-10-29 05:44:39,444 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-10-29 05:44:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-10-29 05:44:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-10-29 05:44:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 298 states have (on average 1.3758389261744965) internal successors, (410), 308 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 410 transitions. [2021-10-29 05:44:39,467 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 410 transitions. Word has length 21 [2021-10-29 05:44:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:39,467 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 410 transitions. [2021-10-29 05:44:39,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 410 transitions. [2021-10-29 05:44:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 05:44:39,468 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:39,469 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-10-29 05:44:39,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:44:39,469 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1058451947, now seen corresponding path program 1 times [2021-10-29 05:44:39,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:39,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880578077] [2021-10-29 05:44:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:39,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:39,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:39,501 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:39,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880578077] [2021-10-29 05:44:39,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880578077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:39,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:39,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:39,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528484143] [2021-10-29 05:44:39,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:39,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:39,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:39,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:39,503 INFO L87 Difference]: Start difference. First operand 309 states and 410 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:39,538 INFO L93 Difference]: Finished difference Result 349 states and 455 transitions. [2021-10-29 05:44:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-29 05:44:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:39,540 INFO L225 Difference]: With dead ends: 349 [2021-10-29 05:44:39,541 INFO L226 Difference]: Without dead ends: 295 [2021-10-29 05:44:39,541 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-10-29 05:44:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-10-29 05:44:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2021-10-29 05:44:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.3652482269503545) internal successors, (385), 292 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 385 transitions. [2021-10-29 05:44:39,563 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 385 transitions. Word has length 21 [2021-10-29 05:44:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:39,563 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 385 transitions. [2021-10-29 05:44:39,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 385 transitions. [2021-10-29 05:44:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:44:39,564 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:39,564 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-10-29 05:44:39,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 05:44:39,565 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash -420836383, now seen corresponding path program 1 times [2021-10-29 05:44:39,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:39,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827176862] [2021-10-29 05:44:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:39,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:39,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:39,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827176862] [2021-10-29 05:44:39,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827176862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:39,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:39,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:39,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842651310] [2021-10-29 05:44:39,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:39,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:39,596 INFO L87 Difference]: Start difference. First operand 293 states and 385 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:39,743 INFO L93 Difference]: Finished difference Result 344 states and 448 transitions. [2021-10-29 05:44:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:39,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 05:44:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:39,746 INFO L225 Difference]: With dead ends: 344 [2021-10-29 05:44:39,747 INFO L226 Difference]: Without dead ends: 336 [2021-10-29 05:44:39,747 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-10-29 05:44:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-10-29 05:44:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2021-10-29 05:44:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 290 states have (on average 1.3689655172413793) internal successors, (397), 300 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 397 transitions. [2021-10-29 05:44:39,770 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 397 transitions. Word has length 22 [2021-10-29 05:44:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:39,770 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 397 transitions. [2021-10-29 05:44:39,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2021-10-29 05:44:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:44:39,774 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:39,774 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-10-29 05:44:39,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 05:44:39,775 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1442209585, now seen corresponding path program 1 times [2021-10-29 05:44:39,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:39,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040377120] [2021-10-29 05:44:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:39,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:39,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:39,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040377120] [2021-10-29 05:44:39,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040377120] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:39,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:39,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:44:39,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357993885] [2021-10-29 05:44:39,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:39,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:39,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:39,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:39,829 INFO L87 Difference]: Start difference. First operand 301 states and 397 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:39,873 INFO L93 Difference]: Finished difference Result 314 states and 409 transitions. [2021-10-29 05:44:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:39,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 05:44:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:39,876 INFO L225 Difference]: With dead ends: 314 [2021-10-29 05:44:39,876 INFO L226 Difference]: Without dead ends: 299 [2021-10-29 05:44:39,877 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-10-29 05:44:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-29 05:44:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-10-29 05:44:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 288 states have (on average 1.3680555555555556) internal successors, (394), 298 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 394 transitions. [2021-10-29 05:44:39,899 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 394 transitions. Word has length 22 [2021-10-29 05:44:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:39,901 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 394 transitions. [2021-10-29 05:44:39,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 394 transitions. [2021-10-29 05:44:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:44:39,903 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:39,904 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-10-29 05:44:39,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 05:44:39,904 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash 375582176, now seen corresponding path program 1 times [2021-10-29 05:44:39,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:39,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624156673] [2021-10-29 05:44:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:39,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:39,973 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:39,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624156673] [2021-10-29 05:44:39,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624156673] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:39,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:39,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:44:39,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907988994] [2021-10-29 05:44:39,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:39,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:39,977 INFO L87 Difference]: Start difference. First operand 299 states and 394 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:40,028 INFO L93 Difference]: Finished difference Result 337 states and 433 transitions. [2021-10-29 05:44:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:40,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 05:44:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:40,031 INFO L225 Difference]: With dead ends: 337 [2021-10-29 05:44:40,031 INFO L226 Difference]: Without dead ends: 316 [2021-10-29 05:44:40,033 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-10-29 05:44:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-29 05:44:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2021-10-29 05:44:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 290 states have (on average 1.3655172413793104) internal successors, (396), 300 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 396 transitions. [2021-10-29 05:44:40,055 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 396 transitions. Word has length 22 [2021-10-29 05:44:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:40,055 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 396 transitions. [2021-10-29 05:44:40,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 396 transitions. [2021-10-29 05:44:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:44:40,057 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:40,057 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-10-29 05:44:40,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 05:44:40,058 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 638524463, now seen corresponding path program 1 times [2021-10-29 05:44:40,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:40,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042833324] [2021-10-29 05:44:40,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:40,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:40,110 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:40,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042833324] [2021-10-29 05:44:40,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042833324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:40,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:40,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:44:40,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183471827] [2021-10-29 05:44:40,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:40,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:40,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:40,115 INFO L87 Difference]: Start difference. First operand 301 states and 396 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:40,161 INFO L93 Difference]: Finished difference Result 314 states and 408 transitions. [2021-10-29 05:44:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 05:44:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:40,163 INFO L225 Difference]: With dead ends: 314 [2021-10-29 05:44:40,164 INFO L226 Difference]: Without dead ends: 299 [2021-10-29 05:44:40,164 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-10-29 05:44:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-29 05:44:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-10-29 05:44:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 288 states have (on average 1.3645833333333333) internal successors, (393), 298 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 393 transitions. [2021-10-29 05:44:40,187 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 393 transitions. Word has length 22 [2021-10-29 05:44:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:40,187 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 393 transitions. [2021-10-29 05:44:40,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2021-10-29 05:44:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:44:40,188 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:40,189 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-10-29 05:44:40,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 05:44:40,189 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:40,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash -168683918, now seen corresponding path program 1 times [2021-10-29 05:44:40,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:40,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761686542] [2021-10-29 05:44:40,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:40,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:40,235 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:40,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761686542] [2021-10-29 05:44:40,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761686542] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:40,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:40,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:40,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855874616] [2021-10-29 05:44:40,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:40,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:40,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:40,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:40,238 INFO L87 Difference]: Start difference. First operand 299 states and 393 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:40,435 INFO L93 Difference]: Finished difference Result 341 states and 437 transitions. [2021-10-29 05:44:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:40,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-29 05:44:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:40,439 INFO L225 Difference]: With dead ends: 341 [2021-10-29 05:44:40,439 INFO L226 Difference]: Without dead ends: 314 [2021-10-29 05:44:40,440 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-10-29 05:44:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-29 05:44:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 294. [2021-10-29 05:44:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 284 states have (on average 1.3556338028169015) internal successors, (385), 293 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2021-10-29 05:44:40,462 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 23 [2021-10-29 05:44:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:40,462 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2021-10-29 05:44:40,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2021-10-29 05:44:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:44:40,464 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:40,464 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-10-29 05:44:40,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 05:44:40,465 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -130301320, now seen corresponding path program 1 times [2021-10-29 05:44:40,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:40,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953233912] [2021-10-29 05:44:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:40,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:40,517 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:40,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953233912] [2021-10-29 05:44:40,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953233912] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:40,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:40,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:40,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374484632] [2021-10-29 05:44:40,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:40,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:40,521 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:40,557 INFO L93 Difference]: Finished difference Result 411 states and 527 transitions. [2021-10-29 05:44:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:40,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-29 05:44:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:40,560 INFO L225 Difference]: With dead ends: 411 [2021-10-29 05:44:40,560 INFO L226 Difference]: Without dead ends: 317 [2021-10-29 05:44:40,561 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-10-29 05:44:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-10-29 05:44:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2021-10-29 05:44:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 281 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 367 transitions. [2021-10-29 05:44:40,581 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 367 transitions. Word has length 23 [2021-10-29 05:44:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:40,582 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 367 transitions. [2021-10-29 05:44:40,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 367 transitions. [2021-10-29 05:44:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:44:40,583 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:40,583 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-10-29 05:44:40,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 05:44:40,585 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash -662751181, now seen corresponding path program 1 times [2021-10-29 05:44:40,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:40,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667834846] [2021-10-29 05:44:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:40,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:40,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-10-29 05:44:40,731 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:40,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667834846] [2021-10-29 05:44:40,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667834846] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:40,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:40,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:40,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928403807] [2021-10-29 05:44:40,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:40,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:40,735 INFO L87 Difference]: Start difference. First operand 282 states and 367 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:40,801 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2021-10-29 05:44:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 05:44:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:40,804 INFO L225 Difference]: With dead ends: 382 [2021-10-29 05:44:40,804 INFO L226 Difference]: Without dead ends: 284 [2021-10-29 05:44:40,805 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-10-29 05:44:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-29 05:44:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 270. [2021-10-29 05:44:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.321969696969697) internal successors, (349), 269 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 349 transitions. [2021-10-29 05:44:40,838 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 349 transitions. Word has length 24 [2021-10-29 05:44:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:40,839 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 349 transitions. [2021-10-29 05:44:40,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2021-10-29 05:44:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:44:40,840 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:40,841 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-10-29 05:44:40,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 05:44:40,841 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1269559156, now seen corresponding path program 1 times [2021-10-29 05:44:40,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:40,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484155676] [2021-10-29 05:44:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:40,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:40,889 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:40,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484155676] [2021-10-29 05:44:40,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484155676] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:40,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:40,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:40,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398730021] [2021-10-29 05:44:40,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:40,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:40,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:40,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:40,891 INFO L87 Difference]: Start difference. First operand 270 states and 349 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:41,034 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2021-10-29 05:44:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:41,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 05:44:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:41,037 INFO L225 Difference]: With dead ends: 360 [2021-10-29 05:44:41,038 INFO L226 Difference]: Without dead ends: 340 [2021-10-29 05:44:41,038 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-10-29 05:44:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-29 05:44:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-10-29 05:44:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 280 states have (on average 1.3035714285714286) internal successors, (365), 285 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 365 transitions. [2021-10-29 05:44:41,066 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 365 transitions. Word has length 24 [2021-10-29 05:44:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:41,067 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 365 transitions. [2021-10-29 05:44:41,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 365 transitions. [2021-10-29 05:44:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:44:41,069 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:41,069 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-10-29 05:44:41,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 05:44:41,069 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:41,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1364391258, now seen corresponding path program 1 times [2021-10-29 05:44:41,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:41,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290692092] [2021-10-29 05:44:41,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:41,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:41,130 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:41,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290692092] [2021-10-29 05:44:41,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290692092] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:41,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:41,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:41,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250351874] [2021-10-29 05:44:41,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:41,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:41,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:41,133 INFO L87 Difference]: Start difference. First operand 286 states and 365 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:41,213 INFO L93 Difference]: Finished difference Result 299 states and 377 transitions. [2021-10-29 05:44:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 05:44:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:41,215 INFO L225 Difference]: With dead ends: 299 [2021-10-29 05:44:41,216 INFO L226 Difference]: Without dead ends: 282 [2021-10-29 05:44:41,216 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-10-29 05:44:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-29 05:44:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-10-29 05:44:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.3043478260869565) internal successors, (360), 281 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 360 transitions. [2021-10-29 05:44:41,246 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 360 transitions. Word has length 24 [2021-10-29 05:44:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:41,246 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 360 transitions. [2021-10-29 05:44:41,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 360 transitions. [2021-10-29 05:44:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:44:41,248 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:41,248 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-10-29 05:44:41,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 05:44:41,248 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:41,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash -896029021, now seen corresponding path program 1 times [2021-10-29 05:44:41,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:41,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050680638] [2021-10-29 05:44:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:41,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:41,319 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:41,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050680638] [2021-10-29 05:44:41,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050680638] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:41,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:41,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:41,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381219501] [2021-10-29 05:44:41,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:41,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:41,322 INFO L87 Difference]: Start difference. First operand 282 states and 360 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:41,477 INFO L93 Difference]: Finished difference Result 368 states and 467 transitions. [2021-10-29 05:44:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:41,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 05:44:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:41,480 INFO L225 Difference]: With dead ends: 368 [2021-10-29 05:44:41,480 INFO L226 Difference]: Without dead ends: 282 [2021-10-29 05:44:41,481 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-10-29 05:44:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-29 05:44:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-10-29 05:44:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.2934782608695652) internal successors, (357), 281 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 357 transitions. [2021-10-29 05:44:41,507 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 357 transitions. Word has length 25 [2021-10-29 05:44:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:41,508 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 357 transitions. [2021-10-29 05:44:41,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 357 transitions. [2021-10-29 05:44:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:44:41,509 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:41,509 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-10-29 05:44:41,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 05:44:41,509 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash 719084810, now seen corresponding path program 1 times [2021-10-29 05:44:41,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:41,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103391072] [2021-10-29 05:44:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:41,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:41,560 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:41,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103391072] [2021-10-29 05:44:41,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103391072] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:41,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:41,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:41,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582189433] [2021-10-29 05:44:41,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:41,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:41,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:41,564 INFO L87 Difference]: Start difference. First operand 282 states and 357 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:41,704 INFO L93 Difference]: Finished difference Result 287 states and 362 transitions. [2021-10-29 05:44:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:41,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 05:44:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:41,707 INFO L225 Difference]: With dead ends: 287 [2021-10-29 05:44:41,707 INFO L226 Difference]: Without dead ends: 284 [2021-10-29 05:44:41,708 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-10-29 05:44:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-29 05:44:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2021-10-29 05:44:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 278 states have (on average 1.29136690647482) internal successors, (359), 283 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 359 transitions. [2021-10-29 05:44:41,736 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 359 transitions. Word has length 25 [2021-10-29 05:44:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:41,737 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 359 transitions. [2021-10-29 05:44:41,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2021-10-29 05:44:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:44:41,738 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:41,738 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-10-29 05:44:41,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 05:44:41,739 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash 719096726, now seen corresponding path program 1 times [2021-10-29 05:44:41,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:41,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474594816] [2021-10-29 05:44:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:41,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:41,782 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:41,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474594816] [2021-10-29 05:44:41,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474594816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:41,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:41,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:41,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271727564] [2021-10-29 05:44:41,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:41,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:41,784 INFO L87 Difference]: Start difference. First operand 284 states and 359 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:41,958 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2021-10-29 05:44:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:44:41,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 05:44:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:41,965 INFO L225 Difference]: With dead ends: 342 [2021-10-29 05:44:41,965 INFO L226 Difference]: Without dead ends: 328 [2021-10-29 05:44:41,966 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-10-29 05:44:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-29 05:44:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 288. [2021-10-29 05:44:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2836879432624113) internal successors, (362), 287 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 362 transitions. [2021-10-29 05:44:41,994 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 362 transitions. Word has length 25 [2021-10-29 05:44:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:41,995 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 362 transitions. [2021-10-29 05:44:41,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 362 transitions. [2021-10-29 05:44:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:44:41,996 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:41,996 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-10-29 05:44:41,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 05:44:41,997 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1275592658, now seen corresponding path program 1 times [2021-10-29 05:44:41,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:41,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231922845] [2021-10-29 05:44:42,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:42,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:42,055 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:42,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231922845] [2021-10-29 05:44:42,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231922845] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:42,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:42,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:42,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195960803] [2021-10-29 05:44:42,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:42,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:42,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:42,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:42,058 INFO L87 Difference]: Start difference. First operand 288 states and 362 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:42,206 INFO L93 Difference]: Finished difference Result 337 states and 413 transitions. [2021-10-29 05:44:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 05:44:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:42,209 INFO L225 Difference]: With dead ends: 337 [2021-10-29 05:44:42,209 INFO L226 Difference]: Without dead ends: 288 [2021-10-29 05:44:42,209 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-10-29 05:44:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-29 05:44:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-10-29 05:44:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2553191489361701) internal successors, (354), 287 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 354 transitions. [2021-10-29 05:44:42,245 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 354 transitions. Word has length 25 [2021-10-29 05:44:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:42,246 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 354 transitions. [2021-10-29 05:44:42,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 354 transitions. [2021-10-29 05:44:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 05:44:42,248 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:42,248 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-10-29 05:44:42,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 05:44:42,248 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 513282031, now seen corresponding path program 1 times [2021-10-29 05:44:42,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:42,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271790252] [2021-10-29 05:44:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:42,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:42,322 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:42,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271790252] [2021-10-29 05:44:42,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271790252] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:42,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:42,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:42,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16721158] [2021-10-29 05:44:42,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:42,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:42,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:42,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:42,325 INFO L87 Difference]: Start difference. First operand 288 states and 354 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:42,571 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2021-10-29 05:44:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:44:42,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-29 05:44:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:42,574 INFO L225 Difference]: With dead ends: 342 [2021-10-29 05:44:42,574 INFO L226 Difference]: Without dead ends: 338 [2021-10-29 05:44:42,574 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-10-29 05:44:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-29 05:44:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 288. [2021-10-29 05:44:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2553191489361701) internal successors, (354), 287 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 354 transitions. [2021-10-29 05:44:42,610 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 354 transitions. Word has length 26 [2021-10-29 05:44:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:42,611 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 354 transitions. [2021-10-29 05:44:42,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 354 transitions. [2021-10-29 05:44:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 05:44:42,612 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:42,612 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-10-29 05:44:42,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-29 05:44:42,613 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1329987784, now seen corresponding path program 1 times [2021-10-29 05:44:42,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:42,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112056347] [2021-10-29 05:44:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:42,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:42,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:42,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112056347] [2021-10-29 05:44:42,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112056347] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:42,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:42,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:44:42,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084317732] [2021-10-29 05:44:42,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:44:42,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:42,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:44:42,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:44:42,716 INFO L87 Difference]: Start difference. First operand 288 states and 354 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:42,911 INFO L93 Difference]: Finished difference Result 321 states and 387 transitions. [2021-10-29 05:44:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:44:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-29 05:44:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:42,914 INFO L225 Difference]: With dead ends: 321 [2021-10-29 05:44:42,914 INFO L226 Difference]: Without dead ends: 303 [2021-10-29 05:44:42,915 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-29 05:44:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-29 05:44:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 282. [2021-10-29 05:44:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.2210144927536233) internal successors, (337), 281 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 337 transitions. [2021-10-29 05:44:42,946 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 337 transitions. Word has length 26 [2021-10-29 05:44:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:42,946 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 337 transitions. [2021-10-29 05:44:42,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 337 transitions. [2021-10-29 05:44:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 05:44:42,948 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:42,948 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-10-29 05:44:42,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 05:44:42,948 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:42,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -937040231, now seen corresponding path program 1 times [2021-10-29 05:44:42,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:42,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401917096] [2021-10-29 05:44:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:42,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:42,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:42,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401917096] [2021-10-29 05:44:42,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401917096] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:42,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:42,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:42,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085945299] [2021-10-29 05:44:42,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:44:42,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:42,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:44:42,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:44:42,990 INFO L87 Difference]: Start difference. First operand 282 states and 337 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:43,103 INFO L93 Difference]: Finished difference Result 311 states and 364 transitions. [2021-10-29 05:44:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:44:43,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-29 05:44:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:43,105 INFO L225 Difference]: With dead ends: 311 [2021-10-29 05:44:43,105 INFO L226 Difference]: Without dead ends: 269 [2021-10-29 05:44:43,106 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-10-29 05:44:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-10-29 05:44:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2021-10-29 05:44:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 253 states have (on average 1.225296442687747) internal successors, (310), 258 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2021-10-29 05:44:43,137 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 26 [2021-10-29 05:44:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:43,138 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2021-10-29 05:44:43,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2021-10-29 05:44:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:44:43,139 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:43,139 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-10-29 05:44:43,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 05:44:43,140 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1033980549, now seen corresponding path program 1 times [2021-10-29 05:44:43,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:43,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564762788] [2021-10-29 05:44:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:43,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:43,191 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:43,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564762788] [2021-10-29 05:44:43,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564762788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:43,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:43,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:43,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299773187] [2021-10-29 05:44:43,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:43,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:43,193 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:43,322 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2021-10-29 05:44:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:43,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-29 05:44:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:43,324 INFO L225 Difference]: With dead ends: 266 [2021-10-29 05:44:43,324 INFO L226 Difference]: Without dead ends: 237 [2021-10-29 05:44:43,326 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-10-29 05:44:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-10-29 05:44:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2021-10-29 05:44:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2378854625550662) internal successors, (281), 232 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2021-10-29 05:44:43,355 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 27 [2021-10-29 05:44:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:43,355 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2021-10-29 05:44:43,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2021-10-29 05:44:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:44:43,356 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:43,357 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] [2021-10-29 05:44:43,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-29 05:44:43,358 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash -835413411, now seen corresponding path program 1 times [2021-10-29 05:44:43,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:43,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785115180] [2021-10-29 05:44:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:43,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:43,414 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:43,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785115180] [2021-10-29 05:44:43,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785115180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:43,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:43,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:43,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398505456] [2021-10-29 05:44:43,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:43,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:43,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:43,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:43,416 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:43,545 INFO L93 Difference]: Finished difference Result 243 states and 289 transitions. [2021-10-29 05:44:43,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-29 05:44:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:43,548 INFO L225 Difference]: With dead ends: 243 [2021-10-29 05:44:43,548 INFO L226 Difference]: Without dead ends: 238 [2021-10-29 05:44:43,549 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-10-29 05:44:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-29 05:44:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 233. [2021-10-29 05:44:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2334801762114538) internal successors, (280), 232 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2021-10-29 05:44:43,594 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 28 [2021-10-29 05:44:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:43,596 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2021-10-29 05:44:43,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2021-10-29 05:44:43,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:44:43,597 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:43,597 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] [2021-10-29 05:44:43,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-29 05:44:43,598 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash -336964878, now seen corresponding path program 1 times [2021-10-29 05:44:43,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:43,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954847739] [2021-10-29 05:44:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:43,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:43,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:43,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954847739] [2021-10-29 05:44:43,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954847739] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:43,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:43,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:43,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908480692] [2021-10-29 05:44:43,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:43,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:43,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:43,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:43,654 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:43,861 INFO L93 Difference]: Finished difference Result 263 states and 314 transitions. [2021-10-29 05:44:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-29 05:44:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:43,864 INFO L225 Difference]: With dead ends: 263 [2021-10-29 05:44:43,864 INFO L226 Difference]: Without dead ends: 261 [2021-10-29 05:44:43,864 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-10-29 05:44:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-29 05:44:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 233. [2021-10-29 05:44:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2334801762114538) internal successors, (280), 232 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2021-10-29 05:44:43,894 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 28 [2021-10-29 05:44:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:43,895 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2021-10-29 05:44:43,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2021-10-29 05:44:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:44:43,896 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:43,896 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-10-29 05:44:43,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-29 05:44:43,896 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:43,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2033165494, now seen corresponding path program 1 times [2021-10-29 05:44:43,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:43,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674944287] [2021-10-29 05:44:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:43,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:43,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:43,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674944287] [2021-10-29 05:44:43,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674944287] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:43,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:43,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:43,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965993223] [2021-10-29 05:44:43,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:43,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:43,946 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:44,019 INFO L93 Difference]: Finished difference Result 247 states and 293 transitions. [2021-10-29 05:44:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:44,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-29 05:44:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:44,021 INFO L225 Difference]: With dead ends: 247 [2021-10-29 05:44:44,021 INFO L226 Difference]: Without dead ends: 226 [2021-10-29 05:44:44,022 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-10-29 05:44:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-29 05:44:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-10-29 05:44:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 220 states have (on average 1.2272727272727273) internal successors, (270), 225 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 270 transitions. [2021-10-29 05:44:44,052 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 270 transitions. Word has length 29 [2021-10-29 05:44:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:44,052 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 270 transitions. [2021-10-29 05:44:44,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 270 transitions. [2021-10-29 05:44:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:44:44,053 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:44,053 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-10-29 05:44:44,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-29 05:44:44,054 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -657637208, now seen corresponding path program 1 times [2021-10-29 05:44:44,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:44,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549805751] [2021-10-29 05:44:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:44,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:44,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:44,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549805751] [2021-10-29 05:44:44,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549805751] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:44,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:44,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:44:44,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831354906] [2021-10-29 05:44:44,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:44,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:44,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:44,091 INFO L87 Difference]: Start difference. First operand 226 states and 270 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:44,213 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2021-10-29 05:44:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:44,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-29 05:44:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:44,215 INFO L225 Difference]: With dead ends: 231 [2021-10-29 05:44:44,215 INFO L226 Difference]: Without dead ends: 213 [2021-10-29 05:44:44,218 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-10-29 05:44:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-29 05:44:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-10-29 05:44:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.2173913043478262) internal successors, (252), 212 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2021-10-29 05:44:44,249 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 29 [2021-10-29 05:44:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:44,249 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2021-10-29 05:44:44,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2021-10-29 05:44:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:44:44,250 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:44,250 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-10-29 05:44:44,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-29 05:44:44,251 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:44,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1797324549, now seen corresponding path program 1 times [2021-10-29 05:44:44,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:44,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969140820] [2021-10-29 05:44:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:44,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:44,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:44,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969140820] [2021-10-29 05:44:44,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969140820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:44,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:44,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:44,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972245121] [2021-10-29 05:44:44,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:44,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:44,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:44,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:44,295 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:44,376 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2021-10-29 05:44:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-29 05:44:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:44,378 INFO L225 Difference]: With dead ends: 237 [2021-10-29 05:44:44,378 INFO L226 Difference]: Without dead ends: 213 [2021-10-29 05:44:44,379 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-10-29 05:44:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-29 05:44:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-10-29 05:44:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.21256038647343) internal successors, (251), 212 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2021-10-29 05:44:44,413 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 29 [2021-10-29 05:44:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:44,414 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2021-10-29 05:44:44,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2021-10-29 05:44:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 05:44:44,415 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:44,415 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-10-29 05:44:44,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-29 05:44:44,416 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash -505348968, now seen corresponding path program 1 times [2021-10-29 05:44:44,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:44,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352316476] [2021-10-29 05:44:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:44,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:44,492 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:44,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352316476] [2021-10-29 05:44:44,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352316476] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:44,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:44,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:44,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661770387] [2021-10-29 05:44:44,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:44,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:44,495 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:44,649 INFO L93 Difference]: Finished difference Result 234 states and 269 transitions. [2021-10-29 05:44:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:44:44,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-29 05:44:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:44,651 INFO L225 Difference]: With dead ends: 234 [2021-10-29 05:44:44,651 INFO L226 Difference]: Without dead ends: 213 [2021-10-29 05:44:44,652 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-10-29 05:44:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-29 05:44:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2021-10-29 05:44:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.2131979695431472) internal successors, (239), 202 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2021-10-29 05:44:44,681 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 30 [2021-10-29 05:44:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:44,682 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2021-10-29 05:44:44,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2021-10-29 05:44:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 05:44:44,683 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:44,683 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-10-29 05:44:44,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-29 05:44:44,683 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1799897054, now seen corresponding path program 1 times [2021-10-29 05:44:44,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:44,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111568831] [2021-10-29 05:44:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:44,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:44,743 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:44,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111568831] [2021-10-29 05:44:44,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111568831] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:44,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:44,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:44,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169327879] [2021-10-29 05:44:44,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:44,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:44,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:44,745 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:44,909 INFO L93 Difference]: Finished difference Result 279 states and 334 transitions. [2021-10-29 05:44:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:44:44,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-29 05:44:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:44,911 INFO L225 Difference]: With dead ends: 279 [2021-10-29 05:44:44,912 INFO L226 Difference]: Without dead ends: 211 [2021-10-29 05:44:44,912 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-10-29 05:44:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-29 05:44:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2021-10-29 05:44:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.202127659574468) internal successors, (226), 192 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2021-10-29 05:44:44,939 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 30 [2021-10-29 05:44:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:44,939 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2021-10-29 05:44:44,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2021-10-29 05:44:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-29 05:44:44,940 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:44,940 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] [2021-10-29 05:44:44,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-29 05:44:44,942 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash -138267735, now seen corresponding path program 1 times [2021-10-29 05:44:44,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:44,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647522203] [2021-10-29 05:44:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:44,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:44,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:44,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647522203] [2021-10-29 05:44:44,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647522203] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:44,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:44,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:44,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706992131] [2021-10-29 05:44:44,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:44,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:44,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:44,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:44,988 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:45,031 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2021-10-29 05:44:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:45,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-10-29 05:44:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:45,033 INFO L225 Difference]: With dead ends: 203 [2021-10-29 05:44:45,033 INFO L226 Difference]: Without dead ends: 155 [2021-10-29 05:44:45,033 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10-29 05:44:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-10-29 05:44:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-10-29 05:44:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 154 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2021-10-29 05:44:45,058 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 31 [2021-10-29 05:44:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:45,058 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2021-10-29 05:44:45,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2021-10-29 05:44:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 05:44:45,059 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:45,059 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] [2021-10-29 05:44:45,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-29 05:44:45,059 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash 709117488, now seen corresponding path program 1 times [2021-10-29 05:44:45,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:45,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845876361] [2021-10-29 05:44:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:45,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:45,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:45,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845876361] [2021-10-29 05:44:45,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845876361] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:45,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:45,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:45,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277722570] [2021-10-29 05:44:45,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:45,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:45,136 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:45,279 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2021-10-29 05:44:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-10-29 05:44:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:45,281 INFO L225 Difference]: With dead ends: 187 [2021-10-29 05:44:45,281 INFO L226 Difference]: Without dead ends: 163 [2021-10-29 05:44:45,281 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-10-29 05:44:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-10-29 05:44:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2021-10-29 05:44:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 147 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2021-10-29 05:44:45,303 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 32 [2021-10-29 05:44:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:45,316 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2021-10-29 05:44:45,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2021-10-29 05:44:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 05:44:45,317 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:45,318 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-10-29 05:44:45,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-29 05:44:45,318 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1394718914, now seen corresponding path program 1 times [2021-10-29 05:44:45,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:45,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062613878] [2021-10-29 05:44:45,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:45,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:45,390 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:45,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062613878] [2021-10-29 05:44:45,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062613878] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:45,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:45,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:44:45,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221648271] [2021-10-29 05:44:45,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:44:45,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:44:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:44:45,392 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:45,540 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2021-10-29 05:44:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:44:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-29 05:44:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:45,541 INFO L225 Difference]: With dead ends: 164 [2021-10-29 05:44:45,541 INFO L226 Difference]: Without dead ends: 118 [2021-10-29 05:44:45,542 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-10-29 05:44:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-29 05:44:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-10-29 05:44:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.19) internal successors, (119), 101 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2021-10-29 05:44:45,558 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 33 [2021-10-29 05:44:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:45,558 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2021-10-29 05:44:45,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,558 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2021-10-29 05:44:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:44:45,559 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:45,559 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-10-29 05:44:45,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-29 05:44:45,559 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:45,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1245231514, now seen corresponding path program 1 times [2021-10-29 05:44:45,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:45,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229007154] [2021-10-29 05:44:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:45,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:45,618 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:45,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229007154] [2021-10-29 05:44:45,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229007154] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:45,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:45,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:45,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402782185] [2021-10-29 05:44:45,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:45,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:45,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:45,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:45,620 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:45,723 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2021-10-29 05:44:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-29 05:44:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:45,724 INFO L225 Difference]: With dead ends: 134 [2021-10-29 05:44:45,724 INFO L226 Difference]: Without dead ends: 132 [2021-10-29 05:44:45,725 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-10-29 05:44:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-10-29 05:44:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2021-10-29 05:44:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.19) internal successors, (119), 101 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2021-10-29 05:44:45,741 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 36 [2021-10-29 05:44:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:45,741 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2021-10-29 05:44:45,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2021-10-29 05:44:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 05:44:45,742 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:45,742 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-10-29 05:44:45,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-29 05:44:45,743 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash 904695418, now seen corresponding path program 1 times [2021-10-29 05:44:45,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:45,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736678462] [2021-10-29 05:44:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:45,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:45,812 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:45,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736678462] [2021-10-29 05:44:45,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736678462] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:45,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:45,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 05:44:45,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841677813] [2021-10-29 05:44:45,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 05:44:45,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:45,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 05:44:45,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:44:45,815 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:45,960 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2021-10-29 05:44:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 05:44:45,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-29 05:44:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:45,962 INFO L225 Difference]: With dead ends: 118 [2021-10-29 05:44:45,962 INFO L226 Difference]: Without dead ends: 102 [2021-10-29 05:44:45,963 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-29 05:44:45,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-10-29 05:44:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-10-29 05:44:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.18) internal successors, (118), 101 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2021-10-29 05:44:45,981 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 40 [2021-10-29 05:44:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:45,982 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-10-29 05:44:45,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2021-10-29 05:44:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 05:44:45,983 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:45,983 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-10-29 05:44:45,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-29 05:44:45,983 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash 173896077, now seen corresponding path program 1 times [2021-10-29 05:44:45,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:45,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666267015] [2021-10-29 05:44:45,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:45,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:46,058 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:46,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666267015] [2021-10-29 05:44:46,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666267015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:46,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:46,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:44:46,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254860984] [2021-10-29 05:44:46,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:44:46,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:46,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:44:46,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:44:46,060 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:46,154 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2021-10-29 05:44:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:44:46,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-29 05:44:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:46,155 INFO L225 Difference]: With dead ends: 129 [2021-10-29 05:44:46,155 INFO L226 Difference]: Without dead ends: 111 [2021-10-29 05:44:46,156 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-10-29 05:44:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-10-29 05:44:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-10-29 05:44:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 108 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2021-10-29 05:44:46,175 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 40 [2021-10-29 05:44:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:46,176 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2021-10-29 05:44:46,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2021-10-29 05:44:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 05:44:46,177 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:46,177 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-10-29 05:44:46,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-29 05:44:46,177 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:46,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1032182008, now seen corresponding path program 1 times [2021-10-29 05:44:46,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:46,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729837481] [2021-10-29 05:44:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:46,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:46,240 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:46,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729837481] [2021-10-29 05:44:46,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729837481] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:46,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:46,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:44:46,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219743195] [2021-10-29 05:44:46,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:44:46,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:46,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:44:46,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:44:46,244 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:46,356 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2021-10-29 05:44:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:44:46,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-29 05:44:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:46,358 INFO L225 Difference]: With dead ends: 168 [2021-10-29 05:44:46,358 INFO L226 Difference]: Without dead ends: 116 [2021-10-29 05:44:46,360 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-10-29 05:44:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-29 05:44:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2021-10-29 05:44:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1046511627906976) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-10-29 05:44:46,392 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 40 [2021-10-29 05:44:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:46,394 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-10-29 05:44:46,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-10-29 05:44:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 05:44:46,395 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:46,396 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] [2021-10-29 05:44:46,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-29 05:44:46,396 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1597143897, now seen corresponding path program 1 times [2021-10-29 05:44:46,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:46,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435787154] [2021-10-29 05:44:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:46,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:46,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:46,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435787154] [2021-10-29 05:44:46,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435787154] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:46,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:46,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:44:46,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257510083] [2021-10-29 05:44:46,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:44:46,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:44:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:44:46,457 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:46,544 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-10-29 05:44:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:44:46,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-10-29 05:44:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:46,546 INFO L225 Difference]: With dead ends: 101 [2021-10-29 05:44:46,546 INFO L226 Difference]: Without dead ends: 65 [2021-10-29 05:44:46,546 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-10-29 05:44:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-29 05:44:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-29 05:44:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-10-29 05:44:46,560 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 43 [2021-10-29 05:44:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:46,561 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-10-29 05:44:46,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-10-29 05:44:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 05:44:46,564 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:46,564 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] [2021-10-29 05:44:46,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-29 05:44:46,566 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1037680409, now seen corresponding path program 1 times [2021-10-29 05:44:46,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:46,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57653268] [2021-10-29 05:44:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:46,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:46,616 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:46,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57653268] [2021-10-29 05:44:46,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57653268] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:46,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:46,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:44:46,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929586983] [2021-10-29 05:44:46,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:44:46,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:46,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:44:46,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:44:46,618 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:46,660 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2021-10-29 05:44:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:44:46,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-10-29 05:44:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:46,661 INFO L225 Difference]: With dead ends: 93 [2021-10-29 05:44:46,661 INFO L226 Difference]: Without dead ends: 65 [2021-10-29 05:44:46,662 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-10-29 05:44:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-29 05:44:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-29 05:44:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-10-29 05:44:46,675 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 43 [2021-10-29 05:44:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:46,675 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-10-29 05:44:46,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-10-29 05:44:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-29 05:44:46,680 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:46,680 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] [2021-10-29 05:44:46,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-29 05:44:46,680 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1050287321, now seen corresponding path program 1 times [2021-10-29 05:44:46,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:46,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122846689] [2021-10-29 05:44:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:46,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:46,773 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:46,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122846689] [2021-10-29 05:44:46,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122846689] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:46,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:46,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:44:46,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110501544] [2021-10-29 05:44:46,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:44:46,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:46,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:44:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:44:46,775 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:46,862 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-10-29 05:44:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:44:46,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2021-10-29 05:44:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:46,863 INFO L225 Difference]: With dead ends: 83 [2021-10-29 05:44:46,864 INFO L226 Difference]: Without dead ends: 65 [2021-10-29 05:44:46,864 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-10-29 05:44:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-29 05:44:46,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-29 05:44:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-10-29 05:44:46,877 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 52 [2021-10-29 05:44:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:46,878 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-10-29 05:44:46,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-10-29 05:44:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-29 05:44:46,879 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:46,879 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-10-29 05:44:46,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-29 05:44:46,879 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:46,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1433729709, now seen corresponding path program 1 times [2021-10-29 05:44:46,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:46,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567959920] [2021-10-29 05:44:46,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:46,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:47,006 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:47,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567959920] [2021-10-29 05:44:47,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567959920] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:47,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:47,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-29 05:44:47,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416645516] [2021-10-29 05:44:47,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-29 05:44:47,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-29 05:44:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-29 05:44:47,008 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:47,309 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-10-29 05:44:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-29 05:44:47,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-29 05:44:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:47,311 INFO L225 Difference]: With dead ends: 110 [2021-10-29 05:44:47,311 INFO L226 Difference]: Without dead ends: 62 [2021-10-29 05:44:47,311 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-10-29 05:44:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-29 05:44:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-29 05:44:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-10-29 05:44:47,324 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 54 [2021-10-29 05:44:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:47,324 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-10-29 05:44:47,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-10-29 05:44:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-29 05:44:47,325 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:44:47,325 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, 1, 1, 1] [2021-10-29 05:44:47,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-29 05:44:47,326 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-29 05:44:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:44:47,326 INFO L85 PathProgramCache]: Analyzing trace with hash -481267565, now seen corresponding path program 1 times [2021-10-29 05:44:47,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:44:47,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510649965] [2021-10-29 05:44:47,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:44:47,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:44:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:44:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:44:47,459 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:44:47,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510649965] [2021-10-29 05:44:47,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510649965] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:44:47,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:44:47,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 05:44:47,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033919198] [2021-10-29 05:44:47,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 05:44:47,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:44:47,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 05:44:47,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:44:47,461 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:44:47,705 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2021-10-29 05:44:47,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 05:44:47,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-10-29 05:44:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:44:47,706 INFO L225 Difference]: With dead ends: 77 [2021-10-29 05:44:47,706 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 05:44:47,706 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-10-29 05:44:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 05:44:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 05:44:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 05:44:47,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2021-10-29 05:44:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:44:47,707 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 05:44:47,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:44:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 05:44:47,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 05:44:47,711 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,712 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,713 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,713 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,713 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,713 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,717 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,717 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,717 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,717 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,717 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,719 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,719 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,719 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,719 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,719 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,720 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,720 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,720 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,720 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,721 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,721 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,721 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,721 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,721 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,722 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,722 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,722 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,722 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,722 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,723 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,723 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,723 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,723 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,723 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,724 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:44:47,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-29 05:44:47,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-29 05:44:47,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:47,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:48,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:49,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:44:59,508 INFO L857 garLoopResultBuilder]: For program point L1026-2(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,509 INFO L857 garLoopResultBuilder]: For program point L1026-4(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,509 INFO L857 garLoopResultBuilder]: For program point L1026-6(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,509 INFO L857 garLoopResultBuilder]: For program point L1026-8(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,509 INFO L857 garLoopResultBuilder]: For program point L1026-10(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,509 INFO L857 garLoopResultBuilder]: For program point L1026-12(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,509 INFO L857 garLoopResultBuilder]: For program point L1026-14(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,510 INFO L857 garLoopResultBuilder]: For program point L1026-16(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,510 INFO L857 garLoopResultBuilder]: For program point L1026-18(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,510 INFO L857 garLoopResultBuilder]: For program point L1026-20(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,510 INFO L857 garLoopResultBuilder]: For program point L236-1(lines 229 417) no Hoare annotation was computed. [2021-10-29 05:44:59,510 INFO L857 garLoopResultBuilder]: For program point L1297(lines 1297 1311) no Hoare annotation was computed. [2021-10-29 05:44:59,510 INFO L857 garLoopResultBuilder]: For program point L240(lines 240 246) no Hoare annotation was computed. [2021-10-29 05:44:59,510 INFO L857 garLoopResultBuilder]: For program point L637(lines 637 642) no Hoare annotation was computed. [2021-10-29 05:44:59,511 INFO L857 garLoopResultBuilder]: For program point L637-2(lines 637 642) no Hoare annotation was computed. [2021-10-29 05:44:59,511 INFO L853 garLoopResultBuilder]: At program point L1562(lines 1183 1564) the Hoare annotation is: (let ((.cse13 (= ~pended~0 1)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (<= 7 ~IPC~0)) (.cse9 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse11 (= 2 ~DC~0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse10 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse5 (= ~pended~0 0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse2 (= ~IPC~0 ~s~0) .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse10 .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse2 .cse3 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse14 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse12 .cse5 .cse6) (and .cse0 .cse11 .cse13 .cse2 .cse4 (= ~s~0 ~NP~0) .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse14 .cse12 (<= 4 ~SKIP2~0) .cse5 .cse6 (= ~SKIP2~0 ~s~0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5 .cse6))) [2021-10-29 05:44:59,511 INFO L857 garLoopResultBuilder]: For program point L1298(lines 1298 1304) no Hoare annotation was computed. [2021-10-29 05:44:59,511 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,512 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,512 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-10-29 05:44:59,512 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-10-29 05:44:59,512 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,512 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,512 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 383) no Hoare annotation was computed. [2021-10-29 05:44:59,513 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,513 INFO L853 garLoopResultBuilder]: At program point L644(lines 612 646) 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)) (.cse2 (<= ULTIMATE.start_main_~status~1 258)) (.cse3 (= 2 ~DC~0)) (.cse4 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~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 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2021-10-29 05:44:59,513 INFO L857 garLoopResultBuilder]: For program point L512(lines 512 517) no Hoare annotation was computed. [2021-10-29 05:44:59,513 INFO L853 garLoopResultBuilder]: At program point L512-2(lines 512 517) 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) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 05:44:59,514 INFO L853 garLoopResultBuilder]: At program point L118(lines 118 148) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,514 INFO L857 garLoopResultBuilder]: For program point L118-2(lines 110 158) no Hoare annotation was computed. [2021-10-29 05:44:59,514 INFO L857 garLoopResultBuilder]: For program point L1043(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,514 INFO L853 garLoopResultBuilder]: At program point L118-3(lines 118 148) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,514 INFO L857 garLoopResultBuilder]: For program point L1043-2(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,515 INFO L857 garLoopResultBuilder]: For program point L118-5(lines 110 158) no Hoare annotation was computed. [2021-10-29 05:44:59,515 INFO L857 garLoopResultBuilder]: For program point L1043-4(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,515 INFO L857 garLoopResultBuilder]: For program point L1043-6(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,515 INFO L857 garLoopResultBuilder]: For program point L1043-8(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,515 INFO L857 garLoopResultBuilder]: For program point L1043-10(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,515 INFO L857 garLoopResultBuilder]: For program point L1043-12(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,516 INFO L857 garLoopResultBuilder]: For program point L1043-14(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,516 INFO L857 garLoopResultBuilder]: For program point L1043-16(lines 1043 1049) no Hoare annotation was computed. [2021-10-29 05:44:59,516 INFO L857 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2021-10-29 05:44:59,516 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,516 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,516 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,517 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,517 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,517 INFO L853 garLoopResultBuilder]: At program point L787(lines 780 835) the Hoare annotation is: (let ((.cse18 (= ~IPC~0 ~s~0)) (.cse16 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse20 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= 4 ~SKIP2~0)) (.cse14 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= 7 ~IPC~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse7 (= 2 ~DC~0)) (.cse21 (= ~pended~0 1)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse19 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse23 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 ~DC~0)) (.cse5 (= ~pended~0 0)) (.cse22 (= ~compRegistered~0 0))) (or (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse6 .cse1 .cse7 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse8 .cse9 .cse10 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse12 .cse5 .cse13 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse14 .cse15 .cse16 .cse0 .cse1 .cse7 .cse17 .cse18 .cse19 .cse5) (and .cse15 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse1 (or .cse20 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse11 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse19 .cse5) (and .cse0 .cse1 .cse7 .cse21 .cse4 .cse18 .cse22) (and .cse0 .cse2 .cse21 .cse3 .cse4 .cse22) (and .cse14 .cse15 .cse16 .cse1 .cse7 .cse17 .cse11 .cse19 .cse12 .cse5 .cse13) (and .cse23 .cse0 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5) (and .cse6 .cse15 .cse0 .cse20 .cse1 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse8 .cse3 .cse9 .cse4 .cse10 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse19 .cse12 .cse5) (and .cse14 .cse15 .cse0 .cse1 .cse7 .cse21 .cse11 .cse19 .cse22 .cse13) (and .cse23 .cse0 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4 .cse5) (and .cse2 (= ULTIMATE.start_main_~status~1 0) .cse5 .cse22))) [2021-10-29 05:44:59,517 INFO L853 garLoopResultBuilder]: At program point L1316(lines 1316 1550) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,518 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 291) no Hoare annotation was computed. [2021-10-29 05:44:59,518 INFO L857 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2021-10-29 05:44:59,518 INFO L853 garLoopResultBuilder]: At program point L129(lines 129 136) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,518 INFO L853 garLoopResultBuilder]: At program point L129-1(lines 129 136) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,518 INFO L857 garLoopResultBuilder]: For program point L1452(lines 1452 1455) no Hoare annotation was computed. [2021-10-29 05:44:59,519 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,519 INFO L857 garLoopResultBuilder]: For program point L528(lines 528 593) no Hoare annotation was computed. [2021-10-29 05:44:59,519 INFO L857 garLoopResultBuilder]: For program point L528-1(lines 528 593) no Hoare annotation was computed. [2021-10-29 05:44:59,519 INFO L853 garLoopResultBuilder]: At program point L1321(lines 1321 1548) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,519 INFO L857 garLoopResultBuilder]: For program point L530(lines 530 570) no Hoare annotation was computed. [2021-10-29 05:44:59,520 INFO L853 garLoopResultBuilder]: At program point L795(lines 788 834) the Hoare annotation is: (let ((.cse0 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse7 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (= ~SKIP2~0 ~s~0)) (.cse9 (= 2 ~DC~0)) (.cse11 (= ~IPC~0 ~s~0)) (.cse21 (not (= ~MPR3~0 ~s~0))) (.cse20 (= ~pended~0 1)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse6 (<= 7 ~IPC~0)) (.cse1 (not (= ~SKIP2~0 2))) (.cse22 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= ~s~0 ~DC~0)) (.cse17 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse3 (= 2 ~s~0)) (.cse18 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (not (= ~IPC~0 2))) (.cse19 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse14 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse5 .cse6 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse12 .cse14 .cse15) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse16 .cse8 .cse9 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse17 .cse18 .cse19 .cse13 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse14 .cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse1 .cse8 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse5 .cse6 .cse1 .cse8 .cse9 .cse20 .cse13 .cse12 .cse15 .cse21) (and .cse1 .cse8 .cse9 .cse20 .cse4 .cse11 .cse21) (and .cse6 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse1 .cse8 (or .cse22 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse13 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse12) (and .cse2 (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) (and .cse1 .cse2 .cse20 .cse3 .cse4) (and .cse16 .cse6 .cse1 .cse22 .cse8 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse17 .cse3 .cse18 .cse4 .cse19 .cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse12 .cse14))) [2021-10-29 05:44:59,520 INFO L853 garLoopResultBuilder]: At program point L531(lines 531 541) 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_FlFdcDeviceIo_~ntStatus~2 258) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 05:44:59,520 INFO L860 garLoopResultBuilder]: At program point L796(lines 780 835) the Hoare annotation is: true [2021-10-29 05:44:59,520 INFO L853 garLoopResultBuilder]: At program point L664(lines 724 726) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,521 INFO L857 garLoopResultBuilder]: For program point L797(lines 797 832) no Hoare annotation was computed. [2021-10-29 05:44:59,521 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,521 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,521 INFO L857 garLoopResultBuilder]: For program point L798(lines 798 831) no Hoare annotation was computed. [2021-10-29 05:44:59,521 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,522 INFO L857 garLoopResultBuilder]: For program point L1591-2(lines 1589 1620) no Hoare annotation was computed. [2021-10-29 05:44:59,522 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,522 INFO L857 garLoopResultBuilder]: For program point L799(lines 799 809) no Hoare annotation was computed. [2021-10-29 05:44:59,522 INFO L857 garLoopResultBuilder]: For program point L271(lines 271 277) no Hoare annotation was computed. [2021-10-29 05:44:59,522 INFO L857 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2021-10-29 05:44:59,522 INFO L853 garLoopResultBuilder]: At program point L1594-1(lines 1594 1618) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (= ~compRegistered~0 0))) (or (and .cse0 (<= (+ 5 ~NP~0) ~MPR3~0) (= ~s~0 ~DC~0) .cse1 (= 2 ~s~0) .cse2 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) (= ~pended~0 0) .cse3) (and .cse0 (= 2 ~DC~0) (= ~pended~0 1) .cse1 .cse2 (= ~s~0 ~NP~0) .cse3))) [2021-10-29 05:44:59,523 INFO L857 garLoopResultBuilder]: For program point L1462(lines 1462 1482) no Hoare annotation was computed. [2021-10-29 05:44:59,523 INFO L857 garLoopResultBuilder]: For program point L1330(lines 1330 1546) no Hoare annotation was computed. [2021-10-29 05:44:59,523 INFO L857 garLoopResultBuilder]: For program point L1066(lines 1066 1085) no Hoare annotation was computed. [2021-10-29 05:44:59,523 INFO L857 garLoopResultBuilder]: For program point L1066-1(lines 1066 1085) no Hoare annotation was computed. [2021-10-29 05:44:59,523 INFO L857 garLoopResultBuilder]: For program point L1066-2(lines 1066 1085) no Hoare annotation was computed. [2021-10-29 05:44:59,523 INFO L857 garLoopResultBuilder]: For program point L1066-3(lines 1066 1085) no Hoare annotation was computed. [2021-10-29 05:44:59,524 INFO L857 garLoopResultBuilder]: For program point L1463(lines 1463 1466) no Hoare annotation was computed. [2021-10-29 05:44:59,524 INFO L857 garLoopResultBuilder]: For program point L1067(lines 1067 1072) no Hoare annotation was computed. [2021-10-29 05:44:59,524 INFO L857 garLoopResultBuilder]: For program point L1067-2(lines 1067 1072) no Hoare annotation was computed. [2021-10-29 05:44:59,524 INFO L857 garLoopResultBuilder]: For program point L1067-4(lines 1067 1072) no Hoare annotation was computed. [2021-10-29 05:44:59,524 INFO L857 garLoopResultBuilder]: For program point L1067-6(lines 1067 1072) no Hoare annotation was computed. [2021-10-29 05:44:59,524 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,525 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 146) no Hoare annotation was computed. [2021-10-29 05:44:59,525 INFO L857 garLoopResultBuilder]: For program point L144-1(lines 144 146) no Hoare annotation was computed. [2021-10-29 05:44:59,525 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,525 INFO L853 garLoopResultBuilder]: At program point L543(lines 530 570) 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_FlFdcDeviceIo_~ntStatus~2 258) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 05:44:59,525 INFO L857 garLoopResultBuilder]: For program point L1468(lines 1468 1481) no Hoare annotation was computed. [2021-10-29 05:44:59,526 INFO L853 garLoopResultBuilder]: At program point L1074(lines 1066 1085) the Hoare annotation is: false [2021-10-29 05:44:59,526 INFO L853 garLoopResultBuilder]: At program point L1074-1(lines 1066 1085) the Hoare annotation is: false [2021-10-29 05:44:59,526 INFO L853 garLoopResultBuilder]: At program point L1074-2(lines 1066 1085) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,526 INFO L853 garLoopResultBuilder]: At program point L1074-3(lines 1066 1085) the Hoare annotation is: false [2021-10-29 05:44:59,526 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,526 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,527 INFO L857 garLoopResultBuilder]: For program point L1339(lines 1339 1544) no Hoare annotation was computed. [2021-10-29 05:44:59,527 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,527 INFO L853 garLoopResultBuilder]: At program point L811(lines 798 831) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~DC~0)) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse6 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse7 (<= 7 ~IPC~0)) (.cse8 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse1 (not (= ~SKIP2~0 2))) (.cse9 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse5 (= 2 ~DC~0)) (.cse11 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse14 (<= ULTIMATE.start_main_~status~1 258)) (.cse16 (or (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse12) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse5 .cse11 .cse12))) (.cse13 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse17 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (not .cse3)) (.cse18 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse19 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse20 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse1 .cse5 (= ~pended~0 1) .cse4) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4) (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse1 .cse9 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse13 .cse14 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse15 .cse16 .cse17 .cse18 .cse19 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse20) (and (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) (or .cse14 (<= 260 ULTIMATE.start_main_~status~1)) (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse16 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse19 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258))) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse13 .cse9 .cse5 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse15 .cse17 .cse10 .cse18 .cse19 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse20 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse2 (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0))))) [2021-10-29 05:44:59,527 INFO L857 garLoopResultBuilder]: For program point L1472(lines 1472 1480) no Hoare annotation was computed. [2021-10-29 05:44:59,528 INFO L853 garLoopResultBuilder]: At program point L1340(lines 1330 1546) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,528 INFO L853 garLoopResultBuilder]: At program point L550-2(lines 550 566) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 .cse16 .cse17))))) [2021-10-29 05:44:59,528 INFO L853 garLoopResultBuilder]: At program point L418(lines 229 419) the Hoare annotation is: (let ((.cse2 (= 2 ~DC~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse11 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse13 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ~pended~0 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse16 (= ~s~0 ~DC~0)) (.cse3 (= ~pended~0 1)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse17 (= 2 ~s~0)) (.cse5 (not (= ~IPC~0 2))) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse6 .cse9) (and .cse10 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse1 .cse2 .cse4 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse12 .cse13 .cse7 .cse14 .cse15 .cse9) (and .cse1 .cse16 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse4 .cse17 .cse12 .cse7 .cse8 .cse14 .cse15) (and .cse10 .cse1 .cse16 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse4 .cse11 .cse17 .cse12 .cse13 .cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse8 .cse14 .cse15) (and (not (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp29~0)) .cse0 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6))) [2021-10-29 05:44:59,528 INFO L857 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2021-10-29 05:44:59,529 INFO L853 garLoopResultBuilder]: At program point L1079-1(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 05:44:59,529 INFO L857 garLoopResultBuilder]: For program point L1079-2(lines 1079 1083) no Hoare annotation was computed. [2021-10-29 05:44:59,529 INFO L853 garLoopResultBuilder]: At program point L1079-3(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 05:44:59,529 INFO L857 garLoopResultBuilder]: For program point L1079-4(lines 1079 1083) no Hoare annotation was computed. [2021-10-29 05:44:59,530 INFO L853 garLoopResultBuilder]: At program point L1079-5(lines 1079 1083) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,530 INFO L857 garLoopResultBuilder]: For program point L1079-6(lines 1079 1083) no Hoare annotation was computed. [2021-10-29 05:44:59,530 INFO L853 garLoopResultBuilder]: At program point L1079-7(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ~pended~0 0)))) [2021-10-29 05:44:59,530 INFO L853 garLoopResultBuilder]: At program point L551(lines 550 566) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 .cse16 .cse17))))) [2021-10-29 05:44:59,530 INFO L857 garLoopResultBuilder]: For program point L1476(lines 1476 1479) no Hoare annotation was computed. [2021-10-29 05:44:59,531 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,531 INFO L857 garLoopResultBuilder]: For program point L817(lines 817 829) no Hoare annotation was computed. [2021-10-29 05:44:59,531 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,531 INFO L857 garLoopResultBuilder]: For program point L1610(lines 1610 1616) no Hoare annotation was computed. [2021-10-29 05:44:59,531 INFO L853 garLoopResultBuilder]: At program point L157(lines 97 159) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= ~compRegistered~0 0))) (or (and .cse0 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse1 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse2 (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) .cse3) (and (not (= ~SKIP2~0 2)) .cse0 (= ~pended~0 1) .cse1 (not (= ~IPC~0 2)) .cse2 .cse3))) [2021-10-29 05:44:59,532 INFO L853 garLoopResultBuilder]: At program point L157-1(lines 97 159) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse1 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse2 .cse3 .cse4 .cse5 (<= 4 ~SKIP2~0) (= ~pended~0 0) .cse6) (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) .cse0 (= ~pended~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-29 05:44:59,532 INFO L857 garLoopResultBuilder]: For program point L818(lines 818 822) no Hoare annotation was computed. [2021-10-29 05:44:59,532 INFO L857 garLoopResultBuilder]: For program point L1348(lines 1348 1542) no Hoare annotation was computed. [2021-10-29 05:44:59,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,533 INFO L853 garLoopResultBuilder]: At program point L1484(lines 1348 1542) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,533 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,533 INFO L857 garLoopResultBuilder]: For program point L295-1(lines 229 417) no Hoare annotation was computed. [2021-10-29 05:44:59,533 INFO L857 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,533 INFO L857 garLoopResultBuilder]: For program point L956-2(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,533 INFO L857 garLoopResultBuilder]: For program point L956-4(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,533 INFO L857 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2021-10-29 05:44:59,534 INFO L857 garLoopResultBuilder]: For program point L956-6(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,534 INFO L857 garLoopResultBuilder]: For program point L956-8(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,534 INFO L857 garLoopResultBuilder]: For program point L956-10(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,534 INFO L857 garLoopResultBuilder]: For program point L956-12(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,534 INFO L857 garLoopResultBuilder]: For program point L956-14(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,534 INFO L857 garLoopResultBuilder]: For program point L956-16(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,535 INFO L857 garLoopResultBuilder]: For program point L956-18(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,535 INFO L857 garLoopResultBuilder]: For program point L956-20(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:44:59,535 INFO L857 garLoopResultBuilder]: For program point L562(lines 562 564) no Hoare annotation was computed. [2021-10-29 05:44:59,535 INFO L853 garLoopResultBuilder]: At program point L431(lines 160 433) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (<= 4 ~SKIP2~0)) (.cse9 (= ~pended~0 0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse11 (not (= ~SKIP2~0 2))) (.cse12 (= ~s~0 ~DC~0)) (.cse14 (= ~pended~0 1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (= 2 ~s~0)) (.cse15 (not (= ~IPC~0 2))) (.cse16 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse12 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse3 (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse4 .cse13 .cse5 .cse6 .cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse8 .cse9) (and .cse11 .cse1 .cse2 .cse14 .cse3 .cse15 (= ~IPC~0 ~s~0) .cse16) (and .cse11 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse12 .cse3 .cse13 .cse15 .cse9) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse11 .cse1 .cse2 .cse14 .cse3 .cse7 (<= (+ ~NP~0 4) ~MPR1~0) .cse16 .cse10) (and (not (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp29~0)) .cse11 .cse12 .cse14 .cse3 .cse13 .cse15 .cse16))) [2021-10-29 05:44:59,535 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,536 INFO L857 garLoopResultBuilder]: For program point L1357(lines 1357 1540) no Hoare annotation was computed. [2021-10-29 05:44:59,536 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,536 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 307) no Hoare annotation was computed. [2021-10-29 05:44:59,536 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,536 INFO L853 garLoopResultBuilder]: At program point L567(lines 528 593) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse18 (* 4294967296 .cse17))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse18 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse18 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse17 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse16))))) [2021-10-29 05:44:59,537 INFO L857 garLoopResultBuilder]: For program point L1362(lines 1362 1538) no Hoare annotation was computed. [2021-10-29 05:44:59,537 INFO L857 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,537 INFO L857 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,537 INFO L857 garLoopResultBuilder]: For program point L1627-2(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,537 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,537 INFO L857 garLoopResultBuilder]: For program point L1627-3(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,538 INFO L857 garLoopResultBuilder]: For program point L1627-4(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,538 INFO L857 garLoopResultBuilder]: For program point L1627-5(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,538 INFO L857 garLoopResultBuilder]: For program point L1627-6(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,538 INFO L857 garLoopResultBuilder]: For program point L1627-7(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,538 INFO L857 garLoopResultBuilder]: For program point L1627-8(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,538 INFO L857 garLoopResultBuilder]: For program point L1627-9(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,538 INFO L857 garLoopResultBuilder]: For program point L1627-10(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,539 INFO L857 garLoopResultBuilder]: For program point L1627-11(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,539 INFO L857 garLoopResultBuilder]: For program point L1627-12(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,539 INFO L857 garLoopResultBuilder]: For program point L1627-13(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,539 INFO L857 garLoopResultBuilder]: For program point L1627-14(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,539 INFO L857 garLoopResultBuilder]: For program point L1627-15(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,539 INFO L857 garLoopResultBuilder]: For program point L1627-16(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,539 INFO L857 garLoopResultBuilder]: For program point L1627-17(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,540 INFO L857 garLoopResultBuilder]: For program point L1627-18(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,540 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,540 INFO L857 garLoopResultBuilder]: For program point L1627-19(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,540 INFO L857 garLoopResultBuilder]: For program point L1627-20(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,540 INFO L857 garLoopResultBuilder]: For program point L1627-21(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,540 INFO L857 garLoopResultBuilder]: For program point L1627-22(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,541 INFO L857 garLoopResultBuilder]: For program point L1627-23(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,541 INFO L857 garLoopResultBuilder]: For program point L1627-24(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,541 INFO L857 garLoopResultBuilder]: For program point L1627-25(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,541 INFO L857 garLoopResultBuilder]: For program point L1627-26(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,541 INFO L857 garLoopResultBuilder]: For program point L1627-27(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,541 INFO L857 garLoopResultBuilder]: For program point L1627-28(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,541 INFO L857 garLoopResultBuilder]: For program point L1627-29(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,542 INFO L857 garLoopResultBuilder]: For program point L1627-30(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,542 INFO L853 garLoopResultBuilder]: At program point L1628(lines 1039 1052) the Hoare annotation is: (and (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,542 INFO L857 garLoopResultBuilder]: For program point L1627-31(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,542 INFO L853 garLoopResultBuilder]: At program point L1628-1(lines 1039 1052) the Hoare annotation is: (and (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,542 INFO L857 garLoopResultBuilder]: For program point L1627-32(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,542 INFO L853 garLoopResultBuilder]: At program point L1628-2(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,543 INFO L857 garLoopResultBuilder]: For program point L1627-33(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,543 INFO L853 garLoopResultBuilder]: At program point L1628-3(lines 1 1630) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,543 INFO L857 garLoopResultBuilder]: For program point L1627-34(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,543 INFO L853 garLoopResultBuilder]: At program point L1628-4(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,543 INFO L857 garLoopResultBuilder]: For program point L1627-35(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,543 INFO L853 garLoopResultBuilder]: At program point L1628-5(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,544 INFO L857 garLoopResultBuilder]: For program point L1627-36(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,544 INFO L857 garLoopResultBuilder]: For program point L1627-37(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,544 INFO L853 garLoopResultBuilder]: At program point L1628-7(lines 1 1630) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (<= 7 ~IPC~0)) (.cse2 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~pended~0 0)) (.cse7 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse5 (<= 4 ~SKIP2~0) .cse6 .cse7 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse1 (not (= ~SKIP2~0 2)) .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7))) [2021-10-29 05:44:59,544 INFO L857 garLoopResultBuilder]: For program point L1627-38(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,544 INFO L853 garLoopResultBuilder]: At program point L1628-8(lines 1 1630) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,545 INFO L857 garLoopResultBuilder]: For program point L1627-39(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,545 INFO L853 garLoopResultBuilder]: At program point L1628-9(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,545 INFO L857 garLoopResultBuilder]: For program point L1627-40(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,545 INFO L857 garLoopResultBuilder]: For program point L1627-41(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,545 INFO L853 garLoopResultBuilder]: At program point L1628-11(lines 1 1630) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (<= 7 ~IPC~0)) (.cse2 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~pended~0 0)) (.cse7 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse5 (<= 4 ~SKIP2~0) .cse6 .cse7 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse1 (not (= ~SKIP2~0 2)) .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7))) [2021-10-29 05:44:59,545 INFO L857 garLoopResultBuilder]: For program point L1627-42(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,546 INFO L857 garLoopResultBuilder]: For program point L1627-43(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,546 INFO L853 garLoopResultBuilder]: At program point L1628-13(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,546 INFO L857 garLoopResultBuilder]: For program point L1627-44(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,546 INFO L857 garLoopResultBuilder]: For program point L1627-45(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,546 INFO L857 garLoopResultBuilder]: For program point L1627-46(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,546 INFO L857 garLoopResultBuilder]: For program point L1627-47(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,547 INFO L853 garLoopResultBuilder]: At program point L1628-17(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 05:44:59,547 INFO L857 garLoopResultBuilder]: For program point L1627-48(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,547 INFO L857 garLoopResultBuilder]: For program point L1627-49(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,547 INFO L857 garLoopResultBuilder]: For program point L1627-50(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,547 INFO L853 garLoopResultBuilder]: At program point L1628-20(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 05:44:59,548 INFO L857 garLoopResultBuilder]: For program point L1627-51(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,548 INFO L857 garLoopResultBuilder]: For program point L1627-52(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,548 INFO L853 garLoopResultBuilder]: At program point L1628-22(lines 1039 1052) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (not (= ~SKIP2~0 2))) (.cse3 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse4 (= ~s~0 ~DC~0)) (.cse5 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (= 2 ~s~0)) (.cse9 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= (+ .cse19 1) 0)) (.cse12 (not (= ~IPC~0 2))) (.cse13 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse14 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (< 0 (+ .cse19 2))) (.cse17 (<= 4 ~SKIP2~0)) (.cse18 (= ~pended~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse16 .cse17 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse18) (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse16 .cse17 .cse18))))) [2021-10-29 05:44:59,548 INFO L853 garLoopResultBuilder]: At program point L1628-23(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,548 INFO L853 garLoopResultBuilder]: At program point L1628-25(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 05:44:59,549 INFO L853 garLoopResultBuilder]: At program point L1628-26(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,549 INFO L853 garLoopResultBuilder]: At program point L1628-28(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,549 INFO L853 garLoopResultBuilder]: At program point L1628-30(lines 1 1630) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ~pended~0 1)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~IPC~0 2)) (= ~IPC~0 ~s~0) .cse5) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) .cse5 (= ~SKIP2~0 ~s~0)))) [2021-10-29 05:44:59,549 INFO L853 garLoopResultBuilder]: At program point L1628-32(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,550 INFO L853 garLoopResultBuilder]: At program point L1628-34(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 05:44:59,550 INFO L853 garLoopResultBuilder]: At program point L1628-38(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 05:44:59,550 INFO L853 garLoopResultBuilder]: At program point L1628-41(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,550 INFO L853 garLoopResultBuilder]: At program point L1628-43(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 05:44:59,551 INFO L853 garLoopResultBuilder]: At program point L1628-44(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,551 INFO L853 garLoopResultBuilder]: At program point L1628-46(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 05:44:59,551 INFO L853 garLoopResultBuilder]: At program point L1628-47(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,551 INFO L853 garLoopResultBuilder]: At program point L1628-49(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 05:44:59,551 INFO L860 garLoopResultBuilder]: At program point L837(lines 667 839) the Hoare annotation is: true [2021-10-29 05:44:59,552 INFO L853 garLoopResultBuilder]: At program point L707(lines 701 838) the Hoare annotation is: (let ((.cse18 (= ~IPC~0 ~s~0)) (.cse16 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse20 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= 4 ~SKIP2~0)) (.cse14 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= 7 ~IPC~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse7 (= 2 ~DC~0)) (.cse21 (= ~pended~0 1)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse19 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse23 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 ~DC~0)) (.cse5 (= ~pended~0 0)) (.cse22 (= ~compRegistered~0 0))) (or (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse6 .cse1 .cse7 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse8 .cse9 .cse10 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse12 .cse5 .cse13 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse14 .cse15 .cse16 .cse0 .cse1 .cse7 .cse17 .cse18 .cse19 .cse5) (and .cse15 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse1 (or .cse20 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse11 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse19 .cse5) (and .cse0 .cse1 .cse7 .cse21 .cse4 .cse18 .cse22) (and .cse0 .cse2 .cse21 .cse3 .cse4 .cse22) (and .cse14 .cse15 .cse16 .cse1 .cse7 .cse17 .cse11 .cse19 .cse12 .cse5 .cse13) (and .cse23 .cse0 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5) (and .cse6 .cse15 .cse0 .cse20 .cse1 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse8 .cse3 .cse9 .cse4 .cse10 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse19 .cse12 .cse5) (and .cse0 .cse7 .cse21 .cse4 (= ~s~0 ~NP~0) .cse22) (and .cse14 .cse15 .cse0 .cse1 .cse7 .cse21 .cse11 .cse19 .cse22 .cse13) (and .cse23 .cse0 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4 .cse5) (and .cse2 (= ULTIMATE.start_main_~status~1 0) .cse5 .cse22))) [2021-10-29 05:44:59,552 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,552 INFO L857 garLoopResultBuilder]: For program point L1369(lines 1369 1536) no Hoare annotation was computed. [2021-10-29 05:44:59,552 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,553 INFO L853 garLoopResultBuilder]: At program point L974(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,553 INFO L853 garLoopResultBuilder]: At program point L974-1(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,553 INFO L853 garLoopResultBuilder]: At program point L974-2(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,553 INFO L853 garLoopResultBuilder]: At program point L974-3(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,553 INFO L853 garLoopResultBuilder]: At program point L974-4(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 05:44:59,554 INFO L853 garLoopResultBuilder]: At program point L974-5(lines 974 986) 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) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-29 05:44:59,554 INFO L853 garLoopResultBuilder]: At program point L974-6(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 05:44:59,554 INFO L853 garLoopResultBuilder]: At program point L974-7(lines 974 986) 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) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-29 05:44:59,554 INFO L853 garLoopResultBuilder]: At program point L974-8(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,555 INFO L853 garLoopResultBuilder]: At program point L974-9(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,555 INFO L853 garLoopResultBuilder]: At program point L974-10(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,555 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,555 INFO L853 garLoopResultBuilder]: At program point L974-11(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,555 INFO L853 garLoopResultBuilder]: At program point L974-12(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,556 INFO L853 garLoopResultBuilder]: At program point L974-13(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,556 INFO L853 garLoopResultBuilder]: At program point L974-14(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 05:44:59,556 INFO L853 garLoopResultBuilder]: At program point L974-15(lines 974 986) 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) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-29 05:44:59,556 INFO L853 garLoopResultBuilder]: At program point L974-16(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,556 INFO L853 garLoopResultBuilder]: At program point L974-17(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,557 INFO L853 garLoopResultBuilder]: At program point L974-18(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,557 INFO L853 garLoopResultBuilder]: At program point L974-19(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,557 INFO L853 garLoopResultBuilder]: At program point L974-20(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,557 INFO L853 garLoopResultBuilder]: At program point L974-21(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,557 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,558 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,558 INFO L857 garLoopResultBuilder]: For program point L1376(lines 1376 1534) no Hoare annotation was computed. [2021-10-29 05:44:59,558 INFO L857 garLoopResultBuilder]: For program point L319(lines 319 331) no Hoare annotation was computed. [2021-10-29 05:44:59,558 INFO L857 garLoopResultBuilder]: For program point L980(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,558 INFO L857 garLoopResultBuilder]: For program point L980-2(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,558 INFO L857 garLoopResultBuilder]: For program point L980-4(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,559 INFO L857 garLoopResultBuilder]: For program point L980-6(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,559 INFO L857 garLoopResultBuilder]: For program point L980-8(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,559 INFO L857 garLoopResultBuilder]: For program point L980-10(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,559 INFO L857 garLoopResultBuilder]: For program point L980-12(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,559 INFO L857 garLoopResultBuilder]: For program point L980-14(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,559 INFO L857 garLoopResultBuilder]: For program point L980-16(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,559 INFO L857 garLoopResultBuilder]: For program point L980-18(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,560 INFO L857 garLoopResultBuilder]: For program point L980-20(lines 980 984) no Hoare annotation was computed. [2021-10-29 05:44:59,560 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-29 05:44:59,560 INFO L857 garLoopResultBuilder]: For program point L324(lines 324 330) no Hoare annotation was computed. [2021-10-29 05:44:59,560 INFO L853 garLoopResultBuilder]: At program point L324-1(lines 1 1630) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 05:44:59,560 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,560 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,561 INFO L857 garLoopResultBuilder]: For program point L1383(lines 1383 1532) no Hoare annotation was computed. [2021-10-29 05:44:59,561 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,561 INFO L853 garLoopResultBuilder]: At program point L1384(lines 1376 1534) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,561 INFO L857 garLoopResultBuilder]: For program point L198(lines 198 206) no Hoare annotation was computed. [2021-10-29 05:44:59,561 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,561 INFO L853 garLoopResultBuilder]: At program point L730(lines 730 778) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,562 INFO L853 garLoopResultBuilder]: At program point L1526(lines 1401 1527) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~s~0 ~NP~0)) (.cse5 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~pended~0 0)) (.cse4 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= ~IPC~0 2)) .cse3 .cse4) (and .cse1 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse2 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse3 (<= (+ 2 ~NP~0) ~SKIP1~0) .cse5 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259)) .cse6 (<= 4 ~SKIP2~0) .cse7 .cse4) (and (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= (+ ~NP~0 4) ~MPR1~0) .cse7 .cse4 (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 0)))) [2021-10-29 05:44:59,562 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,562 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,562 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,562 INFO L853 garLoopResultBuilder]: At program point L735(lines 735 777) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,563 INFO L853 garLoopResultBuilder]: At program point L207(lines 207 426) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,563 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,563 INFO L857 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2021-10-29 05:44:59,563 INFO L857 garLoopResultBuilder]: For program point L340-2(lines 340 345) no Hoare annotation was computed. [2021-10-29 05:44:59,563 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,563 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 425) no Hoare annotation was computed. [2021-10-29 05:44:59,564 INFO L853 garLoopResultBuilder]: At program point L1400(lines 1390 1530) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,564 INFO L853 garLoopResultBuilder]: At program point L740(lines 740 776) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,564 INFO L857 garLoopResultBuilder]: For program point L213(lines 213 424) no Hoare annotation was computed. [2021-10-29 05:44:59,564 INFO L853 garLoopResultBuilder]: At program point L214(lines 210 425) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,564 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 423) no Hoare annotation was computed. [2021-10-29 05:44:59,564 INFO L853 garLoopResultBuilder]: At program point L1009(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,565 INFO L853 garLoopResultBuilder]: At program point L1009-1(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,565 INFO L853 garLoopResultBuilder]: At program point L1009-2(lines 973 1037) 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) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-29 05:44:59,565 INFO L853 garLoopResultBuilder]: At program point L1009-3(lines 973 1037) 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) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-29 05:44:59,565 INFO L853 garLoopResultBuilder]: At program point L1009-4(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,566 INFO L853 garLoopResultBuilder]: At program point L1009-5(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,566 INFO L853 garLoopResultBuilder]: At program point L1009-6(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,566 INFO L853 garLoopResultBuilder]: At program point L1009-7(lines 973 1037) 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) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-29 05:44:59,566 INFO L853 garLoopResultBuilder]: At program point L745(lines 745 775) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,566 INFO L853 garLoopResultBuilder]: At program point L1009-8(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,567 INFO L853 garLoopResultBuilder]: At program point L1009-9(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,567 INFO L853 garLoopResultBuilder]: At program point L1009-10(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,567 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,567 INFO L853 garLoopResultBuilder]: At program point L85(lines 707 779) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (not (= 2 ~s~0)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,567 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,568 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-29 05:44:59,568 INFO L857 garLoopResultBuilder]: For program point L1275(lines 1275 1287) no Hoare annotation was computed. [2021-10-29 05:44:59,568 INFO L857 garLoopResultBuilder]: For program point L1275-2(lines 1274 1563) no Hoare annotation was computed. [2021-10-29 05:44:59,568 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,568 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 422) no Hoare annotation was computed. [2021-10-29 05:44:59,568 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,569 INFO L853 garLoopResultBuilder]: At program point L220(lines 216 423) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,569 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,569 INFO L853 garLoopResultBuilder]: At program point L222(lines 222 421) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,569 INFO L857 garLoopResultBuilder]: For program point L1280(lines 1280 1285) no Hoare annotation was computed. [2021-10-29 05:44:59,569 INFO L857 garLoopResultBuilder]: For program point L1017(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,569 INFO L857 garLoopResultBuilder]: For program point L1017-1(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,569 INFO L857 garLoopResultBuilder]: For program point L1017-2(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,570 INFO L857 garLoopResultBuilder]: For program point L1017-3(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,570 INFO L857 garLoopResultBuilder]: For program point L1017-4(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,570 INFO L857 garLoopResultBuilder]: For program point L1017-5(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,570 INFO L857 garLoopResultBuilder]: For program point L1017-6(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,570 INFO L857 garLoopResultBuilder]: For program point L1017-7(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,570 INFO L857 garLoopResultBuilder]: For program point L1017-8(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,570 INFO L857 garLoopResultBuilder]: For program point L1017-9(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,571 INFO L857 garLoopResultBuilder]: For program point L1017-10(lines 1017 1034) no Hoare annotation was computed. [2021-10-29 05:44:59,571 INFO L853 garLoopResultBuilder]: At program point L225(lines 225 420) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,571 INFO L857 garLoopResultBuilder]: For program point L491(lines 491 503) no Hoare annotation was computed. [2021-10-29 05:44:59,571 INFO L857 garLoopResultBuilder]: For program point L360(lines 360 366) no Hoare annotation was computed. [2021-10-29 05:44:59,571 INFO L853 garLoopResultBuilder]: At program point L228(lines 227 420) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 05:44:59,571 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,572 INFO L857 garLoopResultBuilder]: For program point L627(lines 627 629) no Hoare annotation was computed. [2021-10-29 05:44:59,572 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,572 INFO L857 garLoopResultBuilder]: For program point L496(lines 496 502) no Hoare annotation was computed. [2021-10-29 05:44:59,572 INFO L853 garLoopResultBuilder]: At program point L496-1(lines 1 1630) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 05:44:59,572 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,572 INFO L857 garLoopResultBuilder]: For program point L1554(lines 1554 1560) no Hoare annotation was computed. [2021-10-29 05:44:59,573 INFO L853 garLoopResultBuilder]: At program point L1554-1(lines 1554 1560) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse5 (not (= ~IPC~0 2))) (.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= ~s~0 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= 2 ~s~0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= 2 ~DC~0) .cse2 .cse3 .cse5 (= ~s~0 ~NP~0) .cse6) (and (<= 7 ~IPC~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 (<= (+ 5 ~NP~0) ~MPR3~0) .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~pended~0 0) .cse6))) [2021-10-29 05:44:59,573 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-29 05:44:59,573 INFO L857 garLoopResultBuilder]: For program point L1026(lines 1026 1033) no Hoare annotation was computed. [2021-10-29 05:44:59,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:44:59,579 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:44:59,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:44:59 BoogieIcfgContainer [2021-10-29 05:44:59,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:44:59,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:44:59,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:44:59,670 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:44:59,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:44:36" (3/4) ... [2021-10-29 05:44:59,673 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 05:44:59,714 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 278 nodes and edges [2021-10-29 05:44:59,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 89 nodes and edges [2021-10-29 05:44:59,726 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-10-29 05:44:59,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-29 05:44:59,764 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-29 05:44:59,764 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-29 05:44:59,764 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 == s) && !(MPR3 == s))) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && !(MPR3 == s))) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0)) || ((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2))) || ((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) [2021-10-29 05:44:59,764 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || (((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2))) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && !(2 == s)) && lowerDriverReturn == status) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || ((((((((((returnVal2 <= lowerDriverReturn && status <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2)) || (((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258))) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && lowerDriverReturn <= status)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-29 05:44:59,769 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || ((((((((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2) && pended == 0)) || (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) [2021-10-29 05:44:59,773 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) [2021-10-29 05:44:59,778 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) || (((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && !(ntStatus == 259)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) && ntStatus <= 0) [2021-10-29 05:44:59,779 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || (((((((((\result + 1073741536 <= 0 && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) [2021-10-29 05:44:59,781 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) [2021-10-29 05:44:59,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && status <= 258) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && status <= 258) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-29 05:44:59,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 [2021-10-29 05:44:59,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 [2021-10-29 05:44:59,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-29 05:44:59,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-29 05:44:59,996 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:44:59,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:44:59,998 INFO L168 Benchmark]: Toolchain (without parser) took 27361.57 ms. Allocated memory was 115.3 MB in the beginning and 343.9 MB in the end (delta: 228.6 MB). Free memory was 79.5 MB in the beginning and 161.2 MB in the end (delta: -81.6 MB). Peak memory consumption was 145.8 MB. Max. memory is 16.1 GB. [2021-10-29 05:44:59,999 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 88.1 MB. Free memory was 58.1 MB in the beginning and 58.1 MB in the end (delta: 32.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:45:00,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.81 ms. Allocated memory is still 115.3 MB. Free memory was 79.3 MB in the beginning and 78.4 MB in the end (delta: 883.9 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:45:00,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.10 ms. Allocated memory is still 115.3 MB. Free memory was 78.4 MB in the beginning and 68.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:45:00,002 INFO L168 Benchmark]: Boogie Preprocessor took 126.84 ms. Allocated memory is still 115.3 MB. Free memory was 68.0 MB in the beginning and 61.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:45:00,002 INFO L168 Benchmark]: RCFGBuilder took 2934.45 ms. Allocated memory was 115.3 MB in the beginning and 163.6 MB in the end (delta: 48.2 MB). Free memory was 61.0 MB in the beginning and 71.6 MB in the end (delta: -10.6 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:45:00,003 INFO L168 Benchmark]: TraceAbstraction took 23170.85 ms. Allocated memory was 163.6 MB in the beginning and 343.9 MB in the end (delta: 180.4 MB). Free memory was 70.6 MB in the beginning and 210.5 MB in the end (delta: -139.9 MB). Peak memory consumption was 157.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:45:00,003 INFO L168 Benchmark]: Witness Printer took 326.94 ms. Allocated memory is still 343.9 MB. Free memory was 210.5 MB in the beginning and 161.2 MB in the end (delta: 49.3 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:45:00,006 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.34 ms. Allocated memory is still 88.1 MB. Free memory was 58.1 MB in the beginning and 58.1 MB in the end (delta: 32.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 670.81 ms. Allocated memory is still 115.3 MB. Free memory was 79.3 MB in the beginning and 78.4 MB in the end (delta: 883.9 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 122.10 ms. Allocated memory is still 115.3 MB. Free memory was 78.4 MB in the beginning and 68.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 126.84 ms. Allocated memory is still 115.3 MB. Free memory was 68.0 MB in the beginning and 61.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2934.45 ms. Allocated memory was 115.3 MB in the beginning and 163.6 MB in the end (delta: 48.2 MB). Free memory was 61.0 MB in the beginning and 71.6 MB in the end (delta: -10.6 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23170.85 ms. Allocated memory was 163.6 MB in the beginning and 343.9 MB in the end (delta: 180.4 MB). Free memory was 70.6 MB in the beginning and 210.5 MB in the end (delta: -139.9 MB). Peak memory consumption was 157.1 MB. Max. memory is 16.1 GB. * Witness Printer took 326.94 ms. Allocated memory is still 343.9 MB. Free memory was 210.5 MB in the beginning and 161.2 MB in the end (delta: 49.3 MB). Peak memory consumption was 48.2 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: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: 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, 351 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11730 SDtfs, 7663 SDslu, 14234 SDs, 0 SdLazy, 3717 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=3, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 48 MinimizatonAttempts, 658 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 114 LocationsWithAnnotation, 114 PreInvPairs, 348 NumberOfFragments, 8598 HoareAnnotationTreeSize, 114 FomulaSimplifications, 2854397 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 114 FomulaSimplificationsInter, 515337 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1259 ConstructedInterpolants, 0 QuantifiedInterpolants, 3493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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 53 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: (((((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 == s) && !(MPR3 == s))) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && !(MPR3 == s))) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0)) || ((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2))) || ((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1321]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((((((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((((((((returnVal2 <= lowerDriverReturn && lowerDriverReturn <= ntStatus) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && ntStatus <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || (((((((((5 + NP <= MPR3 && s == DC) && ntStatus + 1073741823 == 0) && status == 0) && 2 == s) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= ntStatus) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && ntStatus <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && (259 == __cil_tmp30 || ntStatus <= 258)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1401]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) || (((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && !(ntStatus == 259)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) && ntStatus <= 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: ((((((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && !(2 == s)) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 2 + s <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 724]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) || ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 740]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 730]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((s == DC && status == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1390]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || (((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2))) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && !(2 == s)) && lowerDriverReturn == status) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || ((((((((((returnVal2 <= lowerDriverReturn && status <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2)) || (((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258))) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && lowerDriverReturn <= status)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 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: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((s == DC && status == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: ((((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || (((((((((\result + 1073741536 <= 0 && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && status <= 258) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && status <= 258) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1554]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1376]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 735]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || ((((((((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2) && pended == 0)) || (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && (ntStatus <= 258 || 259 == __cil_tmp11)) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: ((((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2021-10-29 05:45:00,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ed93f9d-a45a-4c4f-9e65-53b983412743/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...