./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/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_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/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_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/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 db1e722f73dbd7795cdbaca4c816f6c8a0f90138145d9f90bf0f222b7dd371eb --- 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 03:46:42,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:46:42,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:46:42,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:46:42,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:46:42,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:46:42,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:46:42,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:46:42,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:46:42,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:46:42,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:46:42,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:46:42,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:46:42,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:46:42,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:46:42,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:46:42,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:46:43,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:46:43,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:46:43,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:46:43,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:46:43,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:46:43,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:46:43,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:46:43,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:46:43,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:46:43,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:46:43,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:46:43,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:46:43,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:46:43,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:46:43,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:46:43,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:46:43,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:46:43,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:46:43,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:46:43,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:46:43,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:46:43,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:46:43,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:46:43,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:46:43,039 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:46:43,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:46:43,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:46:43,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:46:43,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:46:43,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:46:43,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:46:43,071 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:46:43,071 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:46:43,071 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:46:43,072 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:46:43,072 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:46:43,072 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:46:43,072 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:46:43,073 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:46:43,073 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:46:43,073 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:46:43,073 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:46:43,074 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:46:43,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:46:43,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:46:43,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:46:43,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:46:43,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:46:43,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:46:43,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:46:43,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:46:43,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:46:43,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:46:43,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:46:43,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:46:43,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:46:43,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:46:43,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:46:43,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:46:43,079 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:46:43,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:46:43,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:46:43,080 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:46:43,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:46:43,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:46:43,081 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:46:43,081 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_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/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_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/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 -> db1e722f73dbd7795cdbaca4c816f6c8a0f90138145d9f90bf0f222b7dd371eb [2022-11-03 03:46:43,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:46:43,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:46:43,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:46:43,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:46:43,552 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:46:43,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-11-03 03:46:43,637 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/data/73141ddcf/7898d376bcfe421eaca2f123e4f9c848/FLAGdafb111ed [2022-11-03 03:46:44,360 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:46:44,375 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-11-03 03:46:44,390 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/data/73141ddcf/7898d376bcfe421eaca2f123e4f9c848/FLAGdafb111ed [2022-11-03 03:46:44,663 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/data/73141ddcf/7898d376bcfe421eaca2f123e4f9c848 [2022-11-03 03:46:44,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:46:44,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:46:44,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:46:44,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:46:44,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:46:44,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:46:44" (1/1) ... [2022-11-03 03:46:44,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31420d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:44, skipping insertion in model container [2022-11-03 03:46:44,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:46:44" (1/1) ... [2022-11-03 03:46:44,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:46:44,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:46:45,065 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_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-11-03 03:46:45,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:46:45,081 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:46:45,136 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_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-11-03 03:46:45,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:46:45,155 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:46:45,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45 WrapperNode [2022-11-03 03:46:45,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:46:45,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:46:45,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:46:45,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:46:45,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,245 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 423 [2022-11-03 03:46:45,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:46:45,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:46:45,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:46:45,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:46:45,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,312 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:46:45,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:46:45,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:46:45,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:46:45,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (1/1) ... [2022-11-03 03:46:45,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:46:45,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:46:45,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:46:45,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:46:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:46:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-03 03:46:45,414 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-03 03:46:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:46:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-03 03:46:45,414 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-03 03:46:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:46:45,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:46:45,572 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:46:45,576 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:46:45,653 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:46:45,673 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:46:45,677 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:46:46,043 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##82: assume !false; [2022-11-03 03:46:46,044 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume false; [2022-11-03 03:46:46,044 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2022-11-03 03:46:46,044 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2022-11-03 03:46:46,044 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-11-03 03:46:46,045 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-11-03 03:46:46,047 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:46:46,094 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-11-03 03:46:46,095 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-11-03 03:46:46,099 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:46:46,333 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:46:46,333 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:46:46,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:46:46 BoogieIcfgContainer [2022-11-03 03:46:46,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:46:46,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:46:46,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:46:46,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:46:46,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:46:44" (1/3) ... [2022-11-03 03:46:46,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2334a75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:46:46, skipping insertion in model container [2022-11-03 03:46:46,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:46:45" (2/3) ... [2022-11-03 03:46:46,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2334a75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:46:46, skipping insertion in model container [2022-11-03 03:46:46,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:46:46" (3/3) ... [2022-11-03 03:46:46,349 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-11-03 03:46:46,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:46:46,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:46:46,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:46:46,437 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;@73fec320, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:46:46,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:46:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 64 states have internal predecessors, (87), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-03 03:46:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:46:46,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:46,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:46,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1009964955, now seen corresponding path program 1 times [2022-11-03 03:46:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:46,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107237235] [2022-11-03 03:46:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:46,803 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 03:46:46,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:46,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107237235] [2022-11-03 03:46:46,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107237235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:46,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:46,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:46:46,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611754428] [2022-11-03 03:46:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:46,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:46:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:46,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:46:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:46:46,861 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 64 states have internal predecessors, (87), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:46:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:47,101 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2022-11-03 03:46:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:46:47,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-11-03 03:46:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:47,113 INFO L225 Difference]: With dead ends: 137 [2022-11-03 03:46:47,113 INFO L226 Difference]: Without dead ends: 73 [2022-11-03 03:46:47,117 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 03:46:47,121 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:47,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:46:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-03 03:46:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-11-03 03:46:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 63 states have internal predecessors, (80), 10 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:46:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-11-03 03:46:47,195 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 8 [2022-11-03 03:46:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:47,195 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-11-03 03:46:47,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 03:46:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-11-03 03:46:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:46:47,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:47,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:47,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:46:47,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1243980093, now seen corresponding path program 1 times [2022-11-03 03:46:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:47,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737851069] [2022-11-03 03:46:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:47,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:47,308 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 03:46:47,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:47,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737851069] [2022-11-03 03:46:47,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737851069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:47,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:47,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:46:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648905211] [2022-11-03 03:46:47,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:47,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:46:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:47,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:46:47,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:46:47,355 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:46:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:47,457 INFO L93 Difference]: Finished difference Result 134 states and 177 transitions. [2022-11-03 03:46:47,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:46:47,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2022-11-03 03:46:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:47,459 INFO L225 Difference]: With dead ends: 134 [2022-11-03 03:46:47,460 INFO L226 Difference]: Without dead ends: 105 [2022-11-03 03:46:47,460 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 03:46:47,462 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 69 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:47,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:46:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-03 03:46:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 74. [2022-11-03 03:46:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 66 states have internal predecessors, (84), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-03 03:46:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-11-03 03:46:47,479 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 9 [2022-11-03 03:46:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:47,479 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-11-03 03:46:47,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 03:46:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-11-03 03:46:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:46:47,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:47,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:47,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:46:47,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1242547785, now seen corresponding path program 1 times [2022-11-03 03:46:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:47,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769622774] [2022-11-03 03:46:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:47,556 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 03:46:47,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:47,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769622774] [2022-11-03 03:46:47,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769622774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:47,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:47,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:46:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15368076] [2022-11-03 03:46:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:47,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:46:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:47,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:46:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:46:47,560 INFO L87 Difference]: Start difference. First operand 74 states and 97 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 03:46:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:47,606 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2022-11-03 03:46:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:46:47,607 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 03:46:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:47,615 INFO L225 Difference]: With dead ends: 88 [2022-11-03 03:46:47,615 INFO L226 Difference]: Without dead ends: 74 [2022-11-03 03:46:47,616 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 03:46:47,617 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 37 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:47,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 97 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:46:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-03 03:46:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-03 03:46:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 66 states have internal predecessors, (83), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-03 03:46:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2022-11-03 03:46:47,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 11 [2022-11-03 03:46:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:47,637 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2022-11-03 03:46:47,637 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 03:46:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2022-11-03 03:46:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:46:47,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:47,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:47,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:46:47,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash 206226151, now seen corresponding path program 1 times [2022-11-03 03:46:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:47,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809613747] [2022-11-03 03:46:47,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:48,011 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 03:46:48,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:48,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809613747] [2022-11-03 03:46:48,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809613747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:48,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:48,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:46:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128497085] [2022-11-03 03:46:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:48,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:46:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:48,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:46:48,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:46:48,015 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:48,182 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2022-11-03 03:46:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:46:48,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:46:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:48,186 INFO L225 Difference]: With dead ends: 77 [2022-11-03 03:46:48,186 INFO L226 Difference]: Without dead ends: 74 [2022-11-03 03:46:48,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:46:48,200 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:48,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 80 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:46:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-03 03:46:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-03 03:46:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 66 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-03 03:46:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2022-11-03 03:46:48,229 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 17 [2022-11-03 03:46:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:48,229 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2022-11-03 03:46:48,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-11-03 03:46:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:46:48,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:48,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:48,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:46:48,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash -446902878, now seen corresponding path program 1 times [2022-11-03 03:46:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:48,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799311310] [2022-11-03 03:46:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:48,378 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 03:46:48,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:48,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799311310] [2022-11-03 03:46:48,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799311310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:48,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:48,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:46:48,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90445459] [2022-11-03 03:46:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:48,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:46:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:48,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:46:48,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:46:48,382 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:48,488 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2022-11-03 03:46:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:46:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:46:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:48,494 INFO L225 Difference]: With dead ends: 106 [2022-11-03 03:46:48,494 INFO L226 Difference]: Without dead ends: 72 [2022-11-03 03:46:48,495 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 03:46:48,496 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:48,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:46:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-03 03:46:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-03 03:46:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 64 states have internal predecessors, (79), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-03 03:46:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-11-03 03:46:48,528 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 19 [2022-11-03 03:46:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:48,529 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-11-03 03:46:48,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-11-03 03:46:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:46:48,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:48,534 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] [2022-11-03 03:46:48,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:46:48,535 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:48,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1928858885, now seen corresponding path program 1 times [2022-11-03 03:46:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:48,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108430684] [2022-11-03 03:46:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:48,783 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 03:46:48,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:48,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108430684] [2022-11-03 03:46:48,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108430684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:48,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:48,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:46:48,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626006491] [2022-11-03 03:46:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:48,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:46:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:46:48,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:46:48,787 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 03:46:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:48,966 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2022-11-03 03:46:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:46:48,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 21 [2022-11-03 03:46:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:48,968 INFO L225 Difference]: With dead ends: 119 [2022-11-03 03:46:48,968 INFO L226 Difference]: Without dead ends: 85 [2022-11-03 03:46:48,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:46:48,976 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 188 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:48,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 212 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:46:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-03 03:46:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2022-11-03 03:46:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 62 states have internal predecessors, (76), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:46:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-11-03 03:46:49,008 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 21 [2022-11-03 03:46:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:49,009 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-11-03 03:46:49,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 03:46:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-11-03 03:46:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:46:49,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:49,012 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 03:46:49,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:46:49,013 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1636903991, now seen corresponding path program 1 times [2022-11-03 03:46:49,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:49,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815742857] [2022-11-03 03:46:49,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:49,223 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 03:46:49,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:49,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815742857] [2022-11-03 03:46:49,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815742857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:49,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:49,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:46:49,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037532899] [2022-11-03 03:46:49,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:49,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:46:49,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:49,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:46:49,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:46:49,226 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:46:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:49,418 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-11-03 03:46:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:46:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 23 [2022-11-03 03:46:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:49,420 INFO L225 Difference]: With dead ends: 114 [2022-11-03 03:46:49,420 INFO L226 Difference]: Without dead ends: 82 [2022-11-03 03:46:49,422 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 03:46:49,424 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 82 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:49,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 127 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:46:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-03 03:46:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-11-03 03:46:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.25) internal successors, (75), 62 states have internal predecessors, (75), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:46:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-11-03 03:46:49,448 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2022-11-03 03:46:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:49,449 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-11-03 03:46:49,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 03:46:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-11-03 03:46:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:46:49,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:49,451 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 03:46:49,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:46:49,451 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:49,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1661134061, now seen corresponding path program 1 times [2022-11-03 03:46:49,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:49,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389292513] [2022-11-03 03:46:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:49,673 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 03:46:49,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389292513] [2022-11-03 03:46:49,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389292513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:49,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:49,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:46:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189571026] [2022-11-03 03:46:49,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:49,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:46:49,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:46:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:46:49,677 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 03:46:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:49,910 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-11-03 03:46:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:46:49,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 03:46:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:49,912 INFO L225 Difference]: With dead ends: 77 [2022-11-03 03:46:49,913 INFO L226 Difference]: Without dead ends: 74 [2022-11-03 03:46:49,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 03:46:49,914 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 31 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:49,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:46:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-03 03:46:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2022-11-03 03:46:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.25) internal successors, (75), 62 states have internal predecessors, (75), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:46:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-11-03 03:46:49,941 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 24 [2022-11-03 03:46:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:49,942 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-11-03 03:46:49,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 03:46:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-11-03 03:46:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:46:49,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:49,943 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] [2022-11-03 03:46:49,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:46:49,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1420840684, now seen corresponding path program 1 times [2022-11-03 03:46:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:49,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734412710] [2022-11-03 03:46:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:49,985 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 03:46:49,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:49,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734412710] [2022-11-03 03:46:49,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734412710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:49,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:49,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:46:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329903306] [2022-11-03 03:46:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:49,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:46:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:46:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:46:49,988 INFO L87 Difference]: Start difference. First operand 70 states and 86 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, (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 03:46:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:50,058 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-11-03 03:46:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:46:50,059 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, (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 25 [2022-11-03 03:46:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:50,060 INFO L225 Difference]: With dead ends: 85 [2022-11-03 03:46:50,060 INFO L226 Difference]: Without dead ends: 82 [2022-11-03 03:46:50,060 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 03:46:50,062 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 16 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:50,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 105 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:46:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-03 03:46:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-03 03:46:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 64 states have internal predecessors, (78), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:46:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2022-11-03 03:46:50,075 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 25 [2022-11-03 03:46:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:50,077 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2022-11-03 03:46:50,077 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, (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 03:46:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2022-11-03 03:46:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:46:50,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:50,080 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] [2022-11-03 03:46:50,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:46:50,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -978574283, now seen corresponding path program 1 times [2022-11-03 03:46:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:50,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848680476] [2022-11-03 03:46:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:50,202 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 03:46:50,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:50,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848680476] [2022-11-03 03:46:50,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848680476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:50,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:50,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:46:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082903938] [2022-11-03 03:46:50,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:50,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:46:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:50,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:46:50,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:46:50,206 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 03:46:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:50,447 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-11-03 03:46:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:46:50,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 26 [2022-11-03 03:46:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:50,450 INFO L225 Difference]: With dead ends: 104 [2022-11-03 03:46:50,450 INFO L226 Difference]: Without dead ends: 84 [2022-11-03 03:46:50,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:46:50,451 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 93 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:50,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 150 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:46:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-03 03:46:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2022-11-03 03:46:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 states have internal predecessors, (77), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:46:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2022-11-03 03:46:50,489 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 26 [2022-11-03 03:46:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:50,490 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2022-11-03 03:46:50,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 03:46:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-11-03 03:46:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:46:50,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:50,495 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] [2022-11-03 03:46:50,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:46:50,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1334051139, now seen corresponding path program 1 times [2022-11-03 03:46:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:50,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934088862] [2022-11-03 03:46:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:50,585 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 03:46:50,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:50,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934088862] [2022-11-03 03:46:50,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934088862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:50,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:50,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:46:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119613739] [2022-11-03 03:46:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:50,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:46:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:50,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:46:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:46:50,589 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 03:46:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:50,654 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2022-11-03 03:46:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:46:50,655 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), 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 26 [2022-11-03 03:46:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:50,656 INFO L225 Difference]: With dead ends: 114 [2022-11-03 03:46:50,656 INFO L226 Difference]: Without dead ends: 88 [2022-11-03 03:46:50,657 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 03:46:50,658 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:50,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:46:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-03 03:46:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2022-11-03 03:46:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.2) internal successors, (72), 61 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:46:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-11-03 03:46:50,676 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 26 [2022-11-03 03:46:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:50,677 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-11-03 03:46:50,677 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), 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 03:46:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-11-03 03:46:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:46:50,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:50,679 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] [2022-11-03 03:46:50,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:46:50,680 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1016191363, now seen corresponding path program 1 times [2022-11-03 03:46:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:50,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124986759] [2022-11-03 03:46:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:50,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:50,796 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 03:46:50,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:50,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124986759] [2022-11-03 03:46:50,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124986759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:50,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:50,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:46:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020816373] [2022-11-03 03:46:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:50,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:46:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:46:50,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:46:50,800 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 03:46:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:50,910 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2022-11-03 03:46:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:46:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2022-11-03 03:46:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:50,911 INFO L225 Difference]: With dead ends: 78 [2022-11-03 03:46:50,911 INFO L226 Difference]: Without dead ends: 29 [2022-11-03 03:46:50,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:46:50,913 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 124 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:50,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 73 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:46:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-03 03:46:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-03 03:46:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 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 03:46:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2022-11-03 03:46:50,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 27 [2022-11-03 03:46:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:50,921 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2022-11-03 03:46:50,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 03:46:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-11-03 03:46:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:46:50,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:50,924 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 03:46:50,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:46:50,925 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:46:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1183824323, now seen corresponding path program 1 times [2022-11-03 03:46:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:50,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501922246] [2022-11-03 03:46:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:51,020 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 03:46:51,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:51,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501922246] [2022-11-03 03:46:51,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501922246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:46:51,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:46:51,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:46:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143738817] [2022-11-03 03:46:51,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:46:51,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:46:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:46:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:46:51,025 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 03:46:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:51,064 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-11-03 03:46:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:46:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 28 [2022-11-03 03:46:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:51,067 INFO L225 Difference]: With dead ends: 29 [2022-11-03 03:46:51,068 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 03:46:51,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:46:51,070 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:51,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:46:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 03:46:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 03:46:51,073 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 03:46:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 03:46:51,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-11-03 03:46:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:51,074 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 03:46:51,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 03:46:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 03:46:51,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 03:46:51,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 03:46:51,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:46:51,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 03:46:52,499 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-11-03 03:46:52,500 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2022-11-03 03:46:52,500 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-11-03 03:46:52,500 INFO L895 garLoopResultBuilder]: At program point L102(lines 102 284) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,501 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-03 03:46:52,501 INFO L895 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: false [2022-11-03 03:46:52,501 INFO L899 garLoopResultBuilder]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2022-11-03 03:46:52,501 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: false [2022-11-03 03:46:52,501 INFO L895 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,501 INFO L895 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-11-03 03:46:52,502 INFO L899 garLoopResultBuilder]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2022-11-03 03:46:52,502 INFO L899 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2022-11-03 03:46:52,502 INFO L895 garLoopResultBuilder]: At program point L352(lines 352 367) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,502 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-11-03 03:46:52,502 INFO L895 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,502 INFO L899 garLoopResultBuilder]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2022-11-03 03:46:52,503 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2022-11-03 03:46:52,503 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2022-11-03 03:46:52,503 INFO L895 garLoopResultBuilder]: At program point L105(lines 105 283) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,503 INFO L899 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2022-11-03 03:46:52,503 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-11-03 03:46:52,503 INFO L902 garLoopResultBuilder]: At program point L420(lines 288 422) the Hoare annotation is: true [2022-11-03 03:46:52,504 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2022-11-03 03:46:52,504 INFO L895 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (and (= ~setEventCalled~0 1) (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (not (= ~MPR3~0 ~s~0)) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,504 INFO L895 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-11-03 03:46:52,504 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-11-03 03:46:52,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 03:46:52,504 INFO L895 garLoopResultBuilder]: At program point L108(lines 108 282) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,505 INFO L899 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2022-11-03 03:46:52,505 INFO L895 garLoopResultBuilder]: At program point L323(lines 323 368) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~pended~0 1)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1)) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,505 INFO L895 garLoopResultBuilder]: At program point L323-1(lines 297 421) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,505 INFO L895 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (and (= 3 ~s~0) (<= 5 ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,505 INFO L899 garLoopResultBuilder]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2022-11-03 03:46:52,506 INFO L899 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2022-11-03 03:46:52,506 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 339 349) no Hoare annotation was computed. [2022-11-03 03:46:52,506 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2022-11-03 03:46:52,511 INFO L899 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2022-11-03 03:46:52,512 INFO L895 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (and (= 3 ~s~0) (<= 5 ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,512 INFO L899 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2022-11-03 03:46:52,512 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2022-11-03 03:46:52,513 INFO L899 garLoopResultBuilder]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2022-11-03 03:46:52,514 INFO L895 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (and (= 3 ~s~0) (<= 5 ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,514 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2022-11-03 03:46:52,515 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-11-03 03:46:52,515 INFO L895 garLoopResultBuilder]: At program point L541-1(lines 528 547) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,515 INFO L895 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,515 INFO L895 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: false [2022-11-03 03:46:52,515 INFO L895 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: false [2022-11-03 03:46:52,516 INFO L895 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,516 INFO L895 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,516 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: false [2022-11-03 03:46:52,516 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-11-03 03:46:52,517 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2022-11-03 03:46:52,517 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,517 INFO L895 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 03:46:52,517 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-11-03 03:46:52,517 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2022-11-03 03:46:52,518 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2022-11-03 03:46:52,518 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2022-11-03 03:46:52,518 INFO L895 garLoopResultBuilder]: At program point L445(lines 445 448) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse4 (= ~compRegistered~0 0)) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 (not .cse4) .cse2 .cse3 (not (= 3 |old(~s~0)|)) .cse5))) [2022-11-03 03:46:52,518 INFO L895 garLoopResultBuilder]: At program point L445-2(lines 445 448) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse4 (= ~compRegistered~0 0)) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse4) (or .cse0 .cse1 (not .cse4) .cse2 .cse3 (not (= 3 |old(~s~0)|)) (= ~s~0 |old(~s~0)|)))) [2022-11-03 03:46:52,519 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse4 (= ~compRegistered~0 0)) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 (not .cse4) .cse2 .cse3 (not (= 3 |old(~s~0)|)) .cse5))) [2022-11-03 03:46:52,519 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2022-11-03 03:46:52,519 INFO L895 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse4 (= ~compRegistered~0 0)) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse4) (or .cse0 .cse1 (not .cse4) .cse2 .cse3 (not (= 3 |old(~s~0)|)) (= ~s~0 |old(~s~0)|)))) [2022-11-03 03:46:52,519 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2022-11-03 03:46:52,519 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2022-11-03 03:46:52,520 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse3 (= ~pended~0 1)) (.cse4 (not (<= 5 ~MPR1~0))) (.cse2 (= ~compRegistered~0 0))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (= 3 |old(~s~0)|))) (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse2))) [2022-11-03 03:46:52,521 INFO L895 garLoopResultBuilder]: At program point L431-1(lines 423 436) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse3 (= ~pended~0 1)) (.cse4 (not (<= 5 ~MPR1~0))) (.cse2 (= ~compRegistered~0 0))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (= 3 |old(~s~0)|))) (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse2))) [2022-11-03 03:46:52,521 INFO L895 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~SKIP1~0 3))) (.cse3 (= ~pended~0 1)) (.cse4 (not (<= 5 ~MPR1~0))) (.cse2 (= ~compRegistered~0 0))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (= 3 |old(~s~0)|))) (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse2))) [2022-11-03 03:46:52,521 INFO L899 garLoopResultBuilder]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2022-11-03 03:46:52,522 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-11-03 03:46:52,526 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:52,529 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:46:52,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:46:52 BoogieIcfgContainer [2022-11-03 03:46:52,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:46:52,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:46:52,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:46:52,576 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:46:52,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:46:46" (3/4) ... [2022-11-03 03:46:52,580 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 03:46:52,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-03 03:46:52,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-03 03:46:52,616 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2022-11-03 03:46:52,617 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-03 03:46:52,618 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-03 03:46:52,619 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 03:46:52,659 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || pended == 1) || !(5 <= MPR1)) || !(3 == \old(s))) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) [2022-11-03 03:46:52,659 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || pended == 1) || !(5 <= MPR1)) || !(3 == \old(s))) || s == \old(s)) [2022-11-03 03:46:52,661 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || compRegistered == 0) || s == \old(s)) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || pended == 1) || !(5 <= MPR1)) || !(3 == \old(s))) || s == \old(s)) [2022-11-03 03:46:52,661 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || pended == 1) || !(5 <= MPR1)) || !(3 == \old(s))) || s == \old(s)) [2022-11-03 03:46:52,752 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:46:52,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:46:52,753 INFO L158 Benchmark]: Toolchain (without parser) took 8084.74ms. Allocated memory was 111.1MB in the beginning and 182.5MB in the end (delta: 71.3MB). Free memory was 72.9MB in the beginning and 103.2MB in the end (delta: -30.4MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-11-03 03:46:52,753 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 111.1MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:46:52,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.30ms. Allocated memory is still 111.1MB. Free memory was 72.7MB in the beginning and 80.5MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 03:46:52,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.40ms. Allocated memory is still 111.1MB. Free memory was 80.5MB in the beginning and 77.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:46:52,755 INFO L158 Benchmark]: Boogie Preprocessor took 68.02ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 75.5MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 03:46:52,755 INFO L158 Benchmark]: RCFGBuilder took 1018.09ms. Allocated memory was 111.1MB in the beginning and 151.0MB in the end (delta: 39.8MB). Free memory was 75.5MB in the beginning and 111.1MB in the end (delta: -35.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-11-03 03:46:52,757 INFO L158 Benchmark]: TraceAbstraction took 6234.84ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 110.3MB in the beginning and 111.6MB in the end (delta: -1.3MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2022-11-03 03:46:52,757 INFO L158 Benchmark]: Witness Printer took 176.91ms. Allocated memory is still 182.5MB. Free memory was 110.6MB in the beginning and 103.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 03:46:52,760 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.37ms. Allocated memory is still 111.1MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.30ms. Allocated memory is still 111.1MB. Free memory was 72.7MB in the beginning and 80.5MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.40ms. Allocated memory is still 111.1MB. Free memory was 80.5MB in the beginning and 77.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.02ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 75.5MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.09ms. Allocated memory was 111.1MB in the beginning and 151.0MB in the end (delta: 39.8MB). Free memory was 75.5MB in the beginning and 111.1MB in the end (delta: -35.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6234.84ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 110.3MB in the beginning and 111.6MB in the end (delta: -1.3MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Witness Printer took 176.91ms. Allocated memory is still 182.5MB. Free memory was 110.6MB in the beginning and 103.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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: 581]: 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 3 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 794 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 789 mSDsluCounter, 1490 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 901 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 992 IncrementalHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 765 mSDtfsCounter, 992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred 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.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 105 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 117 PreInvPairs, 141 NumberOfFragments, 805 HoareAnnotationTreeSize, 117 FomulaSimplifications, 203 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 1899 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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: 105]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && !(pended == 1)) && NP == 1) && status == 0) && compRegistered == 0) && !(MPR3 == s)) && !(s == 1)) && SKIP1 == 3 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && !(compRegistered == 0)) && s == NP) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && NP == 1) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: (((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || pended == 1) || !(5 <= MPR1)) || !(3 == \old(s))) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || pended == 1) || !(5 <= MPR1)) || !(3 == \old(s))) || s == \old(s)) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && NP == 1) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((5 <= MPR1 && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && NP == 1) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || pended == 1) || !(5 <= MPR1)) || !(3 == \old(s))) || s == \old(s)) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && !(compRegistered == 0)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && NP == 1) && __cil_tmp8 == 1) && pended == 0) && SKIP1 == 3 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((setEventCalled == 1 && 5 <= MPR1) && !(compRegistered == 0)) && s == NP) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && !(MPR3 == s)) && SKIP1 == 3 - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((!(NP == 1) || !(SKIP1 == 3)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || compRegistered == 0) || s == \old(s)) && ((((((!(NP == 1) || !(SKIP1 == 3)) || !(compRegistered == 0)) || pended == 1) || !(5 <= MPR1)) || !(3 == \old(s))) || s == \old(s)) RESULT: Ultimate proved your program to be correct! [2022-11-03 03:46:52,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312d96ff-a4f4-4bcd-a7f5-52f94d4c17bd/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