./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:11:25,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:11:25,446 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:11:25,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:11:25,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:11:25,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:11:25,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:11:25,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:11:25,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:11:25,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:11:25,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:11:25,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:11:25,504 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:11:25,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:11:25,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:11:25,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:11:25,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:11:25,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:11:25,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:11:25,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:11:25,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:11:25,510 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:11:25,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:11:25,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:11:25,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:11:25,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:25,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:11:25,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:11:25,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:11:25,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:11:25,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:11:25,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:11:25,517 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:11:25,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:11:25,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:11:25,517 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:11:25,518 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_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/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_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2023-11-06 22:11:25,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:11:25,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:11:25,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:11:25,874 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:11:25,875 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:11:25,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2023-11-06 22:11:29,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:11:29,749 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:11:29,750 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2023-11-06 22:11:29,816 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/data/e3da43237/48f7b1fb57404b9490926a8778ff4a51/FLAGbedcd963e [2023-11-06 22:11:29,837 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/data/e3da43237/48f7b1fb57404b9490926a8778ff4a51 [2023-11-06 22:11:29,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:11:29,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:11:29,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:29,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:11:29,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:11:29,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:29" (1/1) ... [2023-11-06 22:11:29,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6c495c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:29, skipping insertion in model container [2023-11-06 22:11:29,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:29" (1/1) ... [2023-11-06 22:11:30,013 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:11:31,362 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_7a987797-0f23-4c54-ba26-8d29801abc7d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2023-11-06 22:11:31,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:31,488 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:11:31,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4831-4837] [2023-11-06 22:11:31,604 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4844-4850] [2023-11-06 22:11:31,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %2,%1\n\t" "sbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4857-4864] [2023-11-06 22:11:31,610 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "incl %0": "+m" (v->counter)); [4894-4900] [2023-11-06 22:11:31,611 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "decl %0": "+m" (v->counter)); [4907-4913] [2023-11-06 22:11:31,689 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n" ".pushsection __bug_table,\"a\"\n" "2:\t.long 1b - 2b, %c0 - 2b\n" "\t.word %c1, 0\n" "\t.org 2b+%c2\n" ".popsection": : "i" ("/anthill/stuff/tacas-comp/work/current--X--drivers/net/can/usb/ems_usb.ko--X--bulklinux-3.0.1--X--68_1/linux-3.0.1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/68_1/drivers/net/can/usb/ems_usb.c.common.c"), "i" (510), "i" (sizeof(struct bug_entry ))); [5717-5723] [2023-11-06 22:11:31,839 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_7a987797-0f23-4c54-ba26-8d29801abc7d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2023-11-06 22:11:31,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:32,069 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:11:32,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32 WrapperNode [2023-11-06 22:11:32,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:32,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:32,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:11:32,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:11:32,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,249 INFO L138 Inliner]: procedures = 133, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1512 [2023-11-06 22:11:32,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:32,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:11:32,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:11:32,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:11:32,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:11:32,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:11:32,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:11:32,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:11:32,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (1/1) ... [2023-11-06 22:11:32,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:32,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:32,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:11:32,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:11:32,503 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2023-11-06 22:11:32,503 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2023-11-06 22:11:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2023-11-06 22:11:32,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2023-11-06 22:11:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-06 22:11:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2023-11-06 22:11:32,505 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2023-11-06 22:11:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-06 22:11:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-06 22:11:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:11:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2023-11-06 22:11:32,506 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2023-11-06 22:11:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2023-11-06 22:11:32,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2023-11-06 22:11:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2023-11-06 22:11:32,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2023-11-06 22:11:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-06 22:11:32,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-06 22:11:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2023-11-06 22:11:32,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2023-11-06 22:11:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2023-11-06 22:11:32,509 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2023-11-06 22:11:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-06 22:11:32,509 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-06 22:11:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2023-11-06 22:11:32,510 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2023-11-06 22:11:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:11:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2023-11-06 22:11:32,510 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2023-11-06 22:11:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2023-11-06 22:11:32,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2023-11-06 22:11:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2023-11-06 22:11:32,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2023-11-06 22:11:32,511 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2023-11-06 22:11:32,512 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2023-11-06 22:11:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2023-11-06 22:11:32,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2023-11-06 22:11:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:11:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2023-11-06 22:11:32,513 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2023-11-06 22:11:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:11:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2023-11-06 22:11:32,513 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2023-11-06 22:11:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:11:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:11:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2023-11-06 22:11:32,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2023-11-06 22:11:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2023-11-06 22:11:32,515 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2023-11-06 22:11:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2023-11-06 22:11:32,515 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2023-11-06 22:11:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:11:32,515 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2023-11-06 22:11:32,516 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2023-11-06 22:11:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2023-11-06 22:11:32,516 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2023-11-06 22:11:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2023-11-06 22:11:32,516 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2023-11-06 22:11:32,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2023-11-06 22:11:32,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2023-11-06 22:11:32,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:11:32,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:11:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-06 22:11:32,518 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-06 22:11:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-06 22:11:32,518 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-06 22:11:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-06 22:11:32,519 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-06 22:11:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2023-11-06 22:11:32,519 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2023-11-06 22:11:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2023-11-06 22:11:32,520 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2023-11-06 22:11:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2023-11-06 22:11:32,520 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2023-11-06 22:11:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2023-11-06 22:11:32,520 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2023-11-06 22:11:32,521 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2023-11-06 22:11:32,521 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2023-11-06 22:11:32,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2023-11-06 22:11:32,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2023-11-06 22:11:32,521 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2023-11-06 22:11:32,522 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2023-11-06 22:11:32,522 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2023-11-06 22:11:32,522 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2023-11-06 22:11:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:11:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2023-11-06 22:11:32,523 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2023-11-06 22:11:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2023-11-06 22:11:32,523 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2023-11-06 22:11:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-06 22:11:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:11:32,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:11:33,001 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:11:33,005 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:11:33,546 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2023-11-06 22:11:33,798 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 22:11:36,173 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2023-11-06 22:11:36,173 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2023-11-06 22:11:36,235 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:11:36,257 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:11:36,257 INFO L302 CfgBuilder]: Removed 13 assume(true) statements. [2023-11-06 22:11:36,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:36 BoogieIcfgContainer [2023-11-06 22:11:36,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:11:36,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:11:36,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:11:36,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:11:36,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:11:29" (1/3) ... [2023-11-06 22:11:36,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b701c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:36, skipping insertion in model container [2023-11-06 22:11:36,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:32" (2/3) ... [2023-11-06 22:11:36,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b701c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:36, skipping insertion in model container [2023-11-06 22:11:36,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:36" (3/3) ... [2023-11-06 22:11:36,276 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2023-11-06 22:11:36,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:11:36,299 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:11:36,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:11:36,406 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f9688ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:11:36,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:11:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 510 states, 359 states have (on average 1.3537604456824512) internal successors, (486), 371 states have internal predecessors, (486), 112 states have call successors, (112), 38 states have call predecessors, (112), 37 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2023-11-06 22:11:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:11:36,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:36,426 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] [2023-11-06 22:11:36,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:36,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1685815341, now seen corresponding path program 1 times [2023-11-06 22:11:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311307406] [2023-11-06 22:11:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:38,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:11:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:38,959 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-06 22:11:38,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311307406] [2023-11-06 22:11:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311307406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:11:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93621182] [2023-11-06 22:11:38,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:38,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:11:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:11:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:39,027 INFO L87 Difference]: Start difference. First operand has 510 states, 359 states have (on average 1.3537604456824512) internal successors, (486), 371 states have internal predecessors, (486), 112 states have call successors, (112), 38 states have call predecessors, (112), 37 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:11:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:39,252 INFO L93 Difference]: Finished difference Result 1011 states and 1429 transitions. [2023-11-06 22:11:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:11:39,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-11-06 22:11:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:39,283 INFO L225 Difference]: With dead ends: 1011 [2023-11-06 22:11:39,283 INFO L226 Difference]: Without dead ends: 508 [2023-11-06 22:11:39,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:39,295 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 283 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:39,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 2286 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:11:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-11-06 22:11:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 503. [2023-11-06 22:11:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 355 states have (on average 1.2535211267605635) internal successors, (445), 363 states have internal predecessors, (445), 110 states have call successors, (110), 37 states have call predecessors, (110), 37 states have return successors, (107), 105 states have call predecessors, (107), 106 states have call successors, (107) [2023-11-06 22:11:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 662 transitions. [2023-11-06 22:11:39,422 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 662 transitions. Word has length 21 [2023-11-06 22:11:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:39,424 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 662 transitions. [2023-11-06 22:11:39,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:11:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 662 transitions. [2023-11-06 22:11:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:11:39,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:39,427 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:39,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:11:39,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:39,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 58344601, now seen corresponding path program 1 times [2023-11-06 22:11:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852984059] [2023-11-06 22:11:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:39,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:11:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:40,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:11:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:11:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:40,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852984059] [2023-11-06 22:11:40,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852984059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:40,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:40,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:11:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045283646] [2023-11-06 22:11:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:40,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:40,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:40,835 INFO L87 Difference]: Start difference. First operand 503 states and 662 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:11:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:41,000 INFO L93 Difference]: Finished difference Result 1465 states and 1943 transitions. [2023-11-06 22:11:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:41,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-06 22:11:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:41,011 INFO L225 Difference]: With dead ends: 1465 [2023-11-06 22:11:41,011 INFO L226 Difference]: Without dead ends: 982 [2023-11-06 22:11:41,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:41,015 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 646 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:41,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1359 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:11:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2023-11-06 22:11:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 978. [2023-11-06 22:11:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 692 states have (on average 1.254335260115607) internal successors, (868), 704 states have internal predecessors, (868), 213 states have call successors, (213), 72 states have call predecessors, (213), 72 states have return successors, (213), 206 states have call predecessors, (213), 209 states have call successors, (213) [2023-11-06 22:11:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1294 transitions. [2023-11-06 22:11:41,117 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1294 transitions. Word has length 26 [2023-11-06 22:11:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:41,117 INFO L495 AbstractCegarLoop]: Abstraction has 978 states and 1294 transitions. [2023-11-06 22:11:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:11:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1294 transitions. [2023-11-06 22:11:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:11:41,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:41,119 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:11:41,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:11:41,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:41,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1808419966, now seen corresponding path program 1 times [2023-11-06 22:11:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:41,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449555823] [2023-11-06 22:11:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:42,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:11:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:42,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:42,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:11:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:11:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:42,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449555823] [2023-11-06 22:11:42,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449555823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:42,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:42,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:11:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719774833] [2023-11-06 22:11:42,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:42,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:42,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:42,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:42,148 INFO L87 Difference]: Start difference. First operand 978 states and 1294 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:11:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:42,305 INFO L93 Difference]: Finished difference Result 2891 states and 3841 transitions. [2023-11-06 22:11:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:42,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-06 22:11:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:42,322 INFO L225 Difference]: With dead ends: 2891 [2023-11-06 22:11:42,322 INFO L226 Difference]: Without dead ends: 1925 [2023-11-06 22:11:42,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:42,328 INFO L413 NwaCegarLoop]: 676 mSDtfsCounter, 645 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:42,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1309 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:11:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2023-11-06 22:11:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1914. [2023-11-06 22:11:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1355 states have (on average 1.2523985239852398) internal successors, (1697), 1374 states have internal predecessors, (1697), 418 states have call successors, (418), 141 states have call predecessors, (418), 140 states have return successors, (424), 406 states have call predecessors, (424), 414 states have call successors, (424) [2023-11-06 22:11:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2539 transitions. [2023-11-06 22:11:42,495 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2539 transitions. Word has length 27 [2023-11-06 22:11:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:42,495 INFO L495 AbstractCegarLoop]: Abstraction has 1914 states and 2539 transitions. [2023-11-06 22:11:42,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:11:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2539 transitions. [2023-11-06 22:11:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:11:42,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:42,510 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:11:42,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:11:42,511 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:42,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash 790512092, now seen corresponding path program 1 times [2023-11-06 22:11:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:42,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994055241] [2023-11-06 22:11:42,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:11:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:11:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:11:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:11:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:11:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:11:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:11:43,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:43,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994055241] [2023-11-06 22:11:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994055241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:43,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:43,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:11:43,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690492624] [2023-11-06 22:11:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:43,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:11:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:11:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:43,713 INFO L87 Difference]: Start difference. First operand 1914 states and 2539 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:11:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:47,653 INFO L93 Difference]: Finished difference Result 4812 states and 6662 transitions. [2023-11-06 22:11:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:11:47,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2023-11-06 22:11:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:47,681 INFO L225 Difference]: With dead ends: 4812 [2023-11-06 22:11:47,681 INFO L226 Difference]: Without dead ends: 2913 [2023-11-06 22:11:47,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:47,691 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 532 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:47,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1412 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-06 22:11:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2023-11-06 22:11:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2789. [2023-11-06 22:11:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 1978 states have (on average 1.288675429726997) internal successors, (2549), 2013 states have internal predecessors, (2549), 670 states have call successors, (670), 141 states have call predecessors, (670), 140 states have return successors, (684), 650 states have call predecessors, (684), 666 states have call successors, (684) [2023-11-06 22:11:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3903 transitions. [2023-11-06 22:11:47,980 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3903 transitions. Word has length 76 [2023-11-06 22:11:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:47,981 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3903 transitions. [2023-11-06 22:11:47,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:11:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3903 transitions. [2023-11-06 22:11:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:11:47,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:47,986 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:11:47,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:11:47,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:47,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -271074147, now seen corresponding path program 1 times [2023-11-06 22:11:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721877041] [2023-11-06 22:11:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:11:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:11:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:11:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:11:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:11:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-06 22:11:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:11:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:49,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:49,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721877041] [2023-11-06 22:11:49,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721877041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:49,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:49,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:11:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437786443] [2023-11-06 22:11:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:49,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:11:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:11:49,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:49,153 INFO L87 Difference]: Start difference. First operand 2789 states and 3903 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:11:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:50,770 INFO L93 Difference]: Finished difference Result 5674 states and 8007 transitions. [2023-11-06 22:11:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:11:50,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2023-11-06 22:11:50,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:50,796 INFO L225 Difference]: With dead ends: 5674 [2023-11-06 22:11:50,797 INFO L226 Difference]: Without dead ends: 2901 [2023-11-06 22:11:50,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:11:50,809 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 285 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:50,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1645 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:11:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2023-11-06 22:11:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2823. [2023-11-06 22:11:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2006 states have (on average 1.2856430707876372) internal successors, (2579), 2043 states have internal predecessors, (2579), 670 states have call successors, (670), 141 states have call predecessors, (670), 146 states have return successors, (706), 654 states have call predecessors, (706), 666 states have call successors, (706) [2023-11-06 22:11:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 3955 transitions. [2023-11-06 22:11:51,025 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 3955 transitions. Word has length 78 [2023-11-06 22:11:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:51,026 INFO L495 AbstractCegarLoop]: Abstraction has 2823 states and 3955 transitions. [2023-11-06 22:11:51,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:11:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3955 transitions. [2023-11-06 22:11:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 22:11:51,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:51,032 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:11:51,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:11:51,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:51,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:51,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1016546078, now seen corresponding path program 1 times [2023-11-06 22:11:51,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:51,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039981488] [2023-11-06 22:11:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:11:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:11:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:11:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:11:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:11:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:11:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:11:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039981488] [2023-11-06 22:11:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039981488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:52,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:52,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:11:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780733964] [2023-11-06 22:11:52,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:52,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:11:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:11:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:11:52,418 INFO L87 Difference]: Start difference. First operand 2823 states and 3955 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:11:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:54,299 INFO L93 Difference]: Finished difference Result 7167 states and 10381 transitions. [2023-11-06 22:11:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:11:54,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2023-11-06 22:11:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:54,347 INFO L225 Difference]: With dead ends: 7167 [2023-11-06 22:11:54,347 INFO L226 Difference]: Without dead ends: 4360 [2023-11-06 22:11:54,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:11:54,364 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 488 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:54,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 2579 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 22:11:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2023-11-06 22:11:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 2839. [2023-11-06 22:11:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2022 states have (on average 1.2833827893175074) internal successors, (2595), 2059 states have internal predecessors, (2595), 670 states have call successors, (670), 141 states have call predecessors, (670), 146 states have return successors, (706), 654 states have call predecessors, (706), 666 states have call successors, (706) [2023-11-06 22:11:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3971 transitions. [2023-11-06 22:11:54,754 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3971 transitions. Word has length 79 [2023-11-06 22:11:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:54,755 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 3971 transitions. [2023-11-06 22:11:54,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:11:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3971 transitions. [2023-11-06 22:11:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 22:11:54,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:54,761 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:11:54,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:11:54,761 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:54,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1634162081, now seen corresponding path program 1 times [2023-11-06 22:11:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975709098] [2023-11-06 22:11:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:11:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:11:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:11:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:11:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:11:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:11:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:11:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:11:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:11:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:56,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975709098] [2023-11-06 22:11:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975709098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:56,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:11:56,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296423146] [2023-11-06 22:11:56,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:56,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:11:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:56,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:11:56,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:11:56,602 INFO L87 Difference]: Start difference. First operand 2839 states and 3971 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:11:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:59,559 INFO L93 Difference]: Finished difference Result 4331 states and 6128 transitions. [2023-11-06 22:11:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:11:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2023-11-06 22:11:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:59,586 INFO L225 Difference]: With dead ends: 4331 [2023-11-06 22:11:59,586 INFO L226 Difference]: Without dead ends: 2901 [2023-11-06 22:11:59,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:11:59,597 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 147 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:59,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 3261 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 22:11:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2023-11-06 22:11:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2853. [2023-11-06 22:11:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2032 states have (on average 1.281003937007874) internal successors, (2603), 2069 states have internal predecessors, (2603), 670 states have call successors, (670), 141 states have call predecessors, (670), 150 states have return successors, (718), 658 states have call predecessors, (718), 666 states have call successors, (718) [2023-11-06 22:11:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 3991 transitions. [2023-11-06 22:11:59,937 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 3991 transitions. Word has length 79 [2023-11-06 22:11:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:59,939 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 3991 transitions. [2023-11-06 22:11:59,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:11:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3991 transitions. [2023-11-06 22:11:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 22:11:59,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:59,943 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:11:59,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:11:59,943 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:59,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1963927842, now seen corresponding path program 1 times [2023-11-06 22:11:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061119213] [2023-11-06 22:11:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:59,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:12:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:12:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:12:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:12:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:01,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061119213] [2023-11-06 22:12:01,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061119213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:01,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:01,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:12:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545977020] [2023-11-06 22:12:01,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:01,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:12:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:01,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:12:01,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:12:01,685 INFO L87 Difference]: Start difference. First operand 2853 states and 3991 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:12:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:04,850 INFO L93 Difference]: Finished difference Result 5998 states and 8497 transitions. [2023-11-06 22:12:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:12:04,851 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2023-11-06 22:12:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:04,877 INFO L225 Difference]: With dead ends: 5998 [2023-11-06 22:12:04,877 INFO L226 Difference]: Without dead ends: 3161 [2023-11-06 22:12:04,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:12:04,889 INFO L413 NwaCegarLoop]: 608 mSDtfsCounter, 340 mSDsluCounter, 4343 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 4951 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:04,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 4951 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-06 22:12:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2023-11-06 22:12:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 2857. [2023-11-06 22:12:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2036 states have (on average 1.2784872298624754) internal successors, (2603), 2071 states have internal predecessors, (2603), 670 states have call successors, (670), 141 states have call predecessors, (670), 150 states have return successors, (718), 660 states have call predecessors, (718), 666 states have call successors, (718) [2023-11-06 22:12:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3991 transitions. [2023-11-06 22:12:05,153 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3991 transitions. Word has length 79 [2023-11-06 22:12:05,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:05,153 INFO L495 AbstractCegarLoop]: Abstraction has 2857 states and 3991 transitions. [2023-11-06 22:12:05,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:12:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3991 transitions. [2023-11-06 22:12:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-06 22:12:05,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:05,163 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:05,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:12:05,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:05,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1017714490, now seen corresponding path program 1 times [2023-11-06 22:12:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911420443] [2023-11-06 22:12:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:12:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:12:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:12:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,697 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-06 22:12:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911420443] [2023-11-06 22:12:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911420443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:12:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659740469] [2023-11-06 22:12:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:06,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:12:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:06,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:12:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:12:06,701 INFO L87 Difference]: Start difference. First operand 2857 states and 3991 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:12:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:09,003 INFO L93 Difference]: Finished difference Result 5508 states and 7691 transitions. [2023-11-06 22:12:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:12:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2023-11-06 22:12:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:09,026 INFO L225 Difference]: With dead ends: 5508 [2023-11-06 22:12:09,027 INFO L226 Difference]: Without dead ends: 2667 [2023-11-06 22:12:09,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:12:09,040 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 275 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:09,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2354 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:12:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2023-11-06 22:12:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2611. [2023-11-06 22:12:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 1866 states have (on average 1.2684887459807075) internal successors, (2367), 1885 states have internal predecessors, (2367), 594 states have call successors, (594), 139 states have call predecessors, (594), 150 states have return successors, (646), 594 states have call predecessors, (646), 590 states have call successors, (646) [2023-11-06 22:12:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3607 transitions. [2023-11-06 22:12:09,275 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3607 transitions. Word has length 85 [2023-11-06 22:12:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:09,275 INFO L495 AbstractCegarLoop]: Abstraction has 2611 states and 3607 transitions. [2023-11-06 22:12:09,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:12:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3607 transitions. [2023-11-06 22:12:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-06 22:12:09,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:09,280 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:09,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:12:09,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:09,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1733868827, now seen corresponding path program 1 times [2023-11-06 22:12:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:09,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149728851] [2023-11-06 22:12:09,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:09,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:12:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:12:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:12:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,909 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-06 22:12:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149728851] [2023-11-06 22:12:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149728851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:10,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:12:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442222710] [2023-11-06 22:12:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:12:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:12:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:12:10,913 INFO L87 Difference]: Start difference. First operand 2611 states and 3607 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-06 22:12:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:14,873 INFO L93 Difference]: Finished difference Result 4120 states and 5765 transitions. [2023-11-06 22:12:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:12:14,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 85 [2023-11-06 22:12:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:14,930 INFO L225 Difference]: With dead ends: 4120 [2023-11-06 22:12:14,931 INFO L226 Difference]: Without dead ends: 4115 [2023-11-06 22:12:14,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:12:14,935 INFO L413 NwaCegarLoop]: 775 mSDtfsCounter, 2170 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 964 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2315 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 964 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:14,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2315 Valid, 2814 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [964 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-06 22:12:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2023-11-06 22:12:15,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4031. [2023-11-06 22:12:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4031 states, 2879 states have (on average 1.2719694338311913) internal successors, (3662), 2914 states have internal predecessors, (3662), 924 states have call successors, (924), 207 states have call predecessors, (924), 227 states have return successors, (1046), 925 states have call predecessors, (1046), 920 states have call successors, (1046) [2023-11-06 22:12:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5632 transitions. [2023-11-06 22:12:15,265 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5632 transitions. Word has length 85 [2023-11-06 22:12:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:15,266 INFO L495 AbstractCegarLoop]: Abstraction has 4031 states and 5632 transitions. [2023-11-06 22:12:15,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-06 22:12:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5632 transitions. [2023-11-06 22:12:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 22:12:15,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:15,271 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:15,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:12:15,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:15,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1382953261, now seen corresponding path program 1 times [2023-11-06 22:12:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:15,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561397102] [2023-11-06 22:12:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:12:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:12:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:12:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:17,009 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-06 22:12:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561397102] [2023-11-06 22:12:17,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561397102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:12:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096696419] [2023-11-06 22:12:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:17,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:12:17,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:17,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:12:17,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:12:17,012 INFO L87 Difference]: Start difference. First operand 4031 states and 5632 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:12:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:19,275 INFO L93 Difference]: Finished difference Result 6755 states and 9471 transitions. [2023-11-06 22:12:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:12:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 93 [2023-11-06 22:12:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:19,297 INFO L225 Difference]: With dead ends: 6755 [2023-11-06 22:12:19,297 INFO L226 Difference]: Without dead ends: 3893 [2023-11-06 22:12:19,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:12:19,310 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 411 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:19,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2068 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-06 22:12:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2023-11-06 22:12:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3803. [2023-11-06 22:12:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 2717 states have (on average 1.2649981597350017) internal successors, (3437), 2739 states have internal predecessors, (3437), 860 states have call successors, (860), 205 states have call predecessors, (860), 225 states have return successors, (978), 870 states have call predecessors, (978), 856 states have call successors, (978) [2023-11-06 22:12:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 5275 transitions. [2023-11-06 22:12:19,711 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 5275 transitions. Word has length 93 [2023-11-06 22:12:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:19,712 INFO L495 AbstractCegarLoop]: Abstraction has 3803 states and 5275 transitions. [2023-11-06 22:12:19,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:12:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 5275 transitions. [2023-11-06 22:12:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 22:12:19,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:19,717 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:19,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:12:19,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:19,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1351933454, now seen corresponding path program 1 times [2023-11-06 22:12:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:19,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519088924] [2023-11-06 22:12:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:12:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:12:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:12:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:12:21,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519088924] [2023-11-06 22:12:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519088924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:21,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:21,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:12:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857776972] [2023-11-06 22:12:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:21,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:12:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:12:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:12:21,683 INFO L87 Difference]: Start difference. First operand 3803 states and 5275 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:12:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:25,132 INFO L93 Difference]: Finished difference Result 5897 states and 8227 transitions. [2023-11-06 22:12:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:12:25,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2023-11-06 22:12:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:25,154 INFO L225 Difference]: With dead ends: 5897 [2023-11-06 22:12:25,155 INFO L226 Difference]: Without dead ends: 3863 [2023-11-06 22:12:25,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:12:25,168 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 271 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:25,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 3201 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-06 22:12:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2023-11-06 22:12:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3815. [2023-11-06 22:12:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 2729 states have (on average 1.26383290582631) internal successors, (3449), 2745 states have internal predecessors, (3449), 860 states have call successors, (860), 205 states have call predecessors, (860), 225 states have return successors, (978), 876 states have call predecessors, (978), 856 states have call successors, (978) [2023-11-06 22:12:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 5287 transitions. [2023-11-06 22:12:25,524 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 5287 transitions. Word has length 93 [2023-11-06 22:12:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:25,525 INFO L495 AbstractCegarLoop]: Abstraction has 3815 states and 5287 transitions. [2023-11-06 22:12:25,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:12:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 5287 transitions. [2023-11-06 22:12:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 22:12:25,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:25,531 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:25,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:12:25,532 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:25,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 759356915, now seen corresponding path program 1 times [2023-11-06 22:12:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767554671] [2023-11-06 22:12:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:12:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:12:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:12:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,089 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-06 22:12:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767554671] [2023-11-06 22:12:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767554671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:27,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:12:27,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647264526] [2023-11-06 22:12:27,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:27,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:12:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:12:27,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:12:27,093 INFO L87 Difference]: Start difference. First operand 3815 states and 5287 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:12:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:29,296 INFO L93 Difference]: Finished difference Result 5519 states and 7720 transitions. [2023-11-06 22:12:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:12:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 93 [2023-11-06 22:12:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:29,319 INFO L225 Difference]: With dead ends: 5519 [2023-11-06 22:12:29,319 INFO L226 Difference]: Without dead ends: 4063 [2023-11-06 22:12:29,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:12:29,329 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 305 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:29,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1868 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:12:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2023-11-06 22:12:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 3823. [2023-11-06 22:12:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3823 states, 2737 states have (on average 1.2630617464377054) internal successors, (3457), 2753 states have internal predecessors, (3457), 860 states have call successors, (860), 205 states have call predecessors, (860), 225 states have return successors, (978), 876 states have call predecessors, (978), 856 states have call successors, (978) [2023-11-06 22:12:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 5295 transitions. [2023-11-06 22:12:29,683 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 5295 transitions. Word has length 93 [2023-11-06 22:12:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:29,684 INFO L495 AbstractCegarLoop]: Abstraction has 3823 states and 5295 transitions. [2023-11-06 22:12:29,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:12:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 5295 transitions. [2023-11-06 22:12:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-06 22:12:29,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:29,690 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:29,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:12:29,691 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:29,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1058090868, now seen corresponding path program 1 times [2023-11-06 22:12:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144701664] [2023-11-06 22:12:29,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:29,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:12:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:12:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:12:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:12:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:12:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:12:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:31,428 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-06 22:12:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:31,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144701664] [2023-11-06 22:12:31,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144701664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:31,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:31,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:12:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938635273] [2023-11-06 22:12:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:31,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:12:31,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:31,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:12:31,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:12:31,436 INFO L87 Difference]: Start difference. First operand 3823 states and 5295 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:12:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:35,672 INFO L93 Difference]: Finished difference Result 7028 states and 9758 transitions. [2023-11-06 22:12:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:12:35,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2023-11-06 22:12:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:35,691 INFO L225 Difference]: With dead ends: 7028 [2023-11-06 22:12:35,691 INFO L226 Difference]: Without dead ends: 3221 [2023-11-06 22:12:35,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:12:35,702 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 383 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:35,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 2855 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-06 22:12:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2023-11-06 22:12:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3174. [2023-11-06 22:12:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3174 states, 2281 states have (on average 1.2617273125822008) internal successors, (2878), 2289 states have internal predecessors, (2878), 709 states have call successors, (709), 166 states have call predecessors, (709), 183 states have return successors, (811), 730 states have call predecessors, (811), 705 states have call successors, (811) [2023-11-06 22:12:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4398 transitions. [2023-11-06 22:12:35,962 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4398 transitions. Word has length 106 [2023-11-06 22:12:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:35,963 INFO L495 AbstractCegarLoop]: Abstraction has 3174 states and 4398 transitions. [2023-11-06 22:12:35,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:12:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4398 transitions. [2023-11-06 22:12:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-06 22:12:35,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:35,968 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:35,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:12:35,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:35,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash -639343692, now seen corresponding path program 1 times [2023-11-06 22:12:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:35,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423213404] [2023-11-06 22:12:35,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:12:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:12:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:12:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:37,484 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-06 22:12:37,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423213404] [2023-11-06 22:12:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423213404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:12:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994327664] [2023-11-06 22:12:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:37,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:12:37,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:37,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:12:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:12:37,488 INFO L87 Difference]: Start difference. First operand 3174 states and 4398 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-06 22:12:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:42,529 INFO L93 Difference]: Finished difference Result 4710 states and 6565 transitions. [2023-11-06 22:12:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:12:42,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 95 [2023-11-06 22:12:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:42,550 INFO L225 Difference]: With dead ends: 4710 [2023-11-06 22:12:42,550 INFO L226 Difference]: Without dead ends: 4707 [2023-11-06 22:12:42,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:12:42,554 INFO L413 NwaCegarLoop]: 804 mSDtfsCounter, 2409 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1065 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2573 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1065 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:42,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2573 Valid, 3252 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1065 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-06 22:12:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2023-11-06 22:12:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 4625. [2023-11-06 22:12:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 3323 states have (on average 1.2642190791453505) internal successors, (4201), 3340 states have internal predecessors, (4201), 1039 states have call successors, (1039), 234 states have call predecessors, (1039), 262 states have return successors, (1215), 1070 states have call predecessors, (1215), 1035 states have call successors, (1215) [2023-11-06 22:12:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6455 transitions. [2023-11-06 22:12:42,919 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6455 transitions. Word has length 95 [2023-11-06 22:12:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:42,920 INFO L495 AbstractCegarLoop]: Abstraction has 4625 states and 6455 transitions. [2023-11-06 22:12:42,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-06 22:12:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6455 transitions. [2023-11-06 22:12:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:12:42,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:42,925 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:42,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:12:42,925 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:42,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1032774519, now seen corresponding path program 1 times [2023-11-06 22:12:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:42,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132327338] [2023-11-06 22:12:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:12:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:12:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:12:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:12:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:12:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:12:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:12:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:12:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:12:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:12:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132327338] [2023-11-06 22:12:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132327338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:43,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:43,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:12:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710035512] [2023-11-06 22:12:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:43,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:12:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:12:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:12:43,921 INFO L87 Difference]: Start difference. First operand 4625 states and 6455 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:12:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:47,811 INFO L93 Difference]: Finished difference Result 9412 states and 13142 transitions. [2023-11-06 22:12:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:12:47,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2023-11-06 22:12:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:47,836 INFO L225 Difference]: With dead ends: 9412 [2023-11-06 22:12:47,836 INFO L226 Difference]: Without dead ends: 4795 [2023-11-06 22:12:47,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:12:47,856 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 292 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:47,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1804 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-06 22:12:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2023-11-06 22:12:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4631. [2023-11-06 22:12:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 3326 states have (on average 1.2636800962116657) internal successors, (4203), 3347 states have internal predecessors, (4203), 1040 states have call successors, (1040), 236 states have call predecessors, (1040), 264 states have return successors, (1216), 1067 states have call predecessors, (1216), 1036 states have call successors, (1216) [2023-11-06 22:12:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 6459 transitions. [2023-11-06 22:12:48,292 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 6459 transitions. Word has length 104 [2023-11-06 22:12:48,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:48,292 INFO L495 AbstractCegarLoop]: Abstraction has 4631 states and 6459 transitions. [2023-11-06 22:12:48,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:12:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 6459 transitions. [2023-11-06 22:12:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:12:48,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:48,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:12:48,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:12:48,298 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:48,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 871828948, now seen corresponding path program 1 times [2023-11-06 22:12:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:48,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212656064] [2023-11-06 22:12:48,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:12:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:12:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:12:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:12:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:12:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:12:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:12:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:12:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:12:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:49,827 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-06 22:12:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212656064] [2023-11-06 22:12:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212656064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:49,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:49,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 22:12:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116110256] [2023-11-06 22:12:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:49,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:12:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:49,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:12:49,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:12:49,831 INFO L87 Difference]: Start difference. First operand 4631 states and 6459 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 22:12:56,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:12:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:56,181 INFO L93 Difference]: Finished difference Result 9455 states and 13315 transitions. [2023-11-06 22:12:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:12:56,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 108 [2023-11-06 22:12:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:56,205 INFO L225 Difference]: With dead ends: 9455 [2023-11-06 22:12:56,205 INFO L226 Difference]: Without dead ends: 5328 [2023-11-06 22:12:56,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:12:56,220 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 337 mSDsluCounter, 4675 mSDsCounter, 0 mSdLazyCounter, 3001 mSolverCounterSat, 257 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 5189 SdHoareTripleChecker+Invalid, 3259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3001 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:56,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 5189 Invalid, 3259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3001 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-11-06 22:12:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2023-11-06 22:12:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 4631. [2023-11-06 22:12:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 3326 states have (on average 1.2600721587492483) internal successors, (4191), 3347 states have internal predecessors, (4191), 1040 states have call successors, (1040), 236 states have call predecessors, (1040), 264 states have return successors, (1216), 1067 states have call predecessors, (1216), 1036 states have call successors, (1216) [2023-11-06 22:12:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 6447 transitions. [2023-11-06 22:12:56,714 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 6447 transitions. Word has length 108 [2023-11-06 22:12:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:56,715 INFO L495 AbstractCegarLoop]: Abstraction has 4631 states and 6447 transitions. [2023-11-06 22:12:56,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 22:12:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 6447 transitions. [2023-11-06 22:12:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:12:56,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:56,719 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:12:56,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:12:56,719 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:56,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1832898617, now seen corresponding path program 1 times [2023-11-06 22:12:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312801237] [2023-11-06 22:12:56,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:57,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:12:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:57,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:12:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:57,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:12:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:12:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:12:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:12:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:12:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:12:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:12:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:12:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:12:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:12:58,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:58,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312801237] [2023-11-06 22:12:58,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312801237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056986836] [2023-11-06 22:12:58,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:58,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:58,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:58,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:58,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:13:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:13:00,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:13:00,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:13:00,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056986836] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:13:00,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:13:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2023-11-06 22:13:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703461731] [2023-11-06 22:13:00,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:00,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 22:13:00,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:00,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 22:13:00,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:13:00,891 INFO L87 Difference]: Start difference. First operand 4631 states and 6447 transitions. Second operand has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22) [2023-11-06 22:13:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:09,551 INFO L93 Difference]: Finished difference Result 9283 states and 12946 transitions. [2023-11-06 22:13:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:13:09,552 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22) Word has length 104 [2023-11-06 22:13:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:09,575 INFO L225 Difference]: With dead ends: 9283 [2023-11-06 22:13:09,576 INFO L226 Difference]: Without dead ends: 4668 [2023-11-06 22:13:09,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=1715, Unknown=0, NotChecked=0, Total=1892 [2023-11-06 22:13:09,596 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 560 mSDsluCounter, 7922 mSDsCounter, 0 mSdLazyCounter, 6221 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 8392 SdHoareTripleChecker+Invalid, 6624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 6221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:09,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 8392 Invalid, 6624 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [403 Valid, 6221 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-11-06 22:13:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2023-11-06 22:13:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4585. [2023-11-06 22:13:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4585 states, 3291 states have (on average 1.2607110300820419) internal successors, (4149), 3329 states have internal predecessors, (4149), 1036 states have call successors, (1036), 236 states have call predecessors, (1036), 257 states have return successors, (1154), 1033 states have call predecessors, (1154), 1030 states have call successors, (1154) [2023-11-06 22:13:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 6339 transitions. [2023-11-06 22:13:10,101 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 6339 transitions. Word has length 104 [2023-11-06 22:13:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:10,102 INFO L495 AbstractCegarLoop]: Abstraction has 4585 states and 6339 transitions. [2023-11-06 22:13:10,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 16 states have internal predecessors, (105), 5 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22) [2023-11-06 22:13:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 6339 transitions. [2023-11-06 22:13:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-06 22:13:10,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:10,107 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:13:10,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:10,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:13:10,320 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:10,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash -665970444, now seen corresponding path program 1 times [2023-11-06 22:13:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99809723] [2023-11-06 22:13:10,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:13:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:13:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:13:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:13:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:13:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:13:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:13:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:11,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99809723] [2023-11-06 22:13:11,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99809723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:11,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:11,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:13:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884030773] [2023-11-06 22:13:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:11,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:13:11,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:11,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:13:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:13:11,883 INFO L87 Difference]: Start difference. First operand 4585 states and 6339 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 9 states have internal predecessors, (73), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-06 22:13:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:17,037 INFO L93 Difference]: Finished difference Result 12116 states and 16734 transitions. [2023-11-06 22:13:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:13:17,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 9 states have internal predecessors, (73), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2023-11-06 22:13:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:17,091 INFO L225 Difference]: With dead ends: 12116 [2023-11-06 22:13:17,091 INFO L226 Difference]: Without dead ends: 10019 [2023-11-06 22:13:17,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:13:17,105 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 2782 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 1488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2927 SdHoareTripleChecker+Valid, 3320 SdHoareTripleChecker+Invalid, 4048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1488 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:17,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2927 Valid, 3320 Invalid, 4048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1488 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-06 22:13:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10019 states. [2023-11-06 22:13:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10019 to 9742. [2023-11-06 22:13:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9742 states, 7003 states have (on average 1.2663144366699985) internal successors, (8868), 7090 states have internal predecessors, (8868), 2181 states have call successors, (2181), 509 states have call predecessors, (2181), 557 states have return successors, (2427), 2166 states have call predecessors, (2427), 2175 states have call successors, (2427) [2023-11-06 22:13:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9742 states to 9742 states and 13476 transitions. [2023-11-06 22:13:18,229 INFO L78 Accepts]: Start accepts. Automaton has 9742 states and 13476 transitions. Word has length 106 [2023-11-06 22:13:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:18,229 INFO L495 AbstractCegarLoop]: Abstraction has 9742 states and 13476 transitions. [2023-11-06 22:13:18,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 9 states have internal predecessors, (73), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-06 22:13:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 9742 states and 13476 transitions. [2023-11-06 22:13:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:13:18,238 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:18,238 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:13:18,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:13:18,239 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:18,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash -32957789, now seen corresponding path program 1 times [2023-11-06 22:13:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120320514] [2023-11-06 22:13:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:13:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:13:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:13:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:13:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:13:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:13:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:13:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:19,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120320514] [2023-11-06 22:13:19,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120320514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:19,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:19,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-06 22:13:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551565770] [2023-11-06 22:13:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:19,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:13:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:13:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:13:19,996 INFO L87 Difference]: Start difference. First operand 9742 states and 13476 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:13:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:24,540 INFO L93 Difference]: Finished difference Result 17978 states and 24881 transitions. [2023-11-06 22:13:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:13:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2023-11-06 22:13:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:24,587 INFO L225 Difference]: With dead ends: 17978 [2023-11-06 22:13:24,587 INFO L226 Difference]: Without dead ends: 9872 [2023-11-06 22:13:24,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:13:24,612 INFO L413 NwaCegarLoop]: 473 mSDtfsCounter, 502 mSDsluCounter, 4208 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 4681 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:24,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 4681 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-06 22:13:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9872 states. [2023-11-06 22:13:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9872 to 9734. [2023-11-06 22:13:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9734 states, 6997 states have (on average 1.2631127626125482) internal successors, (8838), 7085 states have internal predecessors, (8838), 2179 states have call successors, (2179), 509 states have call predecessors, (2179), 557 states have return successors, (2425), 2163 states have call predecessors, (2425), 2173 states have call successors, (2425) [2023-11-06 22:13:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9734 states to 9734 states and 13442 transitions. [2023-11-06 22:13:25,512 INFO L78 Accepts]: Start accepts. Automaton has 9734 states and 13442 transitions. Word has length 107 [2023-11-06 22:13:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:25,512 INFO L495 AbstractCegarLoop]: Abstraction has 9734 states and 13442 transitions. [2023-11-06 22:13:25,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:13:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 9734 states and 13442 transitions. [2023-11-06 22:13:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:13:25,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:25,518 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:13:25,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:13:25,518 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:25,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1157744542, now seen corresponding path program 1 times [2023-11-06 22:13:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:25,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989807865] [2023-11-06 22:13:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:25,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:26,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:13:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:13:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:13:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:13:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:13:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:13:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 22:13:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:13:27,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:27,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989807865] [2023-11-06 22:13:27,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989807865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:27,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498963238] [2023-11-06 22:13:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:27,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:27,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:27,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:27,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:13:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:28,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:13:28,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:13:28,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:13:28,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498963238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:28,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:13:28,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-06 22:13:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765540665] [2023-11-06 22:13:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:28,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:13:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:28,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:13:28,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:13:28,870 INFO L87 Difference]: Start difference. First operand 9734 states and 13442 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:13:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:29,469 INFO L93 Difference]: Finished difference Result 19500 states and 26929 transitions. [2023-11-06 22:13:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:13:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2023-11-06 22:13:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:29,512 INFO L225 Difference]: With dead ends: 19500 [2023-11-06 22:13:29,513 INFO L226 Difference]: Without dead ends: 9782 [2023-11-06 22:13:29,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:13:29,539 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 1 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:29,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1304 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:13:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9782 states. [2023-11-06 22:13:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9782 to 9766. [2023-11-06 22:13:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 7029 states have (on average 1.2619149238867549) internal successors, (8870), 7117 states have internal predecessors, (8870), 2179 states have call successors, (2179), 509 states have call predecessors, (2179), 557 states have return successors, (2425), 2163 states have call predecessors, (2425), 2173 states have call successors, (2425) [2023-11-06 22:13:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 13474 transitions. [2023-11-06 22:13:30,675 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 13474 transitions. Word has length 120 [2023-11-06 22:13:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:30,676 INFO L495 AbstractCegarLoop]: Abstraction has 9766 states and 13474 transitions. [2023-11-06 22:13:30,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:13:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 13474 transitions. [2023-11-06 22:13:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 22:13:30,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:30,681 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:13:30,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:30,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:13:30,897 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:30,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash 192495817, now seen corresponding path program 1 times [2023-11-06 22:13:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678557529] [2023-11-06 22:13:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:13:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:13:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:13:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:13:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:13:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:13:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:13:32,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678557529] [2023-11-06 22:13:32,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678557529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:32,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:32,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:13:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996034579] [2023-11-06 22:13:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:32,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:13:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:32,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:13:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:32,005 INFO L87 Difference]: Start difference. First operand 9766 states and 13474 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:13:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:34,020 INFO L93 Difference]: Finished difference Result 16257 states and 22461 transitions. [2023-11-06 22:13:34,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:13:34,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2023-11-06 22:13:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:34,067 INFO L225 Difference]: With dead ends: 16257 [2023-11-06 22:13:34,068 INFO L226 Difference]: Without dead ends: 9860 [2023-11-06 22:13:34,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:13:34,089 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 563 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:34,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1411 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:13:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9860 states. [2023-11-06 22:13:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9860 to 9780. [2023-11-06 22:13:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9780 states, 7043 states have (on average 1.2613942922050263) internal successors, (8884), 7131 states have internal predecessors, (8884), 2179 states have call successors, (2179), 509 states have call predecessors, (2179), 557 states have return successors, (2425), 2163 states have call predecessors, (2425), 2173 states have call successors, (2425) [2023-11-06 22:13:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9780 states to 9780 states and 13488 transitions. [2023-11-06 22:13:35,031 INFO L78 Accepts]: Start accepts. Automaton has 9780 states and 13488 transitions. Word has length 115 [2023-11-06 22:13:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:35,032 INFO L495 AbstractCegarLoop]: Abstraction has 9780 states and 13488 transitions. [2023-11-06 22:13:35,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:13:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9780 states and 13488 transitions. [2023-11-06 22:13:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:13:35,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:35,041 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:35,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:13:35,041 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:35,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1037798464, now seen corresponding path program 1 times [2023-11-06 22:13:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87342688] [2023-11-06 22:13:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:13:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:13:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:13:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:13:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:13:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:13:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:13:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 22:13:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:13:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87342688] [2023-11-06 22:13:36,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87342688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:36,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:13:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60762409] [2023-11-06 22:13:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:36,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:13:36,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:36,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:13:36,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:13:36,593 INFO L87 Difference]: Start difference. First operand 9780 states and 13488 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-06 22:13:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:41,338 INFO L93 Difference]: Finished difference Result 17964 states and 24794 transitions. [2023-11-06 22:13:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:13:41,338 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), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 133 [2023-11-06 22:13:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:41,368 INFO L225 Difference]: With dead ends: 17964 [2023-11-06 22:13:41,368 INFO L226 Difference]: Without dead ends: 9845 [2023-11-06 22:13:41,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:13:41,389 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 518 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:41,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 2487 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-06 22:13:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2023-11-06 22:13:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 9573. [2023-11-06 22:13:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9573 states, 6914 states have (on average 1.2610645067978015) internal successors, (8719), 6988 states have internal predecessors, (8719), 2117 states have call successors, (2117), 493 states have call predecessors, (2117), 541 states have return successors, (2363), 2115 states have call predecessors, (2363), 2111 states have call successors, (2363) [2023-11-06 22:13:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9573 states to 9573 states and 13199 transitions. [2023-11-06 22:13:42,287 INFO L78 Accepts]: Start accepts. Automaton has 9573 states and 13199 transitions. Word has length 133 [2023-11-06 22:13:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:42,288 INFO L495 AbstractCegarLoop]: Abstraction has 9573 states and 13199 transitions. [2023-11-06 22:13:42,288 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), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-06 22:13:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 9573 states and 13199 transitions. [2023-11-06 22:13:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:13:42,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:42,295 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:13:42,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:13:42,295 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:42,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:42,296 INFO L85 PathProgramCache]: Analyzing trace with hash 649893108, now seen corresponding path program 1 times [2023-11-06 22:13:42,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:42,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454246402] [2023-11-06 22:13:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:42,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:13:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:13:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:13:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:13:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-06 22:13:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:13:43,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454246402] [2023-11-06 22:13:43,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454246402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:43,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:43,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-06 22:13:43,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411563217] [2023-11-06 22:13:43,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:13:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:13:43,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:13:43,937 INFO L87 Difference]: Start difference. First operand 9573 states and 13199 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-06 22:13:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:48,354 INFO L93 Difference]: Finished difference Result 14523 states and 20005 transitions. [2023-11-06 22:13:48,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:13:48,355 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2023-11-06 22:13:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:48,373 INFO L225 Difference]: With dead ends: 14523 [2023-11-06 22:13:48,373 INFO L226 Difference]: Without dead ends: 8661 [2023-11-06 22:13:48,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:13:48,387 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 479 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 3061 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 4648 SdHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 3061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:48,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 4648 Invalid, 3428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 3061 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-06 22:13:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8661 states. [2023-11-06 22:13:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8661 to 8549. [2023-11-06 22:13:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8549 states, 6193 states have (on average 1.259002099144195) internal successors, (7797), 6265 states have internal predecessors, (7797), 1870 states have call successors, (1870), 449 states have call predecessors, (1870), 485 states have return successors, (2049), 1858 states have call predecessors, (2049), 1864 states have call successors, (2049) [2023-11-06 22:13:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8549 states to 8549 states and 11716 transitions. [2023-11-06 22:13:49,028 INFO L78 Accepts]: Start accepts. Automaton has 8549 states and 11716 transitions. Word has length 116 [2023-11-06 22:13:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:49,028 INFO L495 AbstractCegarLoop]: Abstraction has 8549 states and 11716 transitions. [2023-11-06 22:13:49,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-06 22:13:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8549 states and 11716 transitions. [2023-11-06 22:13:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-06 22:13:49,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:49,034 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:13:49,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:13:49,034 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:49,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 30542799, now seen corresponding path program 1 times [2023-11-06 22:13:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:49,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5811550] [2023-11-06 22:13:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:13:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:13:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:13:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:13:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:13:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:13:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:13:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:13:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:13:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 22:13:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:13:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-06 22:13:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:13:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5811550] [2023-11-06 22:13:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5811550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833997008] [2023-11-06 22:13:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:50,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:50,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:50,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:13:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:51,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 1644 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:13:51,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:13:52,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:13:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833997008] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:13:52,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:13:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2023-11-06 22:13:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745606350] [2023-11-06 22:13:52,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:52,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:13:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:13:52,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:13:52,152 INFO L87 Difference]: Start difference. First operand 8549 states and 11716 transitions. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-11-06 22:13:57,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:13:58,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:13:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:59,156 INFO L93 Difference]: Finished difference Result 17496 states and 23998 transitions. [2023-11-06 22:13:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:13:59,157 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 123 [2023-11-06 22:13:59,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:59,187 INFO L225 Difference]: With dead ends: 17496 [2023-11-06 22:13:59,188 INFO L226 Difference]: Without dead ends: 8957 [2023-11-06 22:13:59,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:13:59,202 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 410 mSDsluCounter, 3330 mSDsCounter, 0 mSdLazyCounter, 2401 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 3826 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:59,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 3826 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2401 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-11-06 22:13:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2023-11-06 22:13:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8711. [2023-11-06 22:13:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8711 states, 6355 states have (on average 1.2523996852871755) internal successors, (7959), 6415 states have internal predecessors, (7959), 1870 states have call successors, (1870), 449 states have call predecessors, (1870), 485 states have return successors, (2047), 1870 states have call predecessors, (2047), 1864 states have call successors, (2047) [2023-11-06 22:13:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 11876 transitions. [2023-11-06 22:13:59,867 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 11876 transitions. Word has length 123 [2023-11-06 22:13:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:59,868 INFO L495 AbstractCegarLoop]: Abstraction has 8711 states and 11876 transitions. [2023-11-06 22:13:59,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-11-06 22:13:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 11876 transitions. [2023-11-06 22:13:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 22:13:59,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:59,873 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:13:59,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:00,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 22:14:00,084 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:00,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1309839033, now seen corresponding path program 1 times [2023-11-06 22:14:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:00,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322492455] [2023-11-06 22:14:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:14:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:14:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:14:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:14:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:14:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:14:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:14:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:14:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:14:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:14:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:14:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:14:01,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:01,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322492455] [2023-11-06 22:14:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322492455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:01,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:01,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:14:01,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694180299] [2023-11-06 22:14:01,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:01,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:14:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:14:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:14:01,483 INFO L87 Difference]: Start difference. First operand 8711 states and 11876 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:14:08,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:14:10,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:14:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:10,451 INFO L93 Difference]: Finished difference Result 14234 states and 19427 transitions. [2023-11-06 22:14:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:14:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2023-11-06 22:14:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:10,482 INFO L225 Difference]: With dead ends: 14234 [2023-11-06 22:14:10,482 INFO L226 Difference]: Without dead ends: 8823 [2023-11-06 22:14:10,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:14:10,498 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 430 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 363 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:10,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 2042 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1437 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2023-11-06 22:14:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8823 states. [2023-11-06 22:14:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8823 to 8739. [2023-11-06 22:14:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8739 states, 6383 states have (on average 1.2534858217139275) internal successors, (8001), 6443 states have internal predecessors, (8001), 1870 states have call successors, (1870), 449 states have call predecessors, (1870), 485 states have return successors, (2047), 1870 states have call predecessors, (2047), 1864 states have call successors, (2047) [2023-11-06 22:14:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8739 states to 8739 states and 11918 transitions. [2023-11-06 22:14:11,150 INFO L78 Accepts]: Start accepts. Automaton has 8739 states and 11918 transitions. Word has length 118 [2023-11-06 22:14:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:11,151 INFO L495 AbstractCegarLoop]: Abstraction has 8739 states and 11918 transitions. [2023-11-06 22:14:11,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:14:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 8739 states and 11918 transitions. [2023-11-06 22:14:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 22:14:11,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:11,154 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:14:11,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:14:11,154 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:11,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 412445755, now seen corresponding path program 1 times [2023-11-06 22:14:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:11,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669709060] [2023-11-06 22:14:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:12,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:14:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:12,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:14:12,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:14:12,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:14:12,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:14:12,304 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:12,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:14:12,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:14:12 BoogieIcfgContainer [2023-11-06 22:14:12,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:14:12,512 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:14:12,512 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:14:12,512 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:14:12,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:36" (3/4) ... [2023-11-06 22:14:12,514 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:14:12,675 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:14:12,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:14:12,677 INFO L158 Benchmark]: Toolchain (without parser) took 162830.62ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 135.9MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 611.7MB. Max. memory is 16.1GB. [2023-11-06 22:14:12,677 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 132.1MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:14:12,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2218.53ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 135.1MB in the beginning and 164.8MB in the end (delta: -29.7MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2023-11-06 22:14:12,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 178.30ms. Allocated memory is still 237.0MB. Free memory was 164.8MB in the beginning and 154.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:14:12,683 INFO L158 Benchmark]: Boogie Preprocessor took 158.98ms. Allocated memory is still 237.0MB. Free memory was 154.3MB in the beginning and 143.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:14:12,686 INFO L158 Benchmark]: RCFGBuilder took 3852.53ms. Allocated memory is still 237.0MB. Free memory was 143.8MB in the beginning and 136.3MB in the end (delta: 7.5MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2023-11-06 22:14:12,686 INFO L158 Benchmark]: TraceAbstraction took 156245.38ms. Allocated memory was 237.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 135.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 526.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:12,687 INFO L158 Benchmark]: Witness Printer took 163.55ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:14:12,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 132.1MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2218.53ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 135.1MB in the beginning and 164.8MB in the end (delta: -29.7MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 178.30ms. Allocated memory is still 237.0MB. Free memory was 164.8MB in the beginning and 154.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 158.98ms. Allocated memory is still 237.0MB. Free memory was 154.3MB in the beginning and 143.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 3852.53ms. Allocated memory is still 237.0MB. Free memory was 143.8MB in the beginning and 136.3MB in the end (delta: 7.5MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * TraceAbstraction took 156245.38ms. Allocated memory was 237.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 135.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 526.2MB. Max. memory is 16.1GB. * Witness Printer took 163.55ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4831]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4831-4837] - GenericResultAtLocation [Line: 4844]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4844-4850] - GenericResultAtLocation [Line: 4857]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %2,%1\n\t" "sbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4857-4864] - GenericResultAtLocation [Line: 4894]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "incl %0": "+m" (v->counter)); [4894-4900] - GenericResultAtLocation [Line: 4907]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "decl %0": "+m" (v->counter)); [4907-4913] - GenericResultAtLocation [Line: 5717]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n" ".pushsection __bug_table,\"a\"\n" "2:\t.long 1b - 2b, %c0 - 2b\n" "\t.word %c1, 0\n" "\t.org 2b+%c2\n" ".popsection": : "i" ("/anthill/stuff/tacas-comp/work/current--X--drivers/net/can/usb/ems_usb.ko--X--bulklinux-3.0.1--X--68_1/linux-3.0.1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/68_1/drivers/net/can/usb/ems_usb.c.common.c"), "i" (510), "i" (sizeof(struct bug_entry ))); [5717-5723] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 6754]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5149] static struct lock_class_key __key___7 ; [L5150] static struct lock_class_key __key___8 ; [L5290-L5303] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5304-L5323] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5324-L5329] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5330-L5332] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6247-L6287] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6288-L6292] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6543-L6561] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6614] int LDV_IN_INTERRUPT ; [L6615] static int res_ems_usb_open_10 ; [L6616] static int res_ems_usb_close_12 ; [L6617] static int res_ems_usb_probe_16 ; [L6767] int ldv_urb_state = 0; [L6768] int ldv_coherent_state = 0; VAL [LDV_IN_INTERRUPT=0, __key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6619] struct net_device *var_group1 ; [L6620] struct sk_buff *var_group2 ; [L6621] struct usb_interface *var_group3 ; [L6622] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6623] int tmp___7 ; [L6624] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6625] int ldv_s_ems_usb_driver_usb_driver ; [L6626] int tmp___8 ; [L6627] int tmp___9 ; [L6630] LDV_IN_INTERRUPT = 1 [L6631] FCALL ldv_initialize() [L6632] CALL, EXPR ems_usb_init() VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6565] int err ; VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6568] CALL printk("<6>CPC-USB kernel driver loaded\n") VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, arg0={34:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L7001] return __VERIFIER_nondet_int(); [L6568] RET printk("<6>CPC-USB kernel driver loaded\n") VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, printk("<6>CPC-USB kernel driver loaded\n")=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6569] CALL, EXPR usb_register(& ems_usb_driver) [L5140] int tmp___7 ; [L5143] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7025] return __VERIFIER_nondet_int(); [L5143] RET, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L5143] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5145] return (tmp___7); VAL [LDV_IN_INTERRUPT=1, \result=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, driver={41:0}, driver={41:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6569] RET, EXPR usb_register(& ems_usb_driver) [L6569] err = usb_register(& ems_usb_driver) [L6571] COND FALSE !(\read(err)) [L6578] return (0); VAL [LDV_IN_INTERRUPT=1, \result=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, err=0, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] RET, EXPR ems_usb_init() VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_init()=0, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] tmp___7 = ems_usb_init() [L6634] COND FALSE !(\read(tmp___7)) [L6638] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6639] ldv_s_ems_usb_driver_usb_driver = 0 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6641] COND TRUE 1 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND TRUE \read(tmp___9) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___9=-2] [L6655] tmp___8 = __VERIFIER_nondet_int() [L6657] COND FALSE !(tmp___8 == 0) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=-2] [L6660] COND FALSE !(tmp___8 == 1) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=-2] [L6663] COND TRUE tmp___8 == 2 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=-2] [L6704] CALL ems_usb_start_xmit(var_group2, var_group1) [L6048] struct ems_usb *dev ; [L6049] void *tmp___7 ; [L6050] struct ems_tx_urb_context *context ; [L6051] struct net_device_stats *stats ; [L6052] struct can_frame *cf ; [L6053] struct ems_cpc_msg *msg ; [L6054] struct urb *urb ; [L6055] u8 *buf ; [L6056] int i ; [L6057] int err ; [L6058] size_t size ; [L6059] int tmp___8 ; [L6060] void *tmp___9 ; [L6061] unsigned int tmp___10 ; [L6062] int tmp___11 ; [L6063] long tmp___12 ; VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={4294967326:0}, skb={4294967326:0}] [L6066] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L4976] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [LDV_IN_INTERRUPT=1, \result={0:-520}, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6066] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, netdev={0:-2952}, netdev={0:-2952}, netdev_priv((struct net_device const *)netdev)={0:-520}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={4294967326:0}, skb={4294967326:0}] [L6066] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6067] dev = (struct ems_usb *)tmp___7 [L6068] context = (struct ems_tx_urb_context *)((void *)0) [L6069] stats = & netdev->stats [L6070] EXPR skb->data [L6070] cf = (struct can_frame *)skb->data [L6071] size = 15UL + sizeof(struct cpc_can_msg ) [L6072] CALL, EXPR can_dropped_invalid_skb(netdev, skb) [L5252] struct can_frame const *cf ; [L5253] int tmp___7 ; [L5254] long tmp___8 ; [L5256] EXPR skb->data [L5256] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5257] EXPR skb->len VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf={4294967318:-9}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb->len=4294967309, skb={4294967326:0}, skb={4294967326:0}] [L5257] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5260] EXPR cf->can_dlc VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf->can_dlc=0, cf={4294967318:-9}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={4294967326:0}, skb={4294967326:0}] [L5260] COND FALSE !((int const )cf->can_dlc > 8) [L5263] tmp___7 = 0 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf={4294967318:-9}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={4294967326:0}, skb={4294967326:0}, tmp___7=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf={4294967318:-9}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={4294967326:0}, skb={4294967326:0}, tmp___7=0, tmp___8=0] [L5268] COND FALSE !(\read(tmp___8)) [L5276] return (0); VAL [LDV_IN_INTERRUPT=1, \result=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf={4294967318:-9}, dev={0:-2952}, dev={0:-2952}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, skb={4294967326:0}, skb={4294967326:0}, tmp___7=0, tmp___8=0] [L6072] RET, EXPR can_dropped_invalid_skb(netdev, skb) [L6072] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6074] COND FALSE !(\read(tmp___8)) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0] [L6079] CALL, EXPR usb_alloc_urb(0, 32U) VAL [LDV_IN_INTERRUPT=1, \old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6830] void *arbitrary_memory ; [L6831] void *tmp___7 ; VAL [LDV_IN_INTERRUPT=1, \old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6834] COND TRUE 1 VAL [LDV_IN_INTERRUPT=1, \old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6837] CALL, EXPR ldv_undefined_pointer() VAL [LDV_IN_INTERRUPT=1, \old(ldv_urb_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] CALL, EXPR ldv_malloc(0UL) VAL [LDV_IN_INTERRUPT=1, \old(ldv_urb_state)=0, \old(size)=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] RET, EXPR ldv_malloc(0UL) VAL [LDV_IN_INTERRUPT=1, \old(ldv_urb_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_malloc(0UL)={-4:0}, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] return ldv_malloc(0UL); [L6837] RET, EXPR ldv_undefined_pointer() VAL [LDV_IN_INTERRUPT=1, \old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, ldv_undefined_pointer()={-4:0}, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6837] tmp___7 = ldv_undefined_pointer() [L6838] arbitrary_memory = tmp___7 VAL [LDV_IN_INTERRUPT=1, \old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, arbitrary_memory={-4:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7={-4:0}] [L6840] COND FALSE !(! arbitrary_memory) [L6844] ldv_urb_state = ldv_urb_state + 1 [L6845] return ((struct urb *)arbitrary_memory); VAL [LDV_IN_INTERRUPT=1, \old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \result={-4:0}, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, arbitrary_memory={-4:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, iso_packets=0, ldv_coherent_state=0, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7={-4:0}] [L6079] RET, EXPR usb_alloc_urb(0, 32U) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, usb_alloc_urb(0, 32U)={-4:0}] [L6079] urb = usb_alloc_urb(0, 32U) [L6081] COND FALSE !(! urb) [L6089] EXPR dev->udev VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf={4294967318:-9}, context={0:0}, dev->udev={4294967310:4294967324}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, urb={-4:0}] [L6089] CALL, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, dev={4294967310:4294967324}, dma={-4:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6773] void *arbitrary_memory ; [L6774] void *tmp___7 ; VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma={-4:104}, dma={-4:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6777] COND TRUE 1 VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma={-4:104}, dma={-4:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6780] CALL, EXPR ldv_undefined_pointer() VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] CALL, EXPR ldv_malloc(0UL) VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, \old(size)=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] RET, EXPR ldv_malloc(0UL) VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_malloc(0UL)={-18446744073709551617:0}, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] return ldv_malloc(0UL); [L6780] RET, EXPR ldv_undefined_pointer() VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma={-4:104}, dma={-4:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_undefined_pointer()={-18446744073709551617:0}, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6780] tmp___7 = ldv_undefined_pointer() [L6781] arbitrary_memory = tmp___7 VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, arbitrary_memory={-18446744073709551617:0}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma={-4:104}, dma={-4:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, tmp___7={-18446744073709551617:0}] [L6783] COND FALSE !(! arbitrary_memory) [L6787] ldv_coherent_state = ldv_coherent_state + 1 [L6788] return (arbitrary_memory); VAL [LDV_IN_INTERRUPT=1, \old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, \result={-18446744073709551617:0}, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, arbitrary_memory={-18446744073709551617:0}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma={-4:104}, dma={-4:104}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, tmp___7={-18446744073709551617:0}] [L6089] RET, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, cf={4294967318:-9}, context={0:0}, dev->udev={4294967310:4294967324}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, urb={-4:0}, usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma)={-18446744073709551617:0}] [L6089] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6090] buf = (u8 *)tmp___9 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6092] COND FALSE !(! buf) [L6100] msg = (struct ems_cpc_msg *)(buf + 4) [L6101] EXPR cf->can_id [L6101] msg->msg.can_msg.id = cf->can_id & 536870911U [L6102] EXPR cf->can_dlc [L6102] msg->msg.can_msg.length = cf->can_dlc [L6103] EXPR cf->can_id VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf->can_id=-4611686017353646080, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6103] cf->can_id & 1073741824U VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf->can_id & 1073741824U=-4611686017353646080, cf->can_id=-4611686017353646080, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6103] COND TRUE cf->can_id & 1073741824U [L6104] EXPR cf->can_id VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf->can_id=-4611686017353646080, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6104] COND FALSE !(cf->can_id & 2147483648U) [L6107] msg->type = (u8 )13 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6109] msg->length = (u8 )5 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6132] EXPR msg->msg.can_msg.id [L6132] msg->msg.can_msg.id = msg->msg.can_msg.id [L6133] i = 0 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6135] COND TRUE 1 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6137] COND TRUE i < 10 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev->tx_contexts[i].echo_index=4294967306, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6141] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6142] context = & dev->tx_contexts[i] VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6151] COND TRUE ! context VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6153] FCALL usb_unanchor_urb(urb) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6154] EXPR dev->udev [L6154] EXPR urb->transfer_dma VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev->udev={4294967310:4294967324}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=1, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb->transfer_dma=4294967322, urb={-4:0}] [L6154] CALL usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [LDV_IN_INTERRUPT=1, \old(dma)=4294967322, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, addr={-18446744073709551617:0}, dev={4294967310:4294967324}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6802] COND TRUE 1 VAL [LDV_IN_INTERRUPT=1, \old(dma)=4294967322, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma=4294967322, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6804] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [LDV_IN_INTERRUPT=1, \old(dma)=4294967322, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma=4294967322, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6810] COND TRUE \read(*addr) VAL [LDV_IN_INTERRUPT=1, \old(dma)=4294967322, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma=4294967322, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6811] COND TRUE ldv_coherent_state >= 1 VAL [LDV_IN_INTERRUPT=1, \old(dma)=4294967322, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma=4294967322, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6817] ldv_coherent_state = ldv_coherent_state - 1 VAL [LDV_IN_INTERRUPT=1, \old(dma)=4294967322, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, addr={-18446744073709551617:0}, addr={-18446744073709551617:0}, dev={4294967310:4294967324}, dev={4294967310:4294967324}, dma=4294967322, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6154] RET usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev->udev={4294967310:4294967324}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb->transfer_dma=4294967322, urb={-4:0}] [L6155] EXPR netdev->dev.parent VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev->dev.parent={4294967311:4294967312}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6155] CALL dev_warn((struct device const *)netdev->dev.parent, "couldn\'t find free context\n") VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, arg0={4294967311:4294967312}, arg1={22:0}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6967] return __VERIFIER_nondet_int(); [L6155] RET dev_warn((struct device const *)netdev->dev.parent, "couldn\'t find free context\n") VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, dev_warn((struct device const *)netdev->dev.parent, "couldn\'t find free context\n")=0, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev->dev.parent={4294967311:4294967312}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6157] return ((netdev_tx_t )16); VAL [LDV_IN_INTERRUPT=1, \result=16, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, buf={-18446744073709551617:0}, cf={4294967318:-9}, context={0:0}, dev={0:-520}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, i=0, ldv_coherent_state=0, ldv_urb_state=1, msg={-18446744073709551617:4}, netdev={0:-2952}, netdev={0:-2952}, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, skb={4294967326:0}, skb={4294967326:0}, stats={0:-2764}, tmp___7={0:-520}, tmp___8=0, tmp___9={-18446744073709551617:0}, urb={-4:0}] [L6704] RET ems_usb_start_xmit(var_group2, var_group1) [L6641] COND TRUE 1 VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=-2, var_group1={0:-2952}, var_group2={4294967326:0}] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-2952}, var_group2={4294967326:0}] [L6648] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-2952}, var_group2={4294967326:0}] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-2952}, var_group2={4294967326:0}] [L6742] CALL ems_usb_exit() VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6587] FCALL usb_deregister(& ems_usb_driver) [L6742] RET ems_usb_exit() VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_s_ems_usb_driver_usb_driver=0, ldv_s_ems_usb_netdev_ops_net_device_ops=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7=0, tmp___8=2, tmp___9=0, var_group1={0:-2952}, var_group2={4294967326:0}] [L6746] CALL ldv_check_final_state() [L6889] COND FALSE !(ldv_urb_state == 0) VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6892] CALL ldv_blast_assert() VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6754] reach_error() VAL [LDV_IN_INTERRUPT=1, __key___7={36:0}, __key___8={37:0}, __this_module={4294967327:4294967314}, ems_usb_bittiming_const={40:0}, ems_usb_driver={41:0}, ems_usb_netdev_ops={39:0}, ems_usb_table={38:0}, ldv_coherent_state=0, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 39 procedures, 511 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 155.9s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 95.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 17346 SdHoareTripleChecker+Valid, 80.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16464 mSDsluCounter, 76318 SdHoareTripleChecker+Invalid, 72.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61446 mSDsCounter, 9493 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42040 IncrementalHoareTripleChecker+Invalid, 51536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9493 mSolverCounterUnsat, 14872 mSDtfsCounter, 42040 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1429 GetRequests, 1121 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9780occurred in iteration=22, InterpolantAutomatonStates: 269, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 4911 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 2834 NumberOfCodeBlocks, 2834 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2912 ConstructedInterpolants, 0 QuantifiedInterpolants, 5043 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4680 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 261/284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:14:12,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a987797-0f23-4c54-ba26-8d29801abc7d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE