./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI --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 bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 04:04:55,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:04:55,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:04:55,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:04:55,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:04:55,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:04:55,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:04:55,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:04:55,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:04:55,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:04:55,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:04:55,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:04:55,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:04:55,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:04:55,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:04:55,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:04:55,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:04:55,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:04:55,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:04:55,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:04:55,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:04:55,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:04:55,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:04:55,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:04:55,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:04:55,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:04:55,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:04:55,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:04:55,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:04:55,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:04:55,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:04:55,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:04:55,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:04:55,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:04:55,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:04:55,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:04:55,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:04:55,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:04:55,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:04:55,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:04:55,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:04:55,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 04:04:55,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:04:55,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:04:55,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:04:55,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:04:55,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:04:55,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:04:55,868 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:04:55,869 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:04:55,869 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:04:55,869 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:04:55,870 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:04:55,870 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:04:55,870 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:04:55,871 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:04:55,871 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:04:55,872 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:04:55,872 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:04:55,872 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:04:55,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:04:55,874 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:04:55,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:04:55,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:04:55,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:04:55,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:04:55,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:04:55,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:04:55,876 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:04:55,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:04:55,877 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:04:55,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:04:55,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:04:55,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:04:55,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:04:55,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:04:55,879 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:04:55,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:04:55,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:04:55,880 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:04:55,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:04:55,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:04:55,881 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:04:55,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/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_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI 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 -> bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec [2022-11-03 04:04:56,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:04:56,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:04:56,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:04:56,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:04:56,242 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:04:56,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-11-03 04:04:56,339 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/data/c6ce7f031/35c01a55acec436dacff65655c46087a/FLAG770d40b5c [2022-11-03 04:04:57,013 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:04:57,014 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-11-03 04:04:57,036 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/data/c6ce7f031/35c01a55acec436dacff65655c46087a/FLAG770d40b5c [2022-11-03 04:04:57,271 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/data/c6ce7f031/35c01a55acec436dacff65655c46087a [2022-11-03 04:04:57,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:04:57,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:04:57,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:04:57,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:04:57,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:04:57,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:57,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a10f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57, skipping insertion in model container [2022-11-03 04:04:57,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:57,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:04:57,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:04:57,753 WARN L230 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_dbe7875f-1414-4ee0-9252-f47a34412d31/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-11-03 04:04:57,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:04:57,767 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:04:57,842 WARN L230 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_dbe7875f-1414-4ee0-9252-f47a34412d31/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-11-03 04:04:57,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:04:57,883 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:04:57,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57 WrapperNode [2022-11-03 04:04:57,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:04:57,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:04:57,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:04:57,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:04:57,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:57,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:57,987 INFO L138 Inliner]: procedures = 29, calls = 43, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 662 [2022-11-03 04:04:57,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:04:57,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:04:57,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:04:57,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:04:57,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:57,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:58,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:58,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:58,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:58,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:58,026 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:58,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:58,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:04:58,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:04:58,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:04:58,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:04:58,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (1/1) ... [2022-11-03 04:04:58,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:04:58,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:58,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:04:58,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:04:58,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:04:58,128 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-11-03 04:04:58,129 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-11-03 04:04:58,129 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-03 04:04:58,129 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-03 04:04:58,129 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-11-03 04:04:58,130 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-11-03 04:04:58,130 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-03 04:04:58,130 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-03 04:04:58,130 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-03 04:04:58,131 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-03 04:04:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:04:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-03 04:04:58,131 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-03 04:04:58,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:04:58,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:04:58,132 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-11-03 04:04:58,132 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-11-03 04:04:58,284 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:04:58,286 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:04:58,482 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:04:58,489 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:04:58,492 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:04:58,497 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:04:58,507 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:04:59,045 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-11-03 04:04:59,045 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-11-03 04:04:59,046 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-11-03 04:04:59,046 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-11-03 04:04:59,046 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-11-03 04:04:59,046 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-11-03 04:04:59,046 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-11-03 04:04:59,047 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-11-03 04:04:59,048 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-11-03 04:04:59,049 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-11-03 04:04:59,062 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:04:59,092 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-11-03 04:04:59,092 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-11-03 04:04:59,103 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:04:59,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:04:59,355 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 04:04:59,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:04:59 BoogieIcfgContainer [2022-11-03 04:04:59,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:04:59,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:04:59,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:04:59,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:04:59,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:04:57" (1/3) ... [2022-11-03 04:04:59,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adc65e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:04:59, skipping insertion in model container [2022-11-03 04:04:59,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:57" (2/3) ... [2022-11-03 04:04:59,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adc65e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:04:59, skipping insertion in model container [2022-11-03 04:04:59,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:04:59" (3/3) ... [2022-11-03 04:04:59,373 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-11-03 04:04:59,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:04:59,394 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 04:04:59,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:04:59,461 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f24e59a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:04:59,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 04:04:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 99 states have (on average 1.606060606060606) internal successors, (159), 116 states have internal predecessors, (159), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-03 04:04:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:04:59,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:59,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:59,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1069953189, now seen corresponding path program 1 times [2022-11-03 04:04:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:59,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090257791] [2022-11-03 04:04:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:59,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:59,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090257791] [2022-11-03 04:04:59,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090257791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:59,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:59,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:04:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351188221] [2022-11-03 04:04:59,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:59,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:59,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:59,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:59,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:59,794 INFO L87 Difference]: Start difference. First operand has 136 states, 99 states have (on average 1.606060606060606) internal successors, (159), 116 states have internal predecessors, (159), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:00,108 INFO L93 Difference]: Finished difference Result 252 states and 394 transitions. [2022-11-03 04:05:00,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:00,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 04:05:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:00,133 INFO L225 Difference]: With dead ends: 252 [2022-11-03 04:05:00,133 INFO L226 Difference]: Without dead ends: 144 [2022-11-03 04:05:00,140 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:00,145 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 73 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:00,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 228 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:05:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-03 04:05:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2022-11-03 04:05:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 117 states have internal predecessors, (153), 25 states have call successors, (25), 11 states have call predecessors, (25), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-03 04:05:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2022-11-03 04:05:00,214 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 10 [2022-11-03 04:05:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:00,214 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2022-11-03 04:05:00,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2022-11-03 04:05:00,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:05:00,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:00,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:00,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:05:00,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:00,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1665386427, now seen corresponding path program 1 times [2022-11-03 04:05:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:00,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318017332] [2022-11-03 04:05:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:00,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:00,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318017332] [2022-11-03 04:05:00,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318017332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:00,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:00,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201364262] [2022-11-03 04:05:00,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:00,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:00,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:00,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:00,330 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:00,447 INFO L93 Difference]: Finished difference Result 227 states and 307 transitions. [2022-11-03 04:05:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:00,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 04:05:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:00,455 INFO L225 Difference]: With dead ends: 227 [2022-11-03 04:05:00,455 INFO L226 Difference]: Without dead ends: 173 [2022-11-03 04:05:00,456 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:00,457 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 142 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:00,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 192 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-03 04:05:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2022-11-03 04:05:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 125 states have (on average 1.376) internal successors, (172), 130 states have internal predecessors, (172), 21 states have call successors, (21), 11 states have call predecessors, (21), 8 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2022-11-03 04:05:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 210 transitions. [2022-11-03 04:05:00,485 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 210 transitions. Word has length 11 [2022-11-03 04:05:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:00,485 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 210 transitions. [2022-11-03 04:05:00,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 210 transitions. [2022-11-03 04:05:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:05:00,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:00,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:00,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:05:00,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1334442572, now seen corresponding path program 1 times [2022-11-03 04:05:00,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:00,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829090527] [2022-11-03 04:05:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:00,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:00,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:00,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829090527] [2022-11-03 04:05:00,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829090527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:00,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:00,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533965044] [2022-11-03 04:05:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:00,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:00,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:00,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:00,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:00,567 INFO L87 Difference]: Start difference. First operand 155 states and 210 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:00,633 INFO L93 Difference]: Finished difference Result 169 states and 227 transitions. [2022-11-03 04:05:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:00,634 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 04:05:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:00,636 INFO L225 Difference]: With dead ends: 169 [2022-11-03 04:05:00,636 INFO L226 Difference]: Without dead ends: 155 [2022-11-03 04:05:00,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:00,645 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 76 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:00,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 200 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:05:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-03 04:05:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-11-03 04:05:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 125 states have (on average 1.368) internal successors, (171), 130 states have internal predecessors, (171), 21 states have call successors, (21), 11 states have call predecessors, (21), 8 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2022-11-03 04:05:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 209 transitions. [2022-11-03 04:05:00,675 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 209 transitions. Word has length 11 [2022-11-03 04:05:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:00,675 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 209 transitions. [2022-11-03 04:05:00,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2022-11-03 04:05:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:05:00,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:00,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:00,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 04:05:00,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:00,686 INFO L85 PathProgramCache]: Analyzing trace with hash -929395180, now seen corresponding path program 1 times [2022-11-03 04:05:00,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:00,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139154034] [2022-11-03 04:05:00,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:00,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:00,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:00,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139154034] [2022-11-03 04:05:00,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139154034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:00,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:00,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361183466] [2022-11-03 04:05:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:00,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:00,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:00,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:00,791 INFO L87 Difference]: Start difference. First operand 155 states and 209 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:00,919 INFO L93 Difference]: Finished difference Result 158 states and 211 transitions. [2022-11-03 04:05:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:05:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:00,922 INFO L225 Difference]: With dead ends: 158 [2022-11-03 04:05:00,922 INFO L226 Difference]: Without dead ends: 154 [2022-11-03 04:05:00,922 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:00,924 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 13 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:00,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 218 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-03 04:05:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-03 04:05:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 125 states have (on average 1.352) internal successors, (169), 129 states have internal predecessors, (169), 20 states have call successors, (20), 11 states have call predecessors, (20), 8 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2022-11-03 04:05:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 206 transitions. [2022-11-03 04:05:00,943 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 206 transitions. Word has length 16 [2022-11-03 04:05:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:00,943 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 206 transitions. [2022-11-03 04:05:00,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 206 transitions. [2022-11-03 04:05:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 04:05:00,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:00,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:00,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 04:05:00,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2078191330, now seen corresponding path program 1 times [2022-11-03 04:05:00,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:00,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804762927] [2022-11-03 04:05:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:01,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:01,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804762927] [2022-11-03 04:05:01,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804762927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:01,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:01,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365620336] [2022-11-03 04:05:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:01,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:05:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:05:01,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:05:01,144 INFO L87 Difference]: Start difference. First operand 154 states and 206 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:01,370 INFO L93 Difference]: Finished difference Result 183 states and 243 transitions. [2022-11-03 04:05:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:05:01,371 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 04:05:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:01,373 INFO L225 Difference]: With dead ends: 183 [2022-11-03 04:05:01,373 INFO L226 Difference]: Without dead ends: 154 [2022-11-03 04:05:01,374 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:01,375 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 163 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:01,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 179 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:05:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-03 04:05:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-03 04:05:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 125 states have (on average 1.336) internal successors, (167), 129 states have internal predecessors, (167), 20 states have call successors, (20), 11 states have call predecessors, (20), 8 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2022-11-03 04:05:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 204 transitions. [2022-11-03 04:05:01,406 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 204 transitions. Word has length 22 [2022-11-03 04:05:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:01,407 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 204 transitions. [2022-11-03 04:05:01,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2022-11-03 04:05:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:05:01,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:01,408 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:01,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 04:05:01,409 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash -46672306, now seen corresponding path program 1 times [2022-11-03 04:05:01,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:01,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503749682] [2022-11-03 04:05:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:01,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:01,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:01,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503749682] [2022-11-03 04:05:01,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503749682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:01,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:01,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:01,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033389240] [2022-11-03 04:05:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:01,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:05:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:01,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:05:01,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:05:01,533 INFO L87 Difference]: Start difference. First operand 154 states and 204 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:01,720 INFO L93 Difference]: Finished difference Result 183 states and 241 transitions. [2022-11-03 04:05:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:05:01,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 04:05:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:01,722 INFO L225 Difference]: With dead ends: 183 [2022-11-03 04:05:01,722 INFO L226 Difference]: Without dead ends: 154 [2022-11-03 04:05:01,723 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:01,724 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 162 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:01,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 186 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-03 04:05:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-03 04:05:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 125 states have (on average 1.32) internal successors, (165), 129 states have internal predecessors, (165), 20 states have call successors, (20), 11 states have call predecessors, (20), 8 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2022-11-03 04:05:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 202 transitions. [2022-11-03 04:05:01,746 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 202 transitions. Word has length 23 [2022-11-03 04:05:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:01,747 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 202 transitions. [2022-11-03 04:05:01,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 202 transitions. [2022-11-03 04:05:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:05:01,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:01,749 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:01,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 04:05:01,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1411188493, now seen corresponding path program 1 times [2022-11-03 04:05:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:01,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331559678] [2022-11-03 04:05:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:01,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:01,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331559678] [2022-11-03 04:05:01,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331559678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:01,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:01,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:05:01,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084724678] [2022-11-03 04:05:01,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:01,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:05:01,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:01,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:05:01,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:05:01,801 INFO L87 Difference]: Start difference. First operand 154 states and 202 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 04:05:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:01,947 INFO L93 Difference]: Finished difference Result 192 states and 244 transitions. [2022-11-03 04:05:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:05:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-11-03 04:05:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:01,949 INFO L225 Difference]: With dead ends: 192 [2022-11-03 04:05:01,949 INFO L226 Difference]: Without dead ends: 153 [2022-11-03 04:05:01,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:05:01,950 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 179 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:01,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 279 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-03 04:05:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 138. [2022-11-03 04:05:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 115 states have internal predecessors, (144), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-03 04:05:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 176 transitions. [2022-11-03 04:05:01,969 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 176 transitions. Word has length 24 [2022-11-03 04:05:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:01,970 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 176 transitions. [2022-11-03 04:05:01,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 04:05:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 176 transitions. [2022-11-03 04:05:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:05:01,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:01,971 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:01,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 04:05:01,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1213163261, now seen corresponding path program 1 times [2022-11-03 04:05:01,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:01,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118318286] [2022-11-03 04:05:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:01,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:02,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:02,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118318286] [2022-11-03 04:05:02,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118318286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:02,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:02,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412485235] [2022-11-03 04:05:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:02,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:02,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:02,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:02,017 INFO L87 Difference]: Start difference. First operand 138 states and 176 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:02,096 INFO L93 Difference]: Finished difference Result 147 states and 187 transitions. [2022-11-03 04:05:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:02,097 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 04:05:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:02,098 INFO L225 Difference]: With dead ends: 147 [2022-11-03 04:05:02,098 INFO L226 Difference]: Without dead ends: 46 [2022-11-03 04:05:02,098 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:02,099 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:02,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 126 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-03 04:05:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-03 04:05:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:05:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-11-03 04:05:02,106 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 24 [2022-11-03 04:05:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:02,107 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-11-03 04:05:02,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-11-03 04:05:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 04:05:02,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:02,108 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:02,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 04:05:02,108 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1250659667, now seen corresponding path program 1 times [2022-11-03 04:05:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:02,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752410011] [2022-11-03 04:05:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:02,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:02,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752410011] [2022-11-03 04:05:02,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752410011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:02,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:02,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529907976] [2022-11-03 04:05:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:02,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:02,148 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 04:05:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:02,184 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-11-03 04:05:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:02,184 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-03 04:05:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:02,185 INFO L225 Difference]: With dead ends: 63 [2022-11-03 04:05:02,185 INFO L226 Difference]: Without dead ends: 44 [2022-11-03 04:05:02,185 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:02,186 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:02,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:05:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-03 04:05:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-03 04:05:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:05:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-03 04:05:02,193 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 28 [2022-11-03 04:05:02,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:02,193 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-03 04:05:02,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 04:05:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-03 04:05:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 04:05:02,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:02,194 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:02,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 04:05:02,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash 482144993, now seen corresponding path program 1 times [2022-11-03 04:05:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:02,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601302329] [2022-11-03 04:05:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:02,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601302329] [2022-11-03 04:05:02,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601302329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:02,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:02,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930542358] [2022-11-03 04:05:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:02,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:02,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:02,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:02,234 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 04:05:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:02,269 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-11-03 04:05:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:02,270 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-03 04:05:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:02,271 INFO L225 Difference]: With dead ends: 56 [2022-11-03 04:05:02,271 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 04:05:02,271 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:02,272 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:02,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:05:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 04:05:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2022-11-03 04:05:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:05:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-11-03 04:05:02,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 29 [2022-11-03 04:05:02,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:02,279 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-11-03 04:05:02,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 04:05:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-11-03 04:05:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:05:02,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:02,280 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:02,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 04:05:02,280 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash -692307987, now seen corresponding path program 1 times [2022-11-03 04:05:02,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:02,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266937382] [2022-11-03 04:05:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:02,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:02,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266937382] [2022-11-03 04:05:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266937382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:02,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:02,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:05:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778606772] [2022-11-03 04:05:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:02,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:05:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:05:02,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:05:02,402 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 04:05:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:02,446 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-11-03 04:05:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:05:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-03 04:05:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:02,448 INFO L225 Difference]: With dead ends: 65 [2022-11-03 04:05:02,448 INFO L226 Difference]: Without dead ends: 44 [2022-11-03 04:05:02,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:05:02,449 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:02,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 126 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:05:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-03 04:05:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-03 04:05:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:05:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-03 04:05:02,455 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 30 [2022-11-03 04:05:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:02,455 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-03 04:05:02,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 04:05:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-03 04:05:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 04:05:02,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:02,456 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:02,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 04:05:02,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1297164998, now seen corresponding path program 1 times [2022-11-03 04:05:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:02,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027922150] [2022-11-03 04:05:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:02,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027922150] [2022-11-03 04:05:02,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027922150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:02,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:02,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:05:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186887609] [2022-11-03 04:05:02,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:02,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:05:02,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:02,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:05:02,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:05:02,550 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:05:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:02,625 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-11-03 04:05:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:05:02,626 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), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-11-03 04:05:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:02,626 INFO L225 Difference]: With dead ends: 63 [2022-11-03 04:05:02,626 INFO L226 Difference]: Without dead ends: 44 [2022-11-03 04:05:02,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:05:02,627 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 33 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:02,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 67 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-03 04:05:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-03 04:05:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:05:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-11-03 04:05:02,635 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 34 [2022-11-03 04:05:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:02,636 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-11-03 04:05:02,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:05:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-11-03 04:05:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:05:02,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:02,637 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:02,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 04:05:02,637 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1488217942, now seen corresponding path program 1 times [2022-11-03 04:05:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:02,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469227633] [2022-11-03 04:05:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:03,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:03,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469227633] [2022-11-03 04:05:03,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469227633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:03,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:03,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 04:05:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001812974] [2022-11-03 04:05:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:03,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 04:05:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 04:05:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:05:03,033 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:05:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:03,293 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-11-03 04:05:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:05:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-03 04:05:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:03,294 INFO L225 Difference]: With dead ends: 51 [2022-11-03 04:05:03,294 INFO L226 Difference]: Without dead ends: 44 [2022-11-03 04:05:03,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:05:03,295 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:03,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 39 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-03 04:05:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-03 04:05:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:05:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2022-11-03 04:05:03,304 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2022-11-03 04:05:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:03,304 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2022-11-03 04:05:03,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:05:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-11-03 04:05:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:05:03,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:03,306 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:03,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 04:05:03,306 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1027817967, now seen corresponding path program 1 times [2022-11-03 04:05:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:03,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844416034] [2022-11-03 04:05:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:03,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:03,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:03,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844416034] [2022-11-03 04:05:03,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844416034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:03,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:03,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:03,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091789795] [2022-11-03 04:05:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:03,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:03,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:03,350 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:05:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:03,377 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-11-03 04:05:03,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:03,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-03 04:05:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:03,380 INFO L225 Difference]: With dead ends: 52 [2022-11-03 04:05:03,380 INFO L226 Difference]: Without dead ends: 40 [2022-11-03 04:05:03,380 INFO L412 NwaCegarLoop]: 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 [2022-11-03 04:05:03,381 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:03,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:05:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-03 04:05:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-03 04:05:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:05:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 39 transitions. [2022-11-03 04:05:03,390 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 39 transitions. Word has length 35 [2022-11-03 04:05:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:03,390 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 39 transitions. [2022-11-03 04:05:03,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:05:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 39 transitions. [2022-11-03 04:05:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 04:05:03,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:03,391 INFO L195 NwaCegarLoop]: 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] [2022-11-03 04:05:03,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 04:05:03,392 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:05:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1339607755, now seen corresponding path program 1 times [2022-11-03 04:05:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:03,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942614443] [2022-11-03 04:05:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:03,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:03,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942614443] [2022-11-03 04:05:03,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942614443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:03,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:03,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 04:05:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868204940] [2022-11-03 04:05:03,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:03,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:05:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:03,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:05:03,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:05:03,591 INFO L87 Difference]: Start difference. First operand 40 states and 39 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 04:05:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:03,678 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2022-11-03 04:05:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:05:03,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-03 04:05:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:03,679 INFO L225 Difference]: With dead ends: 40 [2022-11-03 04:05:03,679 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 04:05:03,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:05:03,680 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:03,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 04:05:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 04:05:03,682 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) [2022-11-03 04:05:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 04:05:03,682 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-11-03 04:05:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:03,683 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 04:05:03,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 04:05:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 04:05:03,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 04:05:03,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 04:05:03,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 04:05:03,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 04:05:05,359 INFO L902 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: true [2022-11-03 04:05:05,359 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2022-11-03 04:05:05,359 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2022-11-03 04:05:05,359 INFO L899 garLoopResultBuilder]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2022-11-03 04:05:05,360 INFO L895 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (or (= 3 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~MPR1~0 3) (= ~s~0 ~NP~0)) [2022-11-03 04:05:05,361 INFO L895 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (or (= 3 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~MPR1~0 3) (= ~s~0 ~NP~0)) [2022-11-03 04:05:05,362 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2022-11-03 04:05:05,362 INFO L895 garLoopResultBuilder]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (= 3 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~MPR1~0 3) (= ~s~0 ~NP~0)) [2022-11-03 04:05:05,362 INFO L895 garLoopResultBuilder]: At program point L660(line 660) the Hoare annotation is: (or (= 3 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~MPR1~0 3) (= ~s~0 ~NP~0)) [2022-11-03 04:05:05,362 INFO L899 garLoopResultBuilder]: For program point L660-1(line 660) no Hoare annotation was computed. [2022-11-03 04:05:05,363 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2022-11-03 04:05:05,363 INFO L899 garLoopResultBuilder]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2022-11-03 04:05:05,363 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2022-11-03 04:05:05,367 INFO L895 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (= 3 ~NP~0)) (.cse1 (not (= ~SKIP1~0 3))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (= ~pended~0 1)) (.cse4 (= ~MPR1~0 3)) (.cse5 (= ~s~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 (not (= ~compRegistered~0 0)) .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-11-03 04:05:05,368 INFO L899 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2022-11-03 04:05:05,368 INFO L895 garLoopResultBuilder]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (= 3 ~NP~0)) (.cse1 (not (= ~SKIP1~0 3))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (= ~pended~0 1)) (.cse4 (= ~MPR1~0 3))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 (not (= ~compRegistered~0 0)) .cse3 .cse4))) [2022-11-03 04:05:05,368 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-11-03 04:05:05,369 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2022-11-03 04:05:05,369 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-11-03 04:05:05,369 INFO L895 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: false [2022-11-03 04:05:05,370 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2022-11-03 04:05:05,370 INFO L899 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2022-11-03 04:05:05,370 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2022-11-03 04:05:05,370 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2022-11-03 04:05:05,370 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2022-11-03 04:05:05,371 INFO L895 garLoopResultBuilder]: At program point L368(lines 368 409) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,371 INFO L895 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (and (let ((.cse0 (not (= ~MPR1~0 3))) (.cse1 (<= 0 |ULTIMATE.start_main_~status~1#1|)) (.cse2 (not (= 3 ~NP~0))) (.cse3 (= ~SKIP1~0 3))) (or (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= ~compRegistered~0 0) .cse3))) (not (= ~pended~0 1))) [2022-11-03 04:05:05,372 INFO L895 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,373 INFO L895 garLoopResultBuilder]: At program point L997(line 997) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,373 INFO L899 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-11-03 04:05:05,373 INFO L899 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2022-11-03 04:05:05,374 INFO L895 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: false [2022-11-03 04:05:05,374 INFO L899 garLoopResultBuilder]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2022-11-03 04:05:05,374 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2022-11-03 04:05:05,374 INFO L895 garLoopResultBuilder]: At program point L108(lines 108 291) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,374 INFO L899 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2022-11-03 04:05:05,375 INFO L895 garLoopResultBuilder]: At program point L373(lines 373 408) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,375 INFO L895 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,375 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2022-11-03 04:05:05,375 INFO L895 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (and (let ((.cse0 (not (= ~MPR1~0 3))) (.cse1 (not (= 3 ~NP~0))) (.cse2 (= ~SKIP1~0 3))) (or (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~compRegistered~0 0) .cse2))) (not (= ~pended~0 1))) [2022-11-03 04:05:05,376 INFO L895 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-11-03 04:05:05,376 INFO L899 garLoopResultBuilder]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2022-11-03 04:05:05,376 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2022-11-03 04:05:05,376 INFO L895 garLoopResultBuilder]: At program point L111(lines 111 290) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,377 INFO L895 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,377 INFO L899 garLoopResultBuilder]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2022-11-03 04:05:05,379 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-11-03 04:05:05,379 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: false [2022-11-03 04:05:05,379 INFO L895 garLoopResultBuilder]: At program point L1005(lines 822 1007) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,380 INFO L895 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,380 INFO L895 garLoopResultBuilder]: At program point L114(lines 114 289) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,380 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: false [2022-11-03 04:05:05,380 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2022-11-03 04:05:05,381 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2022-11-03 04:05:05,381 INFO L899 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-11-03 04:05:05,381 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 349) no Hoare annotation was computed. [2022-11-03 04:05:05,381 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2022-11-03 04:05:05,381 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2022-11-03 04:05:05,382 INFO L895 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,382 INFO L899 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-11-03 04:05:05,382 INFO L899 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2022-11-03 04:05:05,382 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-11-03 04:05:05,382 INFO L895 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: false [2022-11-03 04:05:05,383 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2022-11-03 04:05:05,383 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-03 04:05:05,383 INFO L895 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,383 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2022-11-03 04:05:05,383 INFO L895 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: false [2022-11-03 04:05:05,384 INFO L895 garLoopResultBuilder]: At program point L814-1(lines 793 818) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,384 INFO L899 garLoopResultBuilder]: For program point L385(line 385) no Hoare annotation was computed. [2022-11-03 04:05:05,384 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2022-11-03 04:05:05,385 INFO L895 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,385 INFO L895 garLoopResultBuilder]: At program point L883(lines 883 988) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,386 INFO L895 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (and (let ((.cse0 (not (= ~MPR1~0 3))) (.cse1 (not (= 3 ~NP~0))) (.cse2 (= ~SKIP1~0 3))) (or (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~compRegistered~0 0) .cse2))) (not (= ~pended~0 1))) [2022-11-03 04:05:05,389 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 04:05:05,389 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2022-11-03 04:05:05,390 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2022-11-03 04:05:05,390 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-03 04:05:05,391 INFO L895 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: false [2022-11-03 04:05:05,391 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2022-11-03 04:05:05,391 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2022-11-03 04:05:05,392 INFO L895 garLoopResultBuilder]: At program point L754-1(lines 754 766) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,392 INFO L895 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: false [2022-11-03 04:05:05,393 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2022-11-03 04:05:05,393 INFO L895 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,393 INFO L895 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: false [2022-11-03 04:05:05,394 INFO L895 garLoopResultBuilder]: At program point L194(lines 194 195) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,394 INFO L899 garLoopResultBuilder]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2022-11-03 04:05:05,394 INFO L899 garLoopResultBuilder]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2022-11-03 04:05:05,394 INFO L895 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,394 INFO L895 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: false [2022-11-03 04:05:05,395 INFO L899 garLoopResultBuilder]: For program point L756-1(line 756) no Hoare annotation was computed. [2022-11-03 04:05:05,395 INFO L895 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,395 INFO L899 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2022-11-03 04:05:05,395 INFO L895 garLoopResultBuilder]: At program point L891(lines 891 986) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,396 INFO L899 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2022-11-03 04:05:05,396 INFO L895 garLoopResultBuilder]: At program point L594-1(lines 581 600) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~s~0 ~NP~0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,396 INFO L895 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (and (let ((.cse0 (not (= ~MPR1~0 3))) (.cse1 (not (= 3 ~NP~0))) (.cse2 (= ~SKIP1~0 3))) (or (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~compRegistered~0 0) .cse2))) (not (= ~pended~0 1))) [2022-11-03 04:05:05,396 INFO L895 garLoopResultBuilder]: At program point L363(lines 363 410) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,397 INFO L895 garLoopResultBuilder]: At program point L330(lines 330 413) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (= ~NP~0 1) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0)) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,397 INFO L895 garLoopResultBuilder]: At program point L330-1(lines 324 465) the Hoare annotation is: (and (let ((.cse0 (not (= ~MPR1~0 3))) (.cse1 (not (= 3 ~NP~0))) (.cse2 (= ~SKIP1~0 3))) (or (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~compRegistered~0 0) .cse2))) (not (= ~pended~0 1))) [2022-11-03 04:05:05,397 INFO L895 garLoopResultBuilder]: At program point L264(lines 264 265) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,397 INFO L899 garLoopResultBuilder]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2022-11-03 04:05:05,398 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2022-11-03 04:05:05,398 INFO L899 garLoopResultBuilder]: For program point L430(lines 414 463) no Hoare annotation was computed. [2022-11-03 04:05:05,398 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-11-03 04:05:05,398 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2022-11-03 04:05:05,398 INFO L895 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: false [2022-11-03 04:05:05,398 INFO L902 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2022-11-03 04:05:05,399 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2022-11-03 04:05:05,399 INFO L895 garLoopResultBuilder]: At program point L233(lines 233 234) the Hoare annotation is: (and (not (= ~MPR1~0 3)) (not (= ~pended~0 1)) (<= 0 |ULTIMATE.start_main_~status~1#1|) (not (= 3 ~NP~0)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 04:05:05,400 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2022-11-03 04:05:05,400 INFO L895 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (= 3 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~MPR1~0 3) (= ~s~0 ~NP~0)) [2022-11-03 04:05:05,400 INFO L895 garLoopResultBuilder]: At program point L684(line 684) the Hoare annotation is: (or (= 3 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~MPR1~0 3) (= ~SKIP1~0 ~s~0)) [2022-11-03 04:05:05,401 INFO L899 garLoopResultBuilder]: For program point L684-1(line 684) no Hoare annotation was computed. [2022-11-03 04:05:05,401 INFO L895 garLoopResultBuilder]: At program point L678(line 678) the Hoare annotation is: (or (= 3 ~NP~0) (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= ~MPR1~0 3)) [2022-11-03 04:05:05,401 INFO L899 garLoopResultBuilder]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2022-11-03 04:05:05,401 INFO L899 garLoopResultBuilder]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2022-11-03 04:05:05,404 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2022-11-03 04:05:05,404 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2022-11-03 04:05:05,404 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1))) (and (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~s~0 ~NP~0) (not (<= |old(~s~0)| 1)) (not (< 0 |old(~s~0)|)) (not (= ~compRegistered~0 1))) (or (= 3 ~NP~0) (not (= ~compRegistered~0 0)) .cse0 (= ~MPR1~0 3) (not (= 3 |old(~s~0)|)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)))) [2022-11-03 04:05:05,405 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-11-03 04:05:05,405 INFO L895 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1))) (and (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| 1)) (and (= ~setEventCalled~0 1) (< 0 (+ 1073741803 IofCallDriver_~__cil_tmp7~0)) (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) (not (< 0 |old(~s~0)|)) (not (= ~compRegistered~0 1))) (or (= 3 ~NP~0) (not (= ~compRegistered~0 0)) .cse0 (= ~MPR1~0 3) (not (= 3 |old(~s~0)|)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)))) [2022-11-03 04:05:05,405 INFO L895 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1))) (and (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~s~0 ~NP~0) (not (<= |old(~s~0)| 1)) (not (< 0 |old(~s~0)|)) (not (= ~compRegistered~0 1))) (or (= 3 ~NP~0) (not (= ~compRegistered~0 0)) .cse0 (= ~MPR1~0 3) (not (= 3 |old(~s~0)|)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2022-11-03 04:05:05,406 INFO L899 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2022-11-03 04:05:05,406 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2022-11-03 04:05:05,406 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2022-11-03 04:05:05,406 INFO L895 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1))) (and (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| 1)) (not (< 0 |old(~s~0)|)) (not (= ~compRegistered~0 1))) (or (= 3 ~NP~0) (not (= ~compRegistered~0 0)) .cse0 (= ~MPR1~0 3) (not (= 3 |old(~s~0)|)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2022-11-03 04:05:05,407 INFO L899 garLoopResultBuilder]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2022-11-03 04:05:05,407 INFO L895 garLoopResultBuilder]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1))) (and (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (and (= ~setEventCalled~0 1) (= ~s~0 ~NP~0) (< 0 (+ 1073741803 IofCallDriver_~__cil_tmp7~0)) (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| 1)) (not (< 0 |old(~s~0)|)) (not (= ~compRegistered~0 1))) (or (= 3 ~NP~0) (not (= ~compRegistered~0 0)) .cse0 (= ~MPR1~0 3) (not (= 3 |old(~s~0)|)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2022-11-03 04:05:05,407 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2022-11-03 04:05:05,408 INFO L895 garLoopResultBuilder]: At program point L489-1(lines 489 501) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1))) (and (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| 1)) (and (= ~setEventCalled~0 1) (< 0 (+ 1073741803 IofCallDriver_~__cil_tmp7~0)) (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) (not (< 0 |old(~s~0)|)) (not (= ~compRegistered~0 1))) (or (= 3 ~NP~0) (not (= ~compRegistered~0 0)) .cse0 (= ~MPR1~0 3) (not (= 3 |old(~s~0)|)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)))) [2022-11-03 04:05:05,408 INFO L895 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| 1)) (not (= ~setEventCalled~0 1)) (not (< 0 |old(~s~0)|)) (not (= ~compRegistered~0 1))) [2022-11-03 04:05:05,408 INFO L899 garLoopResultBuilder]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2022-11-03 04:05:05,408 INFO L895 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~s~0 ~NP~0) (not (<= |old(~s~0)| 1)) (not (= ~setEventCalled~0 1)) (not (< 0 |old(~s~0)|)) (not (= ~compRegistered~0 1))) [2022-11-03 04:05:05,408 INFO L899 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2022-11-03 04:05:05,412 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:05,415 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 04:05:05,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:05:05 BoogieIcfgContainer [2022-11-03 04:05:05,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 04:05:05,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 04:05:05,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 04:05:05,447 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 04:05:05,448 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:04:59" (3/4) ... [2022-11-03 04:05:05,451 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 04:05:05,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2022-11-03 04:05:05,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2022-11-03 04:05:05,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-11-03 04:05:05,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-03 04:05:05,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2022-11-03 04:05:05,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-03 04:05:05,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-11-03 04:05:05,471 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2022-11-03 04:05:05,472 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-03 04:05:05,474 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-03 04:05:05,475 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 04:05:05,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(SKIP1 == 3) || !(NP == \old(s))) || pended == 1) || !(NP + 4 <= MPR1)) || !(\old(s) <= 1)) || (((setEventCalled == 1 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(0 < \old(s))) || !(compRegistered == 1)) && ((((((3 == NP || !(compRegistered == 0)) || pended == 1) || MPR1 == 3) || !(3 == \old(s))) || !(SKIP1 == \old(s))) || SKIP1 == s) [2022-11-03 04:05:05,504 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(SKIP1 == 3) || !(NP == \old(s))) || pended == 1) || !(NP + 4 <= MPR1)) || !(\old(s) <= 1)) || (((setEventCalled == 1 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(0 < \old(s))) || !(compRegistered == 1)) && ((((((3 == NP || !(compRegistered == 0)) || pended == 1) || MPR1 == 3) || !(3 == \old(s))) || !(SKIP1 == \old(s))) || SKIP1 == s) [2022-11-03 04:05:05,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((3 == NP || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || MPR1 == 3) || s == NP [2022-11-03 04:05:05,507 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((3 == NP || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || MPR1 == 3) || s == NP [2022-11-03 04:05:05,580 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 04:05:05,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 04:05:05,580 INFO L158 Benchmark]: Toolchain (without parser) took 8302.64ms. Allocated memory was 92.3MB in the beginning and 180.4MB in the end (delta: 88.1MB). Free memory was 62.1MB in the beginning and 130.6MB in the end (delta: -68.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-03 04:05:05,581 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 92.3MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:05:05,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.15ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 61.9MB in the beginning and 88.7MB in the end (delta: -26.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 04:05:05,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.88ms. Allocated memory is still 119.5MB. Free memory was 88.7MB in the beginning and 85.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 04:05:05,582 INFO L158 Benchmark]: Boogie Preprocessor took 47.43ms. Allocated memory is still 119.5MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:05:05,582 INFO L158 Benchmark]: RCFGBuilder took 1321.58ms. Allocated memory is still 119.5MB. Free memory was 82.4MB in the beginning and 79.1MB in the end (delta: 3.2MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-11-03 04:05:05,583 INFO L158 Benchmark]: TraceAbstraction took 6082.01ms. Allocated memory was 119.5MB in the beginning and 180.4MB in the end (delta: 60.8MB). Free memory was 78.5MB in the beginning and 142.3MB in the end (delta: -63.8MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2022-11-03 04:05:05,583 INFO L158 Benchmark]: Witness Printer took 133.27ms. Allocated memory is still 180.4MB. Free memory was 142.3MB in the beginning and 130.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 04:05:05,585 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.36ms. Allocated memory is still 92.3MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.15ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 61.9MB in the beginning and 88.7MB in the end (delta: -26.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.88ms. Allocated memory is still 119.5MB. Free memory was 88.7MB in the beginning and 85.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.43ms. Allocated memory is still 119.5MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1321.58ms. Allocated memory is still 119.5MB. Free memory was 82.4MB in the beginning and 79.1MB in the end (delta: 3.2MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6082.01ms. Allocated memory was 119.5MB in the beginning and 180.4MB in the end (delta: 60.8MB). Free memory was 78.5MB in the beginning and 142.3MB in the end (delta: -63.8MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. * Witness Printer took 133.27ms. Allocated memory is still 180.4MB. Free memory was 142.3MB in the beginning and 130.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * 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: 1013]: 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 8 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1102 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1091 mSDsluCounter, 2084 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 992 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 945 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1279 mSDtfsCounter, 945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=2, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 65 LocationsWithAnnotation, 203 PreInvPairs, 243 NumberOfFragments, 1595 HoareAnnotationTreeSize, 203 FomulaSimplifications, 50 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 65 FomulaSimplificationsInter, 848 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 1 specifications checked. All of them hold - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && SKIP1 == s) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((3 == NP || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || MPR1 == 3) || s == NP - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && !(MPR1 == 3)) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && SKIP1 == 3 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((compRegistered == 1 && !(MPR1 == 3)) && !(3 == NP)) && SKIP1 == 3) || (((!(MPR1 == 3) && !(3 == NP)) && compRegistered == 0) && SKIP1 == 3)) && !(pended == 1) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 793]: Loop Invariant Derived loop invariant: ((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: ((((compRegistered == 1 && !(MPR1 == 3)) && !(3 == NP)) && SKIP1 == 3) || (((!(MPR1 == 3) && !(3 == NP)) && compRegistered == 0) && SKIP1 == 3)) && !(pended == 1) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((!(SKIP1 == 3) || !(NP == \old(s))) || pended == 1) || !(NP + 4 <= MPR1)) || !(\old(s) <= 1)) || (((setEventCalled == 1 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(0 < \old(s))) || !(compRegistered == 1)) && ((((((3 == NP || !(compRegistered == 0)) || pended == 1) || MPR1 == 3) || !(3 == \old(s))) || !(SKIP1 == \old(s))) || SKIP1 == s) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && SKIP1 == s) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((((!(pended == 1) && 0 <= status) && NP == 1) && NP + 4 <= MPR1) && compRegistered == 0) && !(MPR3 == s)) && SKIP1 == 3 - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 822]: Loop Invariant Derived loop invariant: ((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((compRegistered == 1 && !(MPR1 == 3)) && !(3 == NP)) && SKIP1 == 3) || (((!(MPR1 == 3) && !(3 == NP)) && compRegistered == 0) && SKIP1 == 3)) && !(pended == 1) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((!(pended == 1) && 0 <= status) && s == NP) && NP == 1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((((!(SKIP1 == 3) || !(NP == \old(s))) || pended == 1) || !(NP + 4 <= MPR1)) || !(\old(s) <= 1)) || (((setEventCalled == 1 && 0 < 1073741803 + __cil_tmp7) && __cil_tmp7 + 1073741802 <= 0) && MPR1 == s)) || !(0 < \old(s))) || !(compRegistered == 1)) && ((((((3 == NP || !(compRegistered == 0)) || pended == 1) || MPR1 == 3) || !(3 == \old(s))) || !(SKIP1 == \old(s))) || SKIP1 == s) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((3 == NP || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || MPR1 == 3) || s == NP - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((!(MPR1 == 3) && !(pended == 1)) && 0 <= status) && !(3 == NP)) && s == NP) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: ((((compRegistered == 1 && !(MPR1 == 3)) && !(3 == NP)) && SKIP1 == 3) || (((!(MPR1 == 3) && !(3 == NP)) && compRegistered == 0) && SKIP1 == 3)) && !(pended == 1) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && !(MPR1 == 3)) && 0 <= status) && !(3 == NP)) && SKIP1 == 3) || ((((!(MPR1 == 3) && 0 <= status) && !(3 == NP)) && compRegistered == 0) && SKIP1 == 3)) && !(pended == 1) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((!(pended == 1) && 0 <= status) && s == NP) && NP == 1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP1 == 3 RESULT: Ultimate proved your program to be correct! [2022-11-03 04:05:05,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe7875f-1414-4ee0-9252-f47a34412d31/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE