./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 57d203c2bb9e5fb46a500992932f18e1bc69473edc196ab4ca3ccbbd153a7dab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:35:19,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:35:19,912 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 01:35:19,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:35:19,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:35:19,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:35:19,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:35:19,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:35:19,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:35:19,943 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:35:19,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:35:19,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:35:19,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:35:19,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:35:19,945 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:35:19,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:35:19,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:35:19,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:35:19,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:35:19,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:35:19,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:35:19,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:35:19,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:35:19,950 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:35:19,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:35:19,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:35:19,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:35:19,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:35:19,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:35:19,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:35:19,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:35:19,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:35:19,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:35:19,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:35:19,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:35:19,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:35:19,955 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:35:19,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:35:19,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:35:19,955 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/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_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57d203c2bb9e5fb46a500992932f18e1bc69473edc196ab4ca3ccbbd153a7dab [2023-11-29 01:35:20,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:35:20,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:35:20,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:35:20,216 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:35:20,217 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:35:20,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2023-11-29 01:35:25,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:35:25,596 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:35:25,597 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2023-11-29 01:35:25,630 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/data/092b1e1a5/0fc16cfa72b64e1ab5810563b67da4b7/FLAGdc7a87183 [2023-11-29 01:35:25,644 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/data/092b1e1a5/0fc16cfa72b64e1ab5810563b67da4b7 [2023-11-29 01:35:25,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:35:25,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:35:25,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:35:25,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:35:25,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:35:25,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:35:25" (1/1) ... [2023-11-29 01:35:25,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1db0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:25, skipping insertion in model container [2023-11-29 01:35:25,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:35:25" (1/1) ... [2023-11-29 01:35:25,761 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:35:27,128 WARN L240 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_89020a72-d571-4b2b-b120-794f3b84a139/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i[258961,258974] [2023-11-29 01:35:27,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:35:27,392 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:35:27,639 WARN L240 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_89020a72-d571-4b2b-b120-794f3b84a139/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i[258961,258974] [2023-11-29 01:35:27,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:35:27,758 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:35:27,764 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:35:27,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27 WrapperNode [2023-11-29 01:35:27,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:35:27,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:35:27,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:35:27,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:35:27,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:27,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:27,926 INFO L138 Inliner]: procedures = 217, calls = 1704, calls flagged for inlining = 76, calls inlined = 53, statements flattened = 3757 [2023-11-29 01:35:27,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:35:27,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:35:27,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:35:27,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:35:27,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:27,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:27,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:28,274 INFO L175 MemorySlicer]: Split 1156 memory accesses to 12 slices as follows [2, 43, 1, 1002, 5, 3, 4, 7, 46, 3, 2, 38]. 87 percent of accesses are in the largest equivalence class. The 920 initializations are split as follows [2, 43, 0, 857, 5, 0, 3, 7, 0, 3, 0, 0]. The 107 writes are split as follows [0, 0, 0, 56, 0, 0, 0, 0, 16, 0, 1, 34]. [2023-11-29 01:35:28,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:28,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:28,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:28,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:28,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:28,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:28,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:35:28,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:35:28,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:35:28,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:35:28,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (1/1) ... [2023-11-29 01:35:28,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:35:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:35:28,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:35:28,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89020a72-d571-4b2b-b120-794f3b84a139/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:35:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2023-11-29 01:35:28,552 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2023-11-29 01:35:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2023-11-29 01:35:28,552 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2023-11-29 01:35:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-29 01:35:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-29 01:35:28,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-29 01:35:28,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-29 01:35:28,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-29 01:35:28,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-29 01:35:28,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-29 01:35:28,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2023-11-29 01:35:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2023-11-29 01:35:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2023-11-29 01:35:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2023-11-29 01:35:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2023-11-29 01:35:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-29 01:35:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-29 01:35:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-29 01:35:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-29 01:35:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-29 01:35:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-29 01:35:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-29 01:35:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2023-11-29 01:35:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2023-11-29 01:35:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2023-11-29 01:35:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2023-11-29 01:35:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2023-11-29 01:35:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 01:35:28,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 01:35:28,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-29 01:35:28,557 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-29 01:35:28,557 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_dev [2023-11-29 01:35:28,557 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_dev [2023-11-29 01:35:28,557 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_dev [2023-11-29 01:35:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_dev [2023-11-29 01:35:28,558 INFO L130 BoogieDeclarations]: Found specification of procedure p54_free_common [2023-11-29 01:35:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure p54_free_common [2023-11-29 01:35:28,558 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_stop [2023-11-29 01:35:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_stop [2023-11-29 01:35:28,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 01:35:28,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 01:35:28,558 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2023-11-29 01:35:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2023-11-29 01:35:28,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-29 01:35:28,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-29 01:35:28,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 01:35:28,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 01:35:28,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 01:35:28,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 01:35:28,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2023-11-29 01:35:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2023-11-29 01:35:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2023-11-29 01:35:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2023-11-29 01:35:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2023-11-29 01:35:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2023-11-29 01:35:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2023-11-29 01:35:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2023-11-29 01:35:28,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 01:35:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 01:35:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 01:35:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 01:35:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2023-11-29 01:35:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2023-11-29 01:35:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2023-11-29 01:35:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2023-11-29 01:35:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2023-11-29 01:35:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2023-11-29 01:35:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2023-11-29 01:35:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2023-11-29 01:35:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:35:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:35:28,563 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2023-11-29 01:35:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2023-11-29 01:35:28,563 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2023-11-29 01:35:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2023-11-29 01:35:28,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:35:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 01:35:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:35:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:35:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:35:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 01:35:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 01:35:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 01:35:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 01:35:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 01:35:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 01:35:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 01:35:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 01:35:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 01:35:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure p54_find_type [2023-11-29 01:35:28,566 INFO L138 BoogieDeclarations]: Found implementation of procedure p54_find_type [2023-11-29 01:35:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2023-11-29 01:35:28,566 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2023-11-29 01:35:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:35:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 01:35:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 01:35:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 01:35:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 01:35:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_open [2023-11-29 01:35:28,568 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_open [2023-11-29 01:35:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-29 01:35:28,568 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-29 01:35:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-29 01:35:28,568 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-29 01:35:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2023-11-29 01:35:28,568 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2023-11-29 01:35:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_post_reset [2023-11-29 01:35:28,569 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_post_reset [2023-11-29 01:35:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2023-11-29 01:35:28,569 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2023-11-29 01:35:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-29 01:35:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-29 01:35:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-29 01:35:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-29 01:35:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-29 01:35:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-29 01:35:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-29 01:35:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2023-11-29 01:35:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2023-11-29 01:35:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2023-11-29 01:35:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2023-11-29 01:35:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2023-11-29 01:35:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2023-11-29 01:35:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2023-11-29 01:35:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_disconnect [2023-11-29 01:35:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_disconnect [2023-11-29 01:35:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2023-11-29 01:35:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2023-11-29 01:35:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 01:35:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2023-11-29 01:35:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2023-11-29 01:35:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2023-11-29 01:35:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2023-11-29 01:35:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2023-11-29 01:35:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2023-11-29 01:35:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2023-11-29 01:35:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2023-11-29 01:35:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2023-11-29 01:35:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2023-11-29 01:35:28,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2023-11-29 01:35:28,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2023-11-29 01:35:28,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2023-11-29 01:35:28,575 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2023-11-29 01:35:28,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2023-11-29 01:35:28,576 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 01:35:28,576 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 01:35:28,576 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2023-11-29 01:35:28,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2023-11-29 01:35:28,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:35:28,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:35:28,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:35:28,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 01:35:28,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 01:35:28,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_pre_reset [2023-11-29 01:35:28,577 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_pre_reset [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-29 01:35:28,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-29 01:35:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2023-11-29 01:35:28,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2023-11-29 01:35:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:35:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:35:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_read [2023-11-29 01:35:28,619 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_read [2023-11-29 01:35:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_write [2023-11-29 01:35:28,619 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_write [2023-11-29 01:35:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-29 01:35:28,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-29 01:35:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2023-11-29 01:35:28,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2023-11-29 01:35:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 01:35:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_udev_of_p54u_priv [2023-11-29 01:35:28,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_udev_of_p54u_priv [2023-11-29 01:35:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_resume [2023-11-29 01:35:28,621 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_resume [2023-11-29 01:35:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-29 01:35:28,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-29 01:35:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2023-11-29 01:35:28,621 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2023-11-29 01:35:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2023-11-29 01:35:28,621 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2023-11-29 01:35:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_free_urbs [2023-11-29 01:35:28,621 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_free_urbs [2023-11-29 01:35:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure skb_unlink [2023-11-29 01:35:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_unlink [2023-11-29 01:35:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2023-11-29 01:35:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2023-11-29 01:35:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_bulk_msg [2023-11-29 01:35:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_bulk_msg [2023-11-29 01:35:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2023-11-29 01:35:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2023-11-29 01:35:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:35:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:35:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2023-11-29 01:35:28,623 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2023-11-29 01:35:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tail_pointer [2023-11-29 01:35:28,624 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tail_pointer [2023-11-29 01:35:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:35:28,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:35:29,154 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:35:29,158 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:35:29,318 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 01:35:36,867 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:35:37,167 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:35:37,167 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:35:37,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:35:37 BoogieIcfgContainer [2023-11-29 01:35:37,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:35:37,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:35:37,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:35:37,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:35:37,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:35:25" (1/3) ... [2023-11-29 01:35:37,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24119527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:35:37, skipping insertion in model container [2023-11-29 01:35:37,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:27" (2/3) ... [2023-11-29 01:35:37,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24119527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:35:37, skipping insertion in model container [2023-11-29 01:35:37,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:35:37" (3/3) ... [2023-11-29 01:35:37,177 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2023-11-29 01:35:37,193 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:35:37,193 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:35:37,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:35:37,261 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@6f20c132, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:35:37,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:35:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 737 states, 510 states have (on average 1.4568627450980391) internal successors, (743), 534 states have internal predecessors, (743), 175 states have call successors, (175), 51 states have call predecessors, (175), 50 states have return successors, (171), 171 states have call predecessors, (171), 171 states have call successors, (171) [2023-11-29 01:35:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:35:37,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:37,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:37,279 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:35:37,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1838937847, now seen corresponding path program 1 times [2023-11-29 01:35:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:37,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196212891] [2023-11-29 01:35:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:50,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:35:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:50,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:35:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:35:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:35:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:51,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196212891] [2023-11-29 01:35:51,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196212891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:51,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:51,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:35:51,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834764987] [2023-11-29 01:35:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:51,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:35:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:51,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:35:51,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:51,091 INFO L87 Difference]: Start difference. First operand has 737 states, 510 states have (on average 1.4568627450980391) internal successors, (743), 534 states have internal predecessors, (743), 175 states have call successors, (175), 51 states have call predecessors, (175), 50 states have return successors, (171), 171 states have call predecessors, (171), 171 states have call successors, (171) Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:35:55,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:35:59,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:36:03,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:36:07,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:36:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:10,898 INFO L93 Difference]: Finished difference Result 1564 states and 2356 transitions. [2023-11-29 01:36:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:36:10,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-11-29 01:36:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:10,921 INFO L225 Difference]: With dead ends: 1564 [2023-11-29 01:36:10,921 INFO L226 Difference]: Without dead ends: 822 [2023-11-29 01:36:10,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:36:10,932 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 943 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 377 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:10,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 609 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2185 Invalid, 4 Unknown, 0 Unchecked, 19.5s Time] [2023-11-29 01:36:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2023-11-29 01:36:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 729. [2023-11-29 01:36:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 508 states have (on average 1.4133858267716535) internal successors, (718), 526 states have internal predecessors, (718), 171 states have call successors, (171), 50 states have call predecessors, (171), 49 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2023-11-29 01:36:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1054 transitions. [2023-11-29 01:36:11,045 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1054 transitions. Word has length 30 [2023-11-29 01:36:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:11,045 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 1054 transitions. [2023-11-29 01:36:11,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 01:36:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1054 transitions. [2023-11-29 01:36:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 01:36:11,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:11,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:11,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:36:11,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:36:11,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2033327623, now seen corresponding path program 1 times [2023-11-29 01:36:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424984647] [2023-11-29 01:36:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:11,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:24,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:36:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:36:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:36:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:24,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:36:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:24,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424984647] [2023-11-29 01:36:24,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424984647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:24,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:24,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:36:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944447784] [2023-11-29 01:36:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:24,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:36:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:24,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:36:24,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:36:24,328 INFO L87 Difference]: Start difference. First operand 729 states and 1054 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 01:36:28,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:36:32,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:36:36,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:36:40,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:36:44,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:36:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:50,068 INFO L93 Difference]: Finished difference Result 2343 states and 3404 transitions. [2023-11-29 01:36:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:36:50,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2023-11-29 01:36:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:50,084 INFO L225 Difference]: With dead ends: 2343 [2023-11-29 01:36:50,084 INFO L226 Difference]: Without dead ends: 1622 [2023-11-29 01:36:50,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:36:50,089 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 2775 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 2562 mSolverCounterSat, 1632 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2916 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 4199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1632 IncrementalHoareTripleChecker+Valid, 2562 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:50,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2916 Valid, 618 Invalid, 4199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1632 Valid, 2562 Invalid, 5 Unknown, 0 Unchecked, 25.4s Time] [2023-11-29 01:36:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2023-11-29 01:36:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1434. [2023-11-29 01:36:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1003 states have (on average 1.4107676969092722) internal successors, (1415), 1034 states have internal predecessors, (1415), 333 states have call successors, (333), 98 states have call predecessors, (333), 97 states have return successors, (327), 327 states have call predecessors, (327), 327 states have call successors, (327) [2023-11-29 01:36:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2075 transitions. [2023-11-29 01:36:50,206 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2075 transitions. Word has length 30 [2023-11-29 01:36:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:50,207 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 2075 transitions. [2023-11-29 01:36:50,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 01:36:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2075 transitions. [2023-11-29 01:36:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 01:36:50,212 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:50,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:50,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:36:50,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:36:50,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 225543005, now seen corresponding path program 1 times [2023-11-29 01:36:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575329968] [2023-11-29 01:36:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:50,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:37:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:37:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:37:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:37:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:37:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:37:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:03,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:37:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:37:03,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575329968] [2023-11-29 01:37:03,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575329968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:03,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:03,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:37:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973039916] [2023-11-29 01:37:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:03,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:37:03,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:37:03,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:37:03,029 INFO L87 Difference]: Start difference. First operand 1434 states and 2075 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:37:07,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:37:11,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:37:15,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:37:19,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:37:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:37:22,670 INFO L93 Difference]: Finished difference Result 1620 states and 2355 transitions. [2023-11-29 01:37:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:37:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2023-11-29 01:37:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:37:22,679 INFO L225 Difference]: With dead ends: 1620 [2023-11-29 01:37:22,680 INFO L226 Difference]: Without dead ends: 1617 [2023-11-29 01:37:22,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:37:22,681 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 1653 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 898 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:37:22,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 581 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 2162 Invalid, 4 Unknown, 0 Unchecked, 19.4s Time] [2023-11-29 01:37:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2023-11-29 01:37:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1433. [2023-11-29 01:37:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1003 states have (on average 1.4097706879361915) internal successors, (1414), 1033 states have internal predecessors, (1414), 332 states have call successors, (332), 98 states have call predecessors, (332), 97 states have return successors, (327), 327 states have call predecessors, (327), 327 states have call successors, (327) [2023-11-29 01:37:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2073 transitions. [2023-11-29 01:37:22,792 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2073 transitions. Word has length 47 [2023-11-29 01:37:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:37:22,793 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 2073 transitions. [2023-11-29 01:37:22,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:37:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2073 transitions. [2023-11-29 01:37:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 01:37:22,797 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:37:22,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:22,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:37:22,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:37:22,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:22,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1598289268, now seen corresponding path program 1 times [2023-11-29 01:37:22,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:22,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151907149] [2023-11-29 01:37:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:35,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:37:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:35,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:37:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:37:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:35,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:37:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:37:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:35,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:37:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:35,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:37:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:37:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:35,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151907149] [2023-11-29 01:37:35,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151907149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:35,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:35,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:37:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304461438] [2023-11-29 01:37:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:35,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:37:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:37:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:37:35,842 INFO L87 Difference]: Start difference. First operand 1433 states and 2073 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:37:39,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:37:43,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:37:47,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:37:51,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:37:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:37:55,107 INFO L93 Difference]: Finished difference Result 1619 states and 2353 transitions. [2023-11-29 01:37:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:37:55,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-29 01:37:55,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:37:55,116 INFO L225 Difference]: With dead ends: 1619 [2023-11-29 01:37:55,116 INFO L226 Difference]: Without dead ends: 1616 [2023-11-29 01:37:55,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:37:55,118 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1644 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 890 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 3062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 890 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:37:55,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 577 Invalid, 3062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [890 Valid, 2168 Invalid, 4 Unknown, 0 Unchecked, 19.1s Time] [2023-11-29 01:37:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2023-11-29 01:37:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1432. [2023-11-29 01:37:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1003 states have (on average 1.4087736789631107) internal successors, (1413), 1032 states have internal predecessors, (1413), 331 states have call successors, (331), 98 states have call predecessors, (331), 97 states have return successors, (327), 327 states have call predecessors, (327), 327 states have call successors, (327) [2023-11-29 01:37:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2071 transitions. [2023-11-29 01:37:55,192 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2071 transitions. Word has length 48 [2023-11-29 01:37:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:37:55,193 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 2071 transitions. [2023-11-29 01:37:55,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:37:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2071 transitions. [2023-11-29 01:37:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 01:37:55,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:37:55,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:55,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:37:55,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:37:55,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1992457280, now seen corresponding path program 1 times [2023-11-29 01:37:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:55,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982377009] [2023-11-29 01:37:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:55,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:38:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:07,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:38:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:38:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:38:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:38:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:08,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:38:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:38:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:38:08,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:08,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982377009] [2023-11-29 01:38:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982377009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:08,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:38:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062596793] [2023-11-29 01:38:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:08,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:38:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:38:08,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:38:08,027 INFO L87 Difference]: Start difference. First operand 1432 states and 2071 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:38:12,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:38:16,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:38:20,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:38:24,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:38:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:38:27,451 INFO L93 Difference]: Finished difference Result 1618 states and 2351 transitions. [2023-11-29 01:38:27,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:38:27,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2023-11-29 01:38:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:38:27,459 INFO L225 Difference]: With dead ends: 1618 [2023-11-29 01:38:27,459 INFO L226 Difference]: Without dead ends: 1615 [2023-11-29 01:38:27,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:38:27,461 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 1653 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 898 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:38:27,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 571 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 2155 Invalid, 4 Unknown, 0 Unchecked, 19.2s Time] [2023-11-29 01:38:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2023-11-29 01:38:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1431. [2023-11-29 01:38:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1003 states have (on average 1.4077766699900298) internal successors, (1412), 1031 states have internal predecessors, (1412), 330 states have call successors, (330), 98 states have call predecessors, (330), 97 states have return successors, (327), 327 states have call predecessors, (327), 327 states have call successors, (327) [2023-11-29 01:38:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2069 transitions. [2023-11-29 01:38:27,542 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2069 transitions. Word has length 49 [2023-11-29 01:38:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:38:27,542 INFO L495 AbstractCegarLoop]: Abstraction has 1431 states and 2069 transitions. [2023-11-29 01:38:27,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:38:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2069 transitions. [2023-11-29 01:38:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 01:38:27,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:38:27,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:38:27,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:38:27,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:38:27,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:27,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1636455439, now seen corresponding path program 1 times [2023-11-29 01:38:27,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:27,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652886125] [2023-11-29 01:38:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:40,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:38:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:38:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:38:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:38:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:40,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:38:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:38:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:38:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 01:38:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652886125] [2023-11-29 01:38:40,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652886125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:40,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:40,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:38:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108371599] [2023-11-29 01:38:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:40,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:38:40,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:38:40,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:38:40,491 INFO L87 Difference]: Start difference. First operand 1431 states and 2069 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:38:44,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:38:48,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:38:52,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:38:56,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:39:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:39:01,382 INFO L93 Difference]: Finished difference Result 4617 states and 6718 transitions. [2023-11-29 01:39:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:39:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-11-29 01:39:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:39:01,399 INFO L225 Difference]: With dead ends: 4617 [2023-11-29 01:39:01,399 INFO L226 Difference]: Without dead ends: 3197 [2023-11-29 01:39:01,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:39:01,405 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 2793 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 1627 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2932 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 4180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1627 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:39:01,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2932 Valid, 665 Invalid, 4180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1627 Valid, 2549 Invalid, 4 Unknown, 0 Unchecked, 20.5s Time] [2023-11-29 01:39:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2023-11-29 01:39:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2827. [2023-11-29 01:39:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 1984 states have (on average 1.408266129032258) internal successors, (2794), 2038 states have internal predecessors, (2794), 653 states have call successors, (653), 192 states have call predecessors, (653), 189 states have return successors, (650), 648 states have call predecessors, (650), 650 states have call successors, (650) [2023-11-29 01:39:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4097 transitions. [2023-11-29 01:39:01,637 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4097 transitions. Word has length 50 [2023-11-29 01:39:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:39:01,638 INFO L495 AbstractCegarLoop]: Abstraction has 2827 states and 4097 transitions. [2023-11-29 01:39:01,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:39:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4097 transitions. [2023-11-29 01:39:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-29 01:39:01,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:39:01,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:39:01,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:39:01,642 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:39:01,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:39:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1828950452, now seen corresponding path program 1 times [2023-11-29 01:39:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:39:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109900367] [2023-11-29 01:39:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:39:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:39:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:39:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:39:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:39:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:39:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 01:39:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:39:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 01:39:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:39:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:39:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 01:39:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:39:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:39:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 01:39:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:39:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:39:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:39:15,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109900367] [2023-11-29 01:39:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109900367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:39:15,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:39:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:39:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107488496] [2023-11-29 01:39:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:39:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:39:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:39:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:39:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:39:15,076 INFO L87 Difference]: Start difference. First operand 2827 states and 4097 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 01:39:19,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:39:23,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:39:27,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:39:31,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:39:35,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:39:39,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:39:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:39:43,625 INFO L93 Difference]: Finished difference Result 6268 states and 9138 transitions. [2023-11-29 01:39:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:39:43,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 80 [2023-11-29 01:39:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:39:43,644 INFO L225 Difference]: With dead ends: 6268 [2023-11-29 01:39:43,644 INFO L226 Difference]: Without dead ends: 3457 [2023-11-29 01:39:43,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:39:43,654 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 1382 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 845 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 4133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:39:43,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 727 Invalid, 4133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 3282 Invalid, 6 Unknown, 0 Unchecked, 28.1s Time] [2023-11-29 01:39:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2023-11-29 01:39:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 2881. [2023-11-29 01:39:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 2037 states have (on average 1.4079528718703977) internal successors, (2868), 2091 states have internal predecessors, (2868), 653 states have call successors, (653), 193 states have call predecessors, (653), 190 states have return successors, (650), 648 states have call predecessors, (650), 650 states have call successors, (650) [2023-11-29 01:39:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4171 transitions. [2023-11-29 01:39:43,861 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4171 transitions. Word has length 80 [2023-11-29 01:39:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:39:43,861 INFO L495 AbstractCegarLoop]: Abstraction has 2881 states and 4171 transitions. [2023-11-29 01:39:43,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 01:39:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4171 transitions. [2023-11-29 01:39:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 01:39:43,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:39:43,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:39:43,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:39:43,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:39:43,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:39:43,866 INFO L85 PathProgramCache]: Analyzing trace with hash 339230239, now seen corresponding path program 1 times [2023-11-29 01:39:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:39:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274162943] [2023-11-29 01:39:43,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:39:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:39:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:39:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:39:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:39:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:39:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:39:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:39:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:39:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:39:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 01:39:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:39:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:39:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:39:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 01:39:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:39:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:39:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:39:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:39:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 01:39:57,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:39:57,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274162943] [2023-11-29 01:39:57,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274162943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:39:57,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:39:57,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:39:57,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556826741] [2023-11-29 01:39:57,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:39:57,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:39:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:39:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:39:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:39:57,883 INFO L87 Difference]: Start difference. First operand 2881 states and 4171 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 01:40:01,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:05,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:09,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:13,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:18,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:22,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:26,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:30,590 INFO L93 Difference]: Finished difference Result 4644 states and 6742 transitions. [2023-11-29 01:40:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:40:30,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2023-11-29 01:40:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:30,600 INFO L225 Difference]: With dead ends: 4644 [2023-11-29 01:40:30,600 INFO L226 Difference]: Without dead ends: 1782 [2023-11-29 01:40:30,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:40:30,609 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 1239 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3770 mSolverCounterSat, 677 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 4454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 3770 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:30,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 886 Invalid, 4454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 3770 Invalid, 7 Unknown, 0 Unchecked, 32.4s Time] [2023-11-29 01:40:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2023-11-29 01:40:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1490. [2023-11-29 01:40:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1055 states have (on average 1.4028436018957346) internal successors, (1480), 1083 states have internal predecessors, (1480), 333 states have call successors, (333), 103 states have call predecessors, (333), 101 states have return successors, (330), 329 states have call predecessors, (330), 330 states have call successors, (330) [2023-11-29 01:40:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2143 transitions. [2023-11-29 01:40:30,731 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2143 transitions. Word has length 103 [2023-11-29 01:40:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:30,731 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 2143 transitions. [2023-11-29 01:40:30,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 01:40:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2143 transitions. [2023-11-29 01:40:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 01:40:30,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:30,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:30,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:40:30,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:40:30,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -340042015, now seen corresponding path program 1 times [2023-11-29 01:40:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:40:30,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431868626] [2023-11-29 01:40:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:40:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:40:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:40:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:40:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:40:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:40:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:40:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:40:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:40:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 01:40:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:40:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:40:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:40:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 01:40:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:40:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:40:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:40:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:40:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 01:40:44,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:44,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431868626] [2023-11-29 01:40:44,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431868626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:40:44,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:40:44,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:40:44,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209240609] [2023-11-29 01:40:44,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:40:44,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:40:44,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:40:44,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:40:44,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:40:44,283 INFO L87 Difference]: Start difference. First operand 1490 states and 2143 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 01:40:48,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:52,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:56,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:00,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:04,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:08,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:12,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:41:17,250 INFO L93 Difference]: Finished difference Result 3241 states and 4701 transitions. [2023-11-29 01:41:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:41:17,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2023-11-29 01:41:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:41:17,259 INFO L225 Difference]: With dead ends: 3241 [2023-11-29 01:41:17,259 INFO L226 Difference]: Without dead ends: 1784 [2023-11-29 01:41:17,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:41:17,265 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 1170 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 4364 mSolverCounterSat, 650 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 5021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 4364 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:41:17,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 979 Invalid, 5021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 4364 Invalid, 7 Unknown, 0 Unchecked, 32.7s Time] [2023-11-29 01:41:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2023-11-29 01:41:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1494. [2023-11-29 01:41:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1059 states have (on average 1.4013220018885741) internal successors, (1484), 1087 states have internal predecessors, (1484), 333 states have call successors, (333), 103 states have call predecessors, (333), 101 states have return successors, (330), 329 states have call predecessors, (330), 330 states have call successors, (330) [2023-11-29 01:41:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2147 transitions. [2023-11-29 01:41:17,378 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2147 transitions. Word has length 103 [2023-11-29 01:41:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:41:17,379 INFO L495 AbstractCegarLoop]: Abstraction has 1494 states and 2147 transitions. [2023-11-29 01:41:17,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 01:41:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2147 transitions. [2023-11-29 01:41:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 01:41:17,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:41:17,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:41:17,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:41:17,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:41:17,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:41:17,383 INFO L85 PathProgramCache]: Analyzing trace with hash -858906189, now seen corresponding path program 1 times [2023-11-29 01:41:17,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:41:17,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143874416] [2023-11-29 01:41:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:41:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:41:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:41:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:41:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:41:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:41:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:41:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:41:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:41:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:41:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 01:41:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:41:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:41:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:41:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 01:41:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:41:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:41:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:41:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:41:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:41:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 01:41:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 01:41:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:41:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143874416] [2023-11-29 01:41:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143874416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:41:31,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:41:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:41:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912944225] [2023-11-29 01:41:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:41:31,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:41:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:41:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:41:31,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:41:31,459 INFO L87 Difference]: Start difference. First operand 1494 states and 2147 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 8 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 01:41:35,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:39,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:43,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:47,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:51,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:55,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:41:59,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:03,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:42:10,741 INFO L93 Difference]: Finished difference Result 3241 states and 4696 transitions. [2023-11-29 01:42:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:42:10,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 8 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 116 [2023-11-29 01:42:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:42:10,753 INFO L225 Difference]: With dead ends: 3241 [2023-11-29 01:42:10,753 INFO L226 Difference]: Without dead ends: 1780 [2023-11-29 01:42:10,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:42:10,759 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 2783 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 5489 mSolverCounterSat, 1825 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2821 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 7322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1825 IncrementalHoareTripleChecker+Valid, 5489 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:42:10,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2821 Valid, 1394 Invalid, 7322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1825 Valid, 5489 Invalid, 8 Unknown, 0 Unchecked, 38.8s Time] [2023-11-29 01:42:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2023-11-29 01:42:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1494. [2023-11-29 01:42:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1059 states have (on average 1.3994334277620397) internal successors, (1482), 1087 states have internal predecessors, (1482), 333 states have call successors, (333), 103 states have call predecessors, (333), 101 states have return successors, (329), 329 states have call predecessors, (329), 329 states have call successors, (329) [2023-11-29 01:42:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2144 transitions. [2023-11-29 01:42:10,888 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2144 transitions. Word has length 116 [2023-11-29 01:42:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:42:10,888 INFO L495 AbstractCegarLoop]: Abstraction has 1494 states and 2144 transitions. [2023-11-29 01:42:10,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 8 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 01:42:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2144 transitions. [2023-11-29 01:42:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 01:42:10,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:42:10,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:10,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:42:10,892 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:42:10,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash -143846969, now seen corresponding path program 1 times [2023-11-29 01:42:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:42:10,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908654335] [2023-11-29 01:42:10,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:10,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:42:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:42:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:42:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:42:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:42:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:42:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:42:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:42:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:42:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 01:42:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:42:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:24,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:42:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:42:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 01:42:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:42:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:42:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:42:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:42:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:42:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 01:42:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:42:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 01:42:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:42:25,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908654335] [2023-11-29 01:42:25,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908654335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:25,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:25,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 01:42:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901238002] [2023-11-29 01:42:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:25,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:42:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:42:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:42:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:42:25,271 INFO L87 Difference]: Start difference. First operand 1494 states and 2144 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:42:29,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:33,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:37,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:41,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:45,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:49,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:53,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:42:57,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:01,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:05,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:09,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:17,604 INFO L93 Difference]: Finished difference Result 3503 states and 5116 transitions. [2023-11-29 01:43:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:43:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2023-11-29 01:43:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:17,617 INFO L225 Difference]: With dead ends: 3503 [2023-11-29 01:43:17,617 INFO L226 Difference]: Without dead ends: 2042 [2023-11-29 01:43:17,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:43:17,623 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 1291 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 8473 mSolverCounterSat, 632 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 2973 SdHoareTripleChecker+Invalid, 9116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 8473 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:17,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 2973 Invalid, 9116 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [632 Valid, 8473 Invalid, 11 Unknown, 0 Unchecked, 51.9s Time] [2023-11-29 01:43:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2023-11-29 01:43:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1492. [2023-11-29 01:43:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1058 states have (on average 1.3979206049149338) internal successors, (1479), 1085 states have internal predecessors, (1479), 332 states have call successors, (332), 103 states have call predecessors, (332), 101 states have return successors, (329), 329 states have call predecessors, (329), 329 states have call successors, (329) [2023-11-29 01:43:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2140 transitions. [2023-11-29 01:43:17,768 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2140 transitions. Word has length 120 [2023-11-29 01:43:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:17,769 INFO L495 AbstractCegarLoop]: Abstraction has 1492 states and 2140 transitions. [2023-11-29 01:43:17,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:43:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2140 transitions. [2023-11-29 01:43:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 01:43:17,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:17,773 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:17,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:43:17,774 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:43:17,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash -875744799, now seen corresponding path program 1 times [2023-11-29 01:43:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:43:17,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613246883] [2023-11-29 01:43:17,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:17,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:43:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:30,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:43:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:43:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:43:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:43:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:43:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:30,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:43:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:43:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:43:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 01:43:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:43:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:43:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:43:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 01:43:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:43:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:43:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:43:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:43:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:43:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 01:43:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:43:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 01:43:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 01:43:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 01:43:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 01:43:31,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:43:31,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613246883] [2023-11-29 01:43:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613246883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:31,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:43:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989684038] [2023-11-29 01:43:31,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:31,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:43:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:43:31,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:43:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:43:31,270 INFO L87 Difference]: Start difference. First operand 1492 states and 2140 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 01:43:35,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:39,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:43,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:47,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:51,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:55,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:43:59,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:03,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:07,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:44:13,799 INFO L93 Difference]: Finished difference Result 2775 states and 4062 transitions. [2023-11-29 01:44:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:44:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 151 [2023-11-29 01:44:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:44:13,808 INFO L225 Difference]: With dead ends: 2775 [2023-11-29 01:44:13,809 INFO L226 Difference]: Without dead ends: 2045 [2023-11-29 01:44:13,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:44:13,812 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 2002 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 4890 mSolverCounterSat, 1467 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2036 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 6366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1467 IncrementalHoareTripleChecker+Valid, 4890 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:44:13,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2036 Valid, 1882 Invalid, 6366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1467 Valid, 4890 Invalid, 9 Unknown, 0 Unchecked, 42.2s Time] [2023-11-29 01:44:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2023-11-29 01:44:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1492. [2023-11-29 01:44:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1058 states have (on average 1.3969754253308129) internal successors, (1478), 1085 states have internal predecessors, (1478), 332 states have call successors, (332), 103 states have call predecessors, (332), 101 states have return successors, (329), 329 states have call predecessors, (329), 329 states have call successors, (329) [2023-11-29 01:44:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2139 transitions. [2023-11-29 01:44:13,914 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2139 transitions. Word has length 151 [2023-11-29 01:44:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:44:13,915 INFO L495 AbstractCegarLoop]: Abstraction has 1492 states and 2139 transitions. [2023-11-29 01:44:13,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 01:44:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2139 transitions. [2023-11-29 01:44:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 01:44:13,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:44:13,918 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:44:13,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:44:13,919 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:44:13,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1718465991, now seen corresponding path program 1 times [2023-11-29 01:44:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:44:13,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574714302] [2023-11-29 01:44:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:44:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:44:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:44:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:44:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:44:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:44:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:44:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:44:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 01:44:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:44:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 01:44:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:44:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:44:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:44:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 01:44:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:44:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:44:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:44:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:44:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:44:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 01:44:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 01:44:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 01:44:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 01:44:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 01:44:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:44:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574714302] [2023-11-29 01:44:26,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574714302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:44:26,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:44:26,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:44:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761332951] [2023-11-29 01:44:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:44:26,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:44:26,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:44:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:44:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:44:26,655 INFO L87 Difference]: Start difference. First operand 1492 states and 2139 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:44:30,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:34,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:38,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:42,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:46,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:50,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:54,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:44:58,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:45:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:45:03,268 INFO L93 Difference]: Finished difference Result 1640 states and 2367 transitions. [2023-11-29 01:45:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:45:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 151 [2023-11-29 01:45:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:45:03,269 INFO L225 Difference]: With dead ends: 1640 [2023-11-29 01:45:03,269 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:45:03,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:45:03,274 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 1722 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 3821 mSolverCounterSat, 1208 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 5037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1208 IncrementalHoareTripleChecker+Valid, 3821 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:45:03,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 945 Invalid, 5037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1208 Valid, 3821 Invalid, 8 Unknown, 0 Unchecked, 36.4s Time] [2023-11-29 01:45:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:45:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:45:03,275 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) [2023-11-29 01:45:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:45:03,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 151 [2023-11-29 01:45:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:45:03,275 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:45:03,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (21), 8 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:45:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:45:03,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:45:03,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:45:03,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:45:03,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.