./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 938b60b21c972fc7f556d0694990fba352b46bfd03cbdeaa77f40e339f6c8deb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:28:15,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:28:15,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:28:15,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:28:15,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:28:15,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:28:15,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:28:15,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:28:15,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:28:15,134 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:28:15,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:28:15,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:28:15,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:28:15,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:28:15,136 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:28:15,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:28:15,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:28:15,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:28:15,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:28:15,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:28:15,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:28:15,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:28:15,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:28:15,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:28:15,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:28:15,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:28:15,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:28:15,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:28:15,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:28:15,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:28:15,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:28:15,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:28:15,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:28:15,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:28:15,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:28:15,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:28:15,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 938b60b21c972fc7f556d0694990fba352b46bfd03cbdeaa77f40e339f6c8deb [2025-01-09 18:28:15,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:28:15,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:28:15,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:28:15,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:28:15,417 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:28:15,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-01-09 18:28:16,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8f3dbe88/1d78cf8e43904a20a0646c6aef41e19c/FLAGd00a6f928 [2025-01-09 18:28:17,103 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:28:17,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-01-09 18:28:17,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8f3dbe88/1d78cf8e43904a20a0646c6aef41e19c/FLAGd00a6f928 [2025-01-09 18:28:17,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8f3dbe88/1d78cf8e43904a20a0646c6aef41e19c [2025-01-09 18:28:17,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:28:17,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:28:17,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:28:17,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:28:17,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:28:17,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:28:17" (1/1) ... [2025-01-09 18:28:17,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4209afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:17, skipping insertion in model container [2025-01-09 18:28:17,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:28:17" (1/1) ... [2025-01-09 18:28:17,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:28:17,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2025-01-09 18:28:18,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:28:18,267 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:28:18,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0; sete %1": "+m" (v->counter), "=qm" (c): : "memory"); [5496-5497] [2025-01-09 18:28:18,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddb %b0, %1\n": "+q" (__ret), "+m" (v->counter): : "memory", "cc"); [5508-5509] [2025-01-09 18:28:18,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5512-5513] [2025-01-09 18:28:18,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5516-5517] [2025-01-09 18:28:18,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [5520-5521] [2025-01-09 18:28:18,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i[161908,161921] [2025-01-09 18:28:18,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:28:18,515 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:28:18,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18 WrapperNode [2025-01-09 18:28:18,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:28:18,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:28:18,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:28:18,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:28:18,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,661 INFO L138 Inliner]: procedures = 138, calls = 566, calls flagged for inlining = 62, calls inlined = 62, statements flattened = 1911 [2025-01-09 18:28:18,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:28:18,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:28:18,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:28:18,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:28:18,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,802 INFO L175 MemorySlicer]: Split 326 memory accesses to 17 slices as follows [2, 2, 3, 3, 124, 7, 2, 8, 19, 10, 3, 19, 44, 5, 53, 14, 8]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 199 writes are split as follows [0, 1, 1, 1, 33, 6, 1, 4, 19, 0, 1, 19, 44, 4, 53, 12, 0]. [2025-01-09 18:28:18,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:28:18,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:28:18,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:28:18,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:28:18,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (1/1) ... [2025-01-09 18:28:18,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:28:18,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:28:18,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:28:18,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_resume [2025-01-09 18:28:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_resume [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:28:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:28:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:28:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:28:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:28:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:28:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:28:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:28:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 18:28:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 18:28:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 18:28:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:28:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:28:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:28:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:28:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:28:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:28:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:28:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:28:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:28:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:28:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 18:28:18,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:28:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2025-01-09 18:28:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2025-01-09 18:28:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:28:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:28:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-01-09 18:28:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-01-09 18:28:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-01-09 18:28:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-01-09 18:28:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-01-09 18:28:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:28:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:28:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:28:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:28:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-01-09 18:28:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~pm_message_t~0~TO~int [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_suspend [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_suspend [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_resume [2025-01-09 18:28:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_resume [2025-01-09 18:28:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-01-09 18:28:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-01-09 18:28:19,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-01-09 18:28:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:28:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:28:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_tx_fixup [2025-01-09 18:28:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_tx_fixup [2025-01-09 18:28:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:28:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-01-09 18:28:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-01-09 18:28:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_4 [2025-01-09 18:28:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_4 [2025-01-09 18:28:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:28:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2025-01-09 18:28:19,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 18:28:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:28:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_bind [2025-01-09 18:28:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_bind [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_manage_power [2025-01-09 18:28:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_manage_power [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-09 18:28:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:28:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-01-09 18:28:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_rx_fixup [2025-01-09 18:28:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_rx_fixup [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-01-09 18:28:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_ncm_unbind [2025-01-09 18:28:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_ncm_unbind [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure cdc_mbim_unbind [2025-01-09 18:28:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure cdc_mbim_unbind [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:28:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2025-01-09 18:28:19,010 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:28:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:28:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 18:28:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 18:28:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 18:28:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-09 18:28:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-09 18:28:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-09 18:28:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 18:28:19,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 18:28:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:28:19,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:28:19,012 INFO L130 BoogieDeclarations]: Found specification of procedure eth_hdr [2025-01-09 18:28:19,012 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_hdr [2025-01-09 18:28:19,012 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 18:28:19,012 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 18:28:19,488 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:28:19,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:28:19,921 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:28:20,185 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-01-09 18:28:26,113 INFO L? ?]: Removed 1202 outVars from TransFormulas that were not future-live. [2025-01-09 18:28:26,113 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:28:26,131 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:28:26,131 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 18:28:26,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:28:26 BoogieIcfgContainer [2025-01-09 18:28:26,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:28:26,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:28:26,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:28:26,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:28:26,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:28:17" (1/3) ... [2025-01-09 18:28:26,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2696161c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:28:26, skipping insertion in model container [2025-01-09 18:28:26,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:28:18" (2/3) ... [2025-01-09 18:28:26,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2696161c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:28:26, skipping insertion in model container [2025-01-09 18:28:26,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:28:26" (3/3) ... [2025-01-09 18:28:26,141 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i [2025-01-09 18:28:26,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:28:26,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--cdc_mbim.ko-entry_point.cil.out.i that has 65 procedures, 733 locations, 1 initial locations, 53 loop locations, and 1 error locations. [2025-01-09 18:28:26,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:28:26,213 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@623b1d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:28:26,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:28:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 468 states have (on average 1.4166666666666667) internal successors, (663), 482 states have internal predecessors, (663), 96 states have call successors, (96), 35 states have call predecessors, (96), 33 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 18:28:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 18:28:26,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:26,228 INFO L218 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] [2025-01-09 18:28:26,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:26,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1093887543, now seen corresponding path program 1 times [2025-01-09 18:28:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:26,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885961640] [2025-01-09 18:28:26,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:27,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 18:28:27,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 18:28:27,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:27,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:28:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885961640] [2025-01-09 18:28:28,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885961640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:28,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399287722] [2025-01-09 18:28:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:28,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:28,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:28,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:28,062 INFO L87 Difference]: Start difference. First operand has 599 states, 468 states have (on average 1.4166666666666667) internal successors, (663), 482 states have internal predecessors, (663), 96 states have call successors, (96), 35 states have call predecessors, (96), 33 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 18:28:32,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:28:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:32,418 INFO L93 Difference]: Finished difference Result 1728 states and 2514 transitions. [2025-01-09 18:28:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-01-09 18:28:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:32,442 INFO L225 Difference]: With dead ends: 1728 [2025-01-09 18:28:32,442 INFO L226 Difference]: Without dead ends: 1112 [2025-01-09 18:28:32,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:32,452 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 758 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:32,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1676 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:28:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-01-09 18:28:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1109. [2025-01-09 18:28:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 884 states have (on average 1.4015837104072397) internal successors, (1239), 891 states have internal predecessors, (1239), 163 states have call successors, (163), 62 states have call predecessors, (163), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 18:28:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1559 transitions. [2025-01-09 18:28:32,556 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1559 transitions. Word has length 40 [2025-01-09 18:28:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:32,556 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1559 transitions. [2025-01-09 18:28:32,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 18:28:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1559 transitions. [2025-01-09 18:28:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 18:28:32,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:32,564 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 18:28:32,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:28:32,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:32,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1387015166, now seen corresponding path program 1 times [2025-01-09 18:28:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:32,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159692113] [2025-01-09 18:28:32,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:33,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 18:28:33,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 18:28:33,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:33,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 18:28:34,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:34,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159692113] [2025-01-09 18:28:34,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159692113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:34,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:34,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:34,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105833242] [2025-01-09 18:28:34,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:34,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:34,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:34,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:34,216 INFO L87 Difference]: Start difference. First operand 1109 states and 1559 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:34,273 INFO L93 Difference]: Finished difference Result 1111 states and 1560 transitions. [2025-01-09 18:28:34,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:34,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2025-01-09 18:28:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:34,282 INFO L225 Difference]: With dead ends: 1111 [2025-01-09 18:28:34,283 INFO L226 Difference]: Without dead ends: 1108 [2025-01-09 18:28:34,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:34,287 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 790 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:34,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 816 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:28:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-01-09 18:28:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-01-09 18:28:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 884 states have (on average 1.4004524886877827) internal successors, (1238), 890 states have internal predecessors, (1238), 162 states have call successors, (162), 62 states have call predecessors, (162), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 18:28:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1557 transitions. [2025-01-09 18:28:34,336 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1557 transitions. Word has length 50 [2025-01-09 18:28:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:34,337 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1557 transitions. [2025-01-09 18:28:34,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1557 transitions. [2025-01-09 18:28:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 18:28:34,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:34,340 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 18:28:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:28:34,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:34,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash 47587753, now seen corresponding path program 1 times [2025-01-09 18:28:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459661344] [2025-01-09 18:28:34,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:34,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:35,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 18:28:35,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 18:28:35,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:35,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 18:28:35,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459661344] [2025-01-09 18:28:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459661344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:35,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:35,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:35,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836820217] [2025-01-09 18:28:35,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:35,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:35,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:35,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:35,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:35,948 INFO L87 Difference]: Start difference. First operand 1108 states and 1557 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:35,989 INFO L93 Difference]: Finished difference Result 1110 states and 1558 transitions. [2025-01-09 18:28:35,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:35,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2025-01-09 18:28:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:35,997 INFO L225 Difference]: With dead ends: 1110 [2025-01-09 18:28:35,997 INFO L226 Difference]: Without dead ends: 1107 [2025-01-09 18:28:35,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:35,999 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 787 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:36,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 814 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:28:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-01-09 18:28:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2025-01-09 18:28:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 884 states have (on average 1.3993212669683257) internal successors, (1237), 889 states have internal predecessors, (1237), 161 states have call successors, (161), 62 states have call predecessors, (161), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 18:28:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1555 transitions. [2025-01-09 18:28:36,042 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1555 transitions. Word has length 51 [2025-01-09 18:28:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:36,042 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1555 transitions. [2025-01-09 18:28:36,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1555 transitions. [2025-01-09 18:28:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 18:28:36,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:36,044 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 18:28:36,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:28:36,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:36,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1475015777, now seen corresponding path program 1 times [2025-01-09 18:28:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:36,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760809278] [2025-01-09 18:28:36,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:36,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 18:28:36,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 18:28:36,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:36,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 18:28:37,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:37,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760809278] [2025-01-09 18:28:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760809278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:37,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:37,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:37,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802593184] [2025-01-09 18:28:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:37,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:37,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:37,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:37,104 INFO L87 Difference]: Start difference. First operand 1107 states and 1555 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:37,146 INFO L93 Difference]: Finished difference Result 1109 states and 1556 transitions. [2025-01-09 18:28:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2025-01-09 18:28:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:37,152 INFO L225 Difference]: With dead ends: 1109 [2025-01-09 18:28:37,153 INFO L226 Difference]: Without dead ends: 1106 [2025-01-09 18:28:37,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:37,155 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 784 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:37,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 812 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:28:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-01-09 18:28:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-01-09 18:28:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 884 states have (on average 1.3981900452488687) internal successors, (1236), 888 states have internal predecessors, (1236), 160 states have call successors, (160), 62 states have call predecessors, (160), 61 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 18:28:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1553 transitions. [2025-01-09 18:28:37,202 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1553 transitions. Word has length 52 [2025-01-09 18:28:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:37,202 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1553 transitions. [2025-01-09 18:28:37,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1553 transitions. [2025-01-09 18:28:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 18:28:37,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:37,205 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 18:28:37,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:28:37,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:37,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1519350868, now seen corresponding path program 1 times [2025-01-09 18:28:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:37,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194919929] [2025-01-09 18:28:37,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:38,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 18:28:38,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 18:28:38,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:38,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 18:28:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194919929] [2025-01-09 18:28:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194919929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:38,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036700593] [2025-01-09 18:28:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:38,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:38,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:38,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:38,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:38,376 INFO L87 Difference]: Start difference. First operand 1106 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:38,507 INFO L93 Difference]: Finished difference Result 3263 states and 4612 transitions. [2025-01-09 18:28:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:38,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2025-01-09 18:28:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:38,520 INFO L225 Difference]: With dead ends: 3263 [2025-01-09 18:28:38,520 INFO L226 Difference]: Without dead ends: 2180 [2025-01-09 18:28:38,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:38,526 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 776 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1622 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:38,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1622 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:28:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-01-09 18:28:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2176. [2025-01-09 18:28:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1743 states have (on average 1.4004589787722317) internal successors, (2441), 1749 states have internal predecessors, (2441), 313 states have call successors, (313), 120 states have call predecessors, (313), 119 states have return successors, (318), 310 states have call predecessors, (318), 310 states have call successors, (318) [2025-01-09 18:28:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3072 transitions. [2025-01-09 18:28:38,618 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3072 transitions. Word has length 53 [2025-01-09 18:28:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:38,619 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3072 transitions. [2025-01-09 18:28:38,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3072 transitions. [2025-01-09 18:28:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 18:28:38,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:38,622 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 18:28:38,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:28:38,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:38,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash 144568516, now seen corresponding path program 1 times [2025-01-09 18:28:38,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:38,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107906108] [2025-01-09 18:28:38,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:38,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:39,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 18:28:39,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 18:28:39,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:39,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 18:28:39,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:39,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107906108] [2025-01-09 18:28:39,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107906108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:39,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:39,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:39,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745435324] [2025-01-09 18:28:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:39,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:39,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:39,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:39,657 INFO L87 Difference]: Start difference. First operand 2176 states and 3072 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:39,710 INFO L93 Difference]: Finished difference Result 2178 states and 3073 transitions. [2025-01-09 18:28:39,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:39,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2025-01-09 18:28:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:39,722 INFO L225 Difference]: With dead ends: 2178 [2025-01-09 18:28:39,722 INFO L226 Difference]: Without dead ends: 2166 [2025-01-09 18:28:39,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:39,724 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 780 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:39,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:28:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-01-09 18:28:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2166. [2025-01-09 18:28:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1734 states have (on average 1.400230680507497) internal successors, (2428), 1739 states have internal predecessors, (2428), 312 states have call successors, (312), 120 states have call predecessors, (312), 119 states have return successors, (318), 310 states have call predecessors, (318), 310 states have call successors, (318) [2025-01-09 18:28:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3058 transitions. [2025-01-09 18:28:39,810 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3058 transitions. Word has length 54 [2025-01-09 18:28:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:39,810 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 3058 transitions. [2025-01-09 18:28:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 18:28:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3058 transitions. [2025-01-09 18:28:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 18:28:39,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:39,813 INFO L218 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] [2025-01-09 18:28:39,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:28:39,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:39,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1060133054, now seen corresponding path program 1 times [2025-01-09 18:28:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:39,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156766332] [2025-01-09 18:28:39,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:40,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 18:28:40,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 18:28:40,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:40,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:28:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:40,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156766332] [2025-01-09 18:28:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156766332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:40,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411584337] [2025-01-09 18:28:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:40,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:40,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:40,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:40,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:40,940 INFO L87 Difference]: Start difference. First operand 2166 states and 3058 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 18:28:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:41,357 INFO L93 Difference]: Finished difference Result 6308 states and 8877 transitions. [2025-01-09 18:28:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:41,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2025-01-09 18:28:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:41,380 INFO L225 Difference]: With dead ends: 6308 [2025-01-09 18:28:41,380 INFO L226 Difference]: Without dead ends: 4165 [2025-01-09 18:28:41,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:41,390 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 738 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:41,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1571 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 18:28:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2025-01-09 18:28:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 4148. [2025-01-09 18:28:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4148 states, 3332 states have (on average 1.397358943577431) internal successors, (4656), 3343 states have internal predecessors, (4656), 580 states have call successors, (580), 236 states have call predecessors, (580), 235 states have return successors, (590), 576 states have call predecessors, (590), 578 states have call successors, (590) [2025-01-09 18:28:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 5826 transitions. [2025-01-09 18:28:41,543 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 5826 transitions. Word has length 65 [2025-01-09 18:28:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:41,543 INFO L471 AbstractCegarLoop]: Abstraction has 4148 states and 5826 transitions. [2025-01-09 18:28:41,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 18:28:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 5826 transitions. [2025-01-09 18:28:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 18:28:41,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:41,546 INFO L218 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] [2025-01-09 18:28:41,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:28:41,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:41,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1668640104, now seen corresponding path program 1 times [2025-01-09 18:28:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:41,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922029778] [2025-01-09 18:28:41,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:42,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 18:28:42,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 18:28:42,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:42,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:28:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922029778] [2025-01-09 18:28:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922029778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:42,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445991415] [2025-01-09 18:28:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:42,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:42,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:42,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:42,569 INFO L87 Difference]: Start difference. First operand 4148 states and 5826 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 18:28:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:43,102 INFO L93 Difference]: Finished difference Result 10732 states and 15042 transitions. [2025-01-09 18:28:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:43,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2025-01-09 18:28:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:43,140 INFO L225 Difference]: With dead ends: 10732 [2025-01-09 18:28:43,140 INFO L226 Difference]: Without dead ends: 6607 [2025-01-09 18:28:43,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:43,157 INFO L435 NwaCegarLoop]: 1245 mSDtfsCounter, 727 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:43,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2001 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:28:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6607 states. [2025-01-09 18:28:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6607 to 6594. [2025-01-09 18:28:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6594 states, 5298 states have (on average 1.3961872404681013) internal successors, (7397), 5313 states have internal predecessors, (7397), 906 states have call successors, (906), 390 states have call predecessors, (906), 389 states have return successors, (920), 902 states have call predecessors, (920), 904 states have call successors, (920) [2025-01-09 18:28:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6594 states to 6594 states and 9223 transitions. [2025-01-09 18:28:43,432 INFO L78 Accepts]: Start accepts. Automaton has 6594 states and 9223 transitions. Word has length 67 [2025-01-09 18:28:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:43,433 INFO L471 AbstractCegarLoop]: Abstraction has 6594 states and 9223 transitions. [2025-01-09 18:28:43,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 18:28:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 6594 states and 9223 transitions. [2025-01-09 18:28:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 18:28:43,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:43,444 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-01-09 18:28:43,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:28:43,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:43,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1739513648, now seen corresponding path program 1 times [2025-01-09 18:28:43,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:43,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492839348] [2025-01-09 18:28:43,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:44,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 18:28:44,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 18:28:44,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:44,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 18:28:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492839348] [2025-01-09 18:28:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492839348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:28:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515239268] [2025-01-09 18:28:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:44,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:28:44,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:44,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:28:44,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:28:44,877 INFO L87 Difference]: Start difference. First operand 6594 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 18:28:48,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:28:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:52,840 INFO L93 Difference]: Finished difference Result 9873 states and 13843 transitions. [2025-01-09 18:28:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:28:52,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2025-01-09 18:28:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:52,898 INFO L225 Difference]: With dead ends: 9873 [2025-01-09 18:28:52,898 INFO L226 Difference]: Without dead ends: 9870 [2025-01-09 18:28:52,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:28:52,908 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 1509 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 2830 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:52,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 2830 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2025-01-09 18:28:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9870 states. [2025-01-09 18:28:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9870 to 9856. [2025-01-09 18:28:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9856 states, 7921 states have (on average 1.3974245676051005) internal successors, (11069), 7943 states have internal predecessors, (11069), 1354 states have call successors, (1354), 581 states have call predecessors, (1354), 580 states have return successors, (1400), 1349 states have call predecessors, (1400), 1352 states have call successors, (1400) [2025-01-09 18:28:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9856 states to 9856 states and 13823 transitions. [2025-01-09 18:28:53,289 INFO L78 Accepts]: Start accepts. Automaton has 9856 states and 13823 transitions. Word has length 122 [2025-01-09 18:28:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:53,290 INFO L471 AbstractCegarLoop]: Abstraction has 9856 states and 13823 transitions. [2025-01-09 18:28:53,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 18:28:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 9856 states and 13823 transitions. [2025-01-09 18:28:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 18:28:53,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:53,297 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-01-09 18:28:53,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:28:53,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:53,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash 77932564, now seen corresponding path program 1 times [2025-01-09 18:28:53,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014293406] [2025-01-09 18:28:53,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:54,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 18:28:54,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 18:28:54,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:54,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 18:28:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014293406] [2025-01-09 18:28:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014293406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037956622] [2025-01-09 18:28:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:54,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:54,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:54,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:54,496 INFO L87 Difference]: Start difference. First operand 9856 states and 13823 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 18:28:58,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:28:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:59,146 INFO L93 Difference]: Finished difference Result 25325 states and 35545 transitions. [2025-01-09 18:28:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-01-09 18:28:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:59,207 INFO L225 Difference]: With dead ends: 25325 [2025-01-09 18:28:59,207 INFO L226 Difference]: Without dead ends: 15514 [2025-01-09 18:28:59,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:59,242 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 739 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:59,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1761 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 18:28:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15514 states. [2025-01-09 18:28:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15514 to 15495. [2025-01-09 18:28:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15495 states, 12531 states have (on average 1.3946213390790838) internal successors, (17476), 12562 states have internal predecessors, (17476), 2056 states have call successors, (2056), 908 states have call predecessors, (2056), 907 states have return successors, (2114), 2048 states have call predecessors, (2114), 2054 states have call successors, (2114) [2025-01-09 18:28:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15495 states to 15495 states and 21646 transitions. [2025-01-09 18:28:59,835 INFO L78 Accepts]: Start accepts. Automaton has 15495 states and 21646 transitions. Word has length 123 [2025-01-09 18:28:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:59,835 INFO L471 AbstractCegarLoop]: Abstraction has 15495 states and 21646 transitions. [2025-01-09 18:28:59,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 18:28:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 15495 states and 21646 transitions. [2025-01-09 18:28:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 18:28:59,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:59,840 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-01-09 18:28:59,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:28:59,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:59,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1746107022, now seen corresponding path program 1 times [2025-01-09 18:28:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281027986] [2025-01-09 18:28:59,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:00,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 18:29:00,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 18:29:00,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:00,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 18:29:01,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:01,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281027986] [2025-01-09 18:29:01,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281027986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:01,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:01,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 18:29:01,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875046322] [2025-01-09 18:29:01,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:01,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:29:01,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:01,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:29:01,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:29:01,846 INFO L87 Difference]: Start difference. First operand 15495 states and 21646 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 18:29:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:02,610 INFO L93 Difference]: Finished difference Result 20796 states and 29046 transitions. [2025-01-09 18:29:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 18:29:02,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2025-01-09 18:29:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:02,655 INFO L225 Difference]: With dead ends: 20796 [2025-01-09 18:29:02,656 INFO L226 Difference]: Without dead ends: 15604 [2025-01-09 18:29:02,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:29:02,669 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 1 mSDsluCounter, 3214 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:02,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4021 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 18:29:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15604 states. [2025-01-09 18:29:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15604 to 15574. [2025-01-09 18:29:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15574 states, 12610 states have (on average 1.3913560666137985) internal successors, (17545), 12641 states have internal predecessors, (17545), 2056 states have call successors, (2056), 908 states have call predecessors, (2056), 907 states have return successors, (2114), 2048 states have call predecessors, (2114), 2054 states have call successors, (2114) [2025-01-09 18:29:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15574 states to 15574 states and 21715 transitions. [2025-01-09 18:29:03,261 INFO L78 Accepts]: Start accepts. Automaton has 15574 states and 21715 transitions. Word has length 122 [2025-01-09 18:29:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:03,262 INFO L471 AbstractCegarLoop]: Abstraction has 15574 states and 21715 transitions. [2025-01-09 18:29:03,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 18:29:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15574 states and 21715 transitions. [2025-01-09 18:29:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 18:29:03,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:03,274 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2025-01-09 18:29:03,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:29:03,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:03,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 378511688, now seen corresponding path program 1 times [2025-01-09 18:29:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:03,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180314497] [2025-01-09 18:29:03,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:04,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 18:29:04,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 18:29:04,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:04,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 18:29:04,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:04,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180314497] [2025-01-09 18:29:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180314497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:04,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:04,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:29:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590144484] [2025-01-09 18:29:04,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:04,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:29:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:04,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:29:04,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:04,409 INFO L87 Difference]: Start difference. First operand 15574 states and 21715 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:29:08,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:29:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:09,505 INFO L93 Difference]: Finished difference Result 39425 states and 55022 transitions. [2025-01-09 18:29:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:29:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 141 [2025-01-09 18:29:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:09,587 INFO L225 Difference]: With dead ends: 39425 [2025-01-09 18:29:09,587 INFO L226 Difference]: Without dead ends: 23896 [2025-01-09 18:29:09,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:09,621 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 731 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:09,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1731 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 18:29:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23896 states. [2025-01-09 18:29:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23896 to 23884. [2025-01-09 18:29:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23884 states, 19459 states have (on average 1.389280024667249) internal successors, (27034), 19496 states have internal predecessors, (27034), 3040 states have call successors, (3040), 1385 states have call predecessors, (3040), 1384 states have return successors, (3110), 3032 states have call predecessors, (3110), 3038 states have call successors, (3110) [2025-01-09 18:29:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23884 states to 23884 states and 33184 transitions. [2025-01-09 18:29:10,488 INFO L78 Accepts]: Start accepts. Automaton has 23884 states and 33184 transitions. Word has length 141 [2025-01-09 18:29:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:10,489 INFO L471 AbstractCegarLoop]: Abstraction has 23884 states and 33184 transitions. [2025-01-09 18:29:10,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:29:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 23884 states and 33184 transitions. [2025-01-09 18:29:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 18:29:10,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:10,501 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2025-01-09 18:29:10,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:29:10,502 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:10,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:10,502 INFO L85 PathProgramCache]: Analyzing trace with hash -537745131, now seen corresponding path program 1 times [2025-01-09 18:29:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:10,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506285544] [2025-01-09 18:29:10,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:10,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:11,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 18:29:11,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 18:29:11,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:11,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 18:29:12,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:12,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506285544] [2025-01-09 18:29:12,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506285544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:12,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:12,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:29:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499111513] [2025-01-09 18:29:12,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:29:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:12,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:29:12,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:29:12,619 INFO L87 Difference]: Start difference. First operand 23884 states and 33184 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 18:29:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:13,545 INFO L93 Difference]: Finished difference Result 32009 states and 44445 transitions. [2025-01-09 18:29:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:29:13,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 140 [2025-01-09 18:29:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:13,605 INFO L225 Difference]: With dead ends: 32009 [2025-01-09 18:29:13,605 INFO L226 Difference]: Without dead ends: 16043 [2025-01-09 18:29:13,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:29:13,630 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 43 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:13,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3975 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:29:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16043 states. [2025-01-09 18:29:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16043 to 16011. [2025-01-09 18:29:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16011 states, 13055 states have (on average 1.3852163921869016) internal successors, (18084), 13080 states have internal predecessors, (18084), 2030 states have call successors, (2030), 926 states have call predecessors, (2030), 925 states have return successors, (2052), 2024 states have call predecessors, (2052), 2028 states have call successors, (2052) [2025-01-09 18:29:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16011 states to 16011 states and 22166 transitions. [2025-01-09 18:29:14,434 INFO L78 Accepts]: Start accepts. Automaton has 16011 states and 22166 transitions. Word has length 140 [2025-01-09 18:29:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:14,435 INFO L471 AbstractCegarLoop]: Abstraction has 16011 states and 22166 transitions. [2025-01-09 18:29:14,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 18:29:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16011 states and 22166 transitions. [2025-01-09 18:29:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 18:29:14,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:14,448 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2025-01-09 18:29:14,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:29:14,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:14,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash -701311861, now seen corresponding path program 1 times [2025-01-09 18:29:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:14,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642566046] [2025-01-09 18:29:14,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:15,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 18:29:15,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 18:29:15,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:15,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-01-09 18:29:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:16,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642566046] [2025-01-09 18:29:16,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642566046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:16,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:16,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:29:16,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140004526] [2025-01-09 18:29:16,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:16,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:29:16,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:16,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:29:16,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:29:16,228 INFO L87 Difference]: Start difference. First operand 16011 states and 22166 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2025-01-09 18:29:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:16,770 INFO L93 Difference]: Finished difference Result 31993 states and 44301 transitions. [2025-01-09 18:29:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:29:16,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 145 [2025-01-09 18:29:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:16,826 INFO L225 Difference]: With dead ends: 31993 [2025-01-09 18:29:16,827 INFO L226 Difference]: Without dead ends: 16012 [2025-01-09 18:29:16,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:29:16,855 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 0 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2422 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:16,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2422 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:29:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16012 states. [2025-01-09 18:29:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 16012. [2025-01-09 18:29:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16012 states, 13056 states have (on average 1.385186887254902) internal successors, (18085), 13081 states have internal predecessors, (18085), 2030 states have call successors, (2030), 926 states have call predecessors, (2030), 925 states have return successors, (2052), 2024 states have call predecessors, (2052), 2028 states have call successors, (2052) [2025-01-09 18:29:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16012 states to 16012 states and 22167 transitions. [2025-01-09 18:29:17,362 INFO L78 Accepts]: Start accepts. Automaton has 16012 states and 22167 transitions. Word has length 145 [2025-01-09 18:29:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:17,364 INFO L471 AbstractCegarLoop]: Abstraction has 16012 states and 22167 transitions. [2025-01-09 18:29:17,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2025-01-09 18:29:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16012 states and 22167 transitions. [2025-01-09 18:29:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 18:29:17,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:17,374 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2025-01-09 18:29:17,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:29:17,374 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:17,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1124859389, now seen corresponding path program 1 times [2025-01-09 18:29:17,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:17,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805474144] [2025-01-09 18:29:17,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:17,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:18,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 18:29:18,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 18:29:18,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:18,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-01-09 18:29:19,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:19,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805474144] [2025-01-09 18:29:19,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805474144] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:29:19,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854877695] [2025-01-09 18:29:19,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:19,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:29:19,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:29:19,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:29:19,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:29:21,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 18:29:21,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 18:29:21,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:21,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:21,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 2214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 18:29:21,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:29:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 18:29:24,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:29:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854877695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:24,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:29:24,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-01-09 18:29:24,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377334870] [2025-01-09 18:29:24,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:24,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 18:29:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:24,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 18:29:24,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 18:29:24,377 INFO L87 Difference]: Start difference. First operand 16012 states and 22167 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 18:29:28,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:29:32,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []