./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.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 c8d89254e21d3cff4bd8dad11ae69c000c4021a6b9610439085c76aaeb5514f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:35:01,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:35:01,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:35:01,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:35:01,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:35:01,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:35:01,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:35:01,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:35:01,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:35:01,246 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:35:01,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:35:01,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:35:01,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:35:01,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:35:01,247 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:35:01,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:35:01,248 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:35:01,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:35:01,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:35:01,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:35:01,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:35:01,249 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:35:01,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:35:01,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:35:01,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:35:01,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:35:01,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:35:01,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:35:01,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:35:01,250 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 -> c8d89254e21d3cff4bd8dad11ae69c000c4021a6b9610439085c76aaeb5514f3 [2025-02-06 06:35:01,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:35:01,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:35:01,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:35:01,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:35:01,495 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:35:01,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2025-02-06 06:35:02,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f33387ca/b90ef57197a8494fb4c9025201f79188/FLAG5281a2f58 [2025-02-06 06:35:03,000 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:35:03,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2025-02-06 06:35:03,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f33387ca/b90ef57197a8494fb4c9025201f79188/FLAG5281a2f58 [2025-02-06 06:35:03,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f33387ca/b90ef57197a8494fb4c9025201f79188 [2025-02-06 06:35:03,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:35:03,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:35:03,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:35:03,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:35:03,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:35:03,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d55bfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03, skipping insertion in model container [2025-02-06 06:35:03,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:35:03,524 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2025-02-06 06:35:03,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:35:03,558 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:35:03,656 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2025-02-06 06:35:03,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:35:03,689 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:35:03,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03 WrapperNode [2025-02-06 06:35:03,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:35:03,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:35:03,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:35:03,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:35:03,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,757 INFO L138 Inliner]: procedures = 90, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 594 [2025-02-06 06:35:03,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:35:03,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:35:03,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:35:03,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:35:03,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,812 INFO L175 MemorySlicer]: Split 42 memory accesses to 3 slices as follows [2, 25, 15]. 60 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 0, 4]. The 29 writes are split as follows [0, 25, 4]. [2025-02-06 06:35:03,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:35:03,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:35:03,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:35:03,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:35:03,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (1/1) ... [2025-02-06 06:35:03,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:35:03,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:03,889 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-02-06 06:35:03,915 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-02-06 06:35:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-02-06 06:35:03,937 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2025-02-06 06:35:03,937 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-02-06 06:35:03,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-02-06 06:35:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:35:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 06:35:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:35:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2025-02-06 06:35:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2025-02-06 06:35:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-02-06 06:35:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:35:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-02-06 06:35:03,938 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:35:03,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:35:03,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2025-02-06 06:35:03,939 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:35:03,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2025-02-06 06:35:03,939 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2025-02-06 06:35:03,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:35:03,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:35:04,132 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:35:04,133 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:35:04,153 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: havoc #t~mem21.base, #t~mem21.offset; [2025-02-06 06:35:04,332 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; [2025-02-06 06:35:04,332 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3459: havoc request_threaded_irq_#t~nondet96#1; [2025-02-06 06:35:04,332 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3452: havoc platform_get_resource_#t~ret95#1.base, platform_get_resource_#t~ret95#1.offset; [2025-02-06 06:35:04,332 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3440: havoc iio_trigger_register_#t~nondet94#1; [2025-02-06 06:35:04,333 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3433: havoc iio_trigger_alloc_#t~ret93#1.base, iio_trigger_alloc_#t~ret93#1.offset; [2025-02-06 06:35:04,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:35:08,568 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424: havoc __platform_driver_register_#t~nondet92#1; [2025-02-06 06:35:08,640 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-02-06 06:35:08,640 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:35:08,660 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:35:08,660 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:35:08,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:35:08 BoogieIcfgContainer [2025-02-06 06:35:08,660 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:35:08,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:35:08,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:35:08,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:35:08,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:35:03" (1/3) ... [2025-02-06 06:35:08,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf6b0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:35:08, skipping insertion in model container [2025-02-06 06:35:08,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:03" (2/3) ... [2025-02-06 06:35:08,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf6b0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:35:08, skipping insertion in model container [2025-02-06 06:35:08,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:35:08" (3/3) ... [2025-02-06 06:35:08,667 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2025-02-06 06:35:08,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:35:08,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i that has 16 procedures, 205 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-06 06:35:08,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:35:08,762 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;@4b894beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:35:08,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:35:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 155 states have (on average 1.367741935483871) internal successors, (212), 168 states have internal predecessors, (212), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 06:35:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 06:35:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:08,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:08,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1594809725, now seen corresponding path program 1 times [2025-02-06 06:35:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:08,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544157174] [2025-02-06 06:35:08,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:08,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 06:35:08,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 06:35:08,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:08,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:35:09,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:35:09,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544157174] [2025-02-06 06:35:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544157174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:09,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:09,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:35:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893776323] [2025-02-06 06:35:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:09,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:09,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:35:09,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:09,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:35:09,247 INFO L87 Difference]: Start difference. First operand has 207 states, 155 states have (on average 1.367741935483871) internal successors, (212), 168 states have internal predecessors, (212), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:35:11,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:35:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:11,722 INFO L93 Difference]: Finished difference Result 587 states and 806 transitions. [2025-02-06 06:35:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 06:35:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:11,731 INFO L225 Difference]: With dead ends: 587 [2025-02-06 06:35:11,732 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 06:35:11,735 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-02-06 06:35:11,736 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 243 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:11,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 503 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 06:35:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 06:35:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2025-02-06 06:35:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 281 states have (on average 1.302491103202847) internal successors, (366), 286 states have internal predecessors, (366), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 06:35:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 468 transitions. [2025-02-06 06:35:11,795 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 468 transitions. Word has length 16 [2025-02-06 06:35:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:11,796 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 468 transitions. [2025-02-06 06:35:11,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:35:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 468 transitions. [2025-02-06 06:35:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 06:35:11,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:11,798 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] [2025-02-06 06:35:11,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:35:11,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:11,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash -936763077, now seen corresponding path program 1 times [2025-02-06 06:35:11,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:11,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529607012] [2025-02-06 06:35:11,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:11,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 06:35:11,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 06:35:11,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:11,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:35:11,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:35:11,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529607012] [2025-02-06 06:35:11,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529607012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:11,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:11,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:35:11,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619396454] [2025-02-06 06:35:11,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:35:11,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:11,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:35:11,974 INFO L87 Difference]: Start difference. First operand 359 states and 468 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 06:35:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:12,022 INFO L93 Difference]: Finished difference Result 369 states and 476 transitions. [2025-02-06 06:35:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:12,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-02-06 06:35:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:12,025 INFO L225 Difference]: With dead ends: 369 [2025-02-06 06:35:12,025 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 06:35:12,025 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-02-06 06:35:12,026 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 243 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:12,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 253 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 06:35:12,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 359. [2025-02-06 06:35:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 281 states have (on average 1.298932384341637) internal successors, (365), 286 states have internal predecessors, (365), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 06:35:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 467 transitions. [2025-02-06 06:35:12,052 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 467 transitions. Word has length 32 [2025-02-06 06:35:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:12,053 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 467 transitions. [2025-02-06 06:35:12,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 06:35:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 467 transitions. [2025-02-06 06:35:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 06:35:12,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:12,056 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] [2025-02-06 06:35:12,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:35:12,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:12,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash -908133926, now seen corresponding path program 1 times [2025-02-06 06:35:12,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:12,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208809947] [2025-02-06 06:35:12,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:12,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:12,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 06:35:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 06:35:12,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:12,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:35:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:35:12,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208809947] [2025-02-06 06:35:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208809947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:12,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:12,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:35:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98221036] [2025-02-06 06:35:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:12,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:35:12,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:12,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:35:12,214 INFO L87 Difference]: Start difference. First operand 359 states and 467 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 06:35:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:12,249 INFO L93 Difference]: Finished difference Result 712 states and 940 transitions. [2025-02-06 06:35:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:12,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-02-06 06:35:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:12,252 INFO L225 Difference]: With dead ends: 712 [2025-02-06 06:35:12,254 INFO L226 Difference]: Without dead ends: 351 [2025-02-06 06:35:12,257 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-02-06 06:35:12,257 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:12,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:12,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-02-06 06:35:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2025-02-06 06:35:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 273 states have (on average 1.293040293040293) internal successors, (353), 277 states have internal predecessors, (353), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 06:35:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 454 transitions. [2025-02-06 06:35:12,288 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 454 transitions. Word has length 32 [2025-02-06 06:35:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:12,288 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 454 transitions. [2025-02-06 06:35:12,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 06:35:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 454 transitions. [2025-02-06 06:35:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 06:35:12,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:12,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:35:12,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 245414114, now seen corresponding path program 1 times [2025-02-06 06:35:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670295310] [2025-02-06 06:35:12,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:12,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 06:35:12,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 06:35:12,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:12,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 06:35:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:35:12,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670295310] [2025-02-06 06:35:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670295310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:12,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:35:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835380598] [2025-02-06 06:35:12,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:12,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:35:12,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:12,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:35:12,406 INFO L87 Difference]: Start difference. First operand 350 states and 454 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:35:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:12,460 INFO L93 Difference]: Finished difference Result 739 states and 962 transitions. [2025-02-06 06:35:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:12,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2025-02-06 06:35:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:12,463 INFO L225 Difference]: With dead ends: 739 [2025-02-06 06:35:12,463 INFO L226 Difference]: Without dead ends: 391 [2025-02-06 06:35:12,464 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-02-06 06:35:12,464 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 52 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:12,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 458 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-06 06:35:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2025-02-06 06:35:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 307 states have (on average 1.296416938110749) internal successors, (398), 311 states have internal predecessors, (398), 55 states have call successors, (55), 27 states have call predecessors, (55), 26 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 06:35:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 507 transitions. [2025-02-06 06:35:12,487 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 507 transitions. Word has length 49 [2025-02-06 06:35:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:12,487 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 507 transitions. [2025-02-06 06:35:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:35:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 507 transitions. [2025-02-06 06:35:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 06:35:12,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:12,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:12,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:35:12,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:12,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash -189718062, now seen corresponding path program 1 times [2025-02-06 06:35:12,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:12,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734474391] [2025-02-06 06:35:12,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:12,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 06:35:12,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 06:35:12,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:12,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 06:35:12,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:35:12,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734474391] [2025-02-06 06:35:12,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734474391] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:35:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204414180] [2025-02-06 06:35:12,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:12,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:12,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:12,735 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-02-06 06:35:12,735 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-02-06 06:35:12,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 06:35:13,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 06:35:13,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:13,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:35:13,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 06:35:13,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:13,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204414180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:13,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:35:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-06 06:35:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181675670] [2025-02-06 06:35:13,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:13,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:13,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:35:13,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:13,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:13,117 INFO L87 Difference]: Start difference. First operand 389 states and 507 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 06:35:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:13,188 INFO L93 Difference]: Finished difference Result 1033 states and 1343 transitions. [2025-02-06 06:35:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:13,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-02-06 06:35:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:13,193 INFO L225 Difference]: With dead ends: 1033 [2025-02-06 06:35:13,193 INFO L226 Difference]: Without dead ends: 686 [2025-02-06 06:35:13,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:13,194 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 169 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:13,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 487 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-06 06:35:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 682. [2025-02-06 06:35:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 545 states have (on average 1.2990825688073395) internal successors, (708), 553 states have internal predecessors, (708), 89 states have call successors, (89), 48 states have call predecessors, (89), 47 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-06 06:35:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 885 transitions. [2025-02-06 06:35:13,221 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 885 transitions. Word has length 73 [2025-02-06 06:35:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:13,222 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 885 transitions. [2025-02-06 06:35:13,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 06:35:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 885 transitions. [2025-02-06 06:35:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 06:35:13,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:13,223 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 06:35:13,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 06:35:13,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:13,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:13,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash 396910448, now seen corresponding path program 1 times [2025-02-06 06:35:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34516561] [2025-02-06 06:35:13,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:13,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 06:35:13,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 06:35:13,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:13,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 06:35:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:35:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34516561] [2025-02-06 06:35:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34516561] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:35:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14746668] [2025-02-06 06:35:13,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:13,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:13,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:35:13,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:35:14,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 06:35:14,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 06:35:14,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:14,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:14,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 06:35:14,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 06:35:14,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:14,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14746668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:14,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:35:14,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-06 06:35:14,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132360279] [2025-02-06 06:35:14,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:14,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:35:14,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:14,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:35:14,154 INFO L87 Difference]: Start difference. First operand 682 states and 885 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:35:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:14,187 INFO L93 Difference]: Finished difference Result 1322 states and 1718 transitions. [2025-02-06 06:35:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2025-02-06 06:35:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:14,192 INFO L225 Difference]: With dead ends: 1322 [2025-02-06 06:35:14,192 INFO L226 Difference]: Without dead ends: 682 [2025-02-06 06:35:14,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:35:14,195 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 2 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:14,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 465 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:14,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-06 06:35:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-02-06 06:35:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 545 states have (on average 1.2917431192660551) internal successors, (704), 553 states have internal predecessors, (704), 89 states have call successors, (89), 48 states have call predecessors, (89), 47 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-06 06:35:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 881 transitions. [2025-02-06 06:35:14,232 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 881 transitions. Word has length 75 [2025-02-06 06:35:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:14,233 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 881 transitions. [2025-02-06 06:35:14,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:35:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 881 transitions. [2025-02-06 06:35:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 06:35:14,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:14,235 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 06:35:14,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 06:35:14,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:14,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1570347036, now seen corresponding path program 1 times [2025-02-06 06:35:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:14,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944937636] [2025-02-06 06:35:14,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:14,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:14,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 06:35:14,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 06:35:14,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:14,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 06:35:14,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:35:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944937636] [2025-02-06 06:35:14,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944937636] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:35:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994816276] [2025-02-06 06:35:14,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:14,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:14,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:14,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:35:14,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 06:35:14,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 06:35:15,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 06:35:15,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:15,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:15,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 06:35:15,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 06:35:15,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994816276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:15,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:35:15,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-02-06 06:35:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902059880] [2025-02-06 06:35:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:15,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:35:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:35:15,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:35:15,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:15,058 INFO L87 Difference]: Start difference. First operand 682 states and 881 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:35:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:15,109 INFO L93 Difference]: Finished difference Result 1342 states and 1742 transitions. [2025-02-06 06:35:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:35:15,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-02-06 06:35:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:15,115 INFO L225 Difference]: With dead ends: 1342 [2025-02-06 06:35:15,115 INFO L226 Difference]: Without dead ends: 702 [2025-02-06 06:35:15,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:15,119 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:15,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1153 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-06 06:35:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-02-06 06:35:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 561 states have (on average 1.2834224598930482) internal successors, (720), 569 states have internal predecessors, (720), 89 states have call successors, (89), 48 states have call predecessors, (89), 51 states have return successors, (100), 92 states have call predecessors, (100), 88 states have call successors, (100) [2025-02-06 06:35:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 909 transitions. [2025-02-06 06:35:15,151 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 909 transitions. Word has length 77 [2025-02-06 06:35:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:15,152 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 909 transitions. [2025-02-06 06:35:15,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:35:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 909 transitions. [2025-02-06 06:35:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 06:35:15,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:15,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:15,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 06:35:15,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:15,355 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:15,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash 260482915, now seen corresponding path program 1 times [2025-02-06 06:35:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211517448] [2025-02-06 06:35:15,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:15,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 06:35:15,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 06:35:15,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:15,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 06:35:15,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:35:15,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211517448] [2025-02-06 06:35:15,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211517448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:35:15,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226725833] [2025-02-06 06:35:15,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:15,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:15,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:15,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:35:15,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 06:35:15,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 06:35:16,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 06:35:16,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:16,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:16,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 06:35:16,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 06:35:16,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:16,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226725833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:16,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:35:16,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-02-06 06:35:16,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538421812] [2025-02-06 06:35:16,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:16,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:35:16,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:35:16,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:35:16,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:16,046 INFO L87 Difference]: Start difference. First operand 702 states and 909 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:35:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:16,103 INFO L93 Difference]: Finished difference Result 1374 states and 1782 transitions. [2025-02-06 06:35:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:35:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 83 [2025-02-06 06:35:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:16,108 INFO L225 Difference]: With dead ends: 1374 [2025-02-06 06:35:16,108 INFO L226 Difference]: Without dead ends: 714 [2025-02-06 06:35:16,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:16,110 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:16,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1149 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-02-06 06:35:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2025-02-06 06:35:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 573 states have (on average 1.2774869109947644) internal successors, (732), 577 states have internal predecessors, (732), 89 states have call successors, (89), 48 states have call predecessors, (89), 51 states have return successors, (100), 96 states have call predecessors, (100), 88 states have call successors, (100) [2025-02-06 06:35:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 921 transitions. [2025-02-06 06:35:16,158 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 921 transitions. Word has length 83 [2025-02-06 06:35:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:16,158 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 921 transitions. [2025-02-06 06:35:16,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:35:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 921 transitions. [2025-02-06 06:35:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 06:35:16,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:16,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:16,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 06:35:16,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 06:35:16,368 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:16,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1334209750, now seen corresponding path program 2 times [2025-02-06 06:35:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:35:16,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975013267] [2025-02-06 06:35:16,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:35:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:35:16,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-06 06:35:16,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 06:35:16,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 06:35:16,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 06:35:16,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 06:35:16,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 06:35:16,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 06:35:16,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:16,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 06:35:16,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 06:35:16,623 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 06:35:16,624 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 06:35:16,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:35:16,627 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:16,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 06:35:16,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:35:16 BoogieIcfgContainer [2025-02-06 06:35:16,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 06:35:16,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 06:35:16,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 06:35:16,733 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 06:35:16,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:35:08" (3/4) ... [2025-02-06 06:35:16,735 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 06:35:16,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 06:35:16,737 INFO L158 Benchmark]: Toolchain (without parser) took 13687.31ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 102.0MB in the beginning and 267.3MB in the end (delta: -165.3MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2025-02-06 06:35:16,737 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 06:35:16,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.56ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 49.9MB in the end (delta: 52.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 06:35:16,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.80ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 46.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 06:35:16,738 INFO L158 Benchmark]: Boogie Preprocessor took 103.94ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 37.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 06:35:16,738 INFO L158 Benchmark]: IcfgBuilder took 4798.49ms. Allocated memory is still 142.6MB. Free memory was 37.0MB in the beginning and 43.0MB in the end (delta: -6.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-02-06 06:35:16,739 INFO L158 Benchmark]: TraceAbstraction took 8070.83ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 43.0MB in the beginning and 267.3MB in the end (delta: -224.3MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2025-02-06 06:35:16,739 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 419.4MB. Free memory was 267.3MB in the beginning and 267.3MB in the end (delta: 54.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 06:35:16,740 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.56ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 49.9MB in the end (delta: 52.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.80ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 46.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 103.94ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 37.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 4798.49ms. Allocated memory is still 142.6MB. Free memory was 37.0MB in the beginning and 43.0MB in the end (delta: -6.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8070.83ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 43.0MB in the beginning and 267.3MB in the end (delta: -224.3MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 419.4MB. Free memory was 267.3MB in the beginning and 267.3MB in the end (delta: 54.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 3317]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 2678. Possible FailurePath: [L2766] int ldv_irq_1_2 = 0; [L2767] int LDV_IN_INTERRUPT = 1; [L2768] int ldv_irq_1_3 = 0; [L2769] void *ldv_irq_data_1_1 ; [L2770] int ldv_irq_1_1 = 0; [L2771] int ldv_irq_1_0 = 0; [L2772] int probed_2 = 0; [L2773] int ldv_irq_line_1_3 ; [L2774] void *ldv_irq_data_1_0 ; [L2775] int ldv_state_variable_0 ; [L2776] int ldv_irq_line_1_0 ; [L2777] int ldv_state_variable_2 ; [L2778] void *ldv_irq_data_1_3 ; [L2779] int ref_cnt ; [L2780] int ldv_irq_line_1_1 ; [L2781] struct platform_device *iio_interrupt_trigger_driver_group1 ; [L2782] void *ldv_irq_data_1_2 ; [L2783] int ldv_state_variable_1 ; [L2784] int ldv_irq_line_1_2 ; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2881] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2958-L2968] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2984] int ldv_retval_0 ; [L2985] int ldv_retval_1 ; [L2988] int ldv_retval_2 ; [L3356] int ldv_module_refcounter = 1; VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, probed_2=0, ref_cnt=0] [L3137] int tmp ; [L3138] int tmp___0 ; [L3139] int tmp___1 ; [L3141] FCALL ldv_initialize() [L3142] ldv_state_variable_1 = 1 [L3143] ref_cnt = 0 [L3144] ldv_state_variable_0 = 1 [L3145] ldv_state_variable_2 = 0 VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0] [L3147] tmp = __VERIFIER_nondet_int() [L3149] case 0: [L3155] case 1: [L3157] tmp___0 = __VERIFIER_nondet_int() [L3159] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0, tmp=1, tmp___0=1] [L3155] case 1: [L3167] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0, tmp=1] [L3155] case 1: [L3169] CALL, EXPR iio_interrupt_trigger_driver_init() [L2971] int tmp ; [L2973] CALL, EXPR ldv___platform_driver_register_10(& iio_interrupt_trigger_driver, & __this_module) [L3294] ldv_func_ret_type___0 ldv_func_res ; [L3295] int tmp ; [L3297] CALL, EXPR __platform_driver_register(ldv_func_arg1, ldv_func_arg2) [L3424] return __VERIFIER_nondet_int(); [L3297] RET, EXPR __platform_driver_register(ldv_func_arg1, ldv_func_arg2) [L3297] tmp = __platform_driver_register(ldv_func_arg1, ldv_func_arg2) [L3298] ldv_func_res = tmp [L3299] ldv_state_variable_2 = 1 [L3300] CALL ldv_platform_driver_init_2() [L3102] void *tmp ; [L3104] CALL, EXPR ldv_init_zalloc(1472UL) [L2726] void *p ; [L2727] void *tmp ; [L2729] EXPR, FCALL calloc(1UL, size) VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=1472] [L2729] tmp = calloc(1UL, size) [L2730] p = tmp VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, p={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, size=1472] [L2731] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2688] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2731] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, p={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, size=1472] [L2732] return (p); VAL [LDV_IN_INTERRUPT=1, \result={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=1472] [L3104] RET, EXPR ldv_init_zalloc(1472UL) [L3104] tmp = ldv_init_zalloc(1472UL) [L3105] iio_interrupt_trigger_driver_group1 = (struct platform_device *)tmp VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3300] RET ldv_platform_driver_init_2() [L3301] return (ldv_func_res); VAL [LDV_IN_INTERRUPT=1, \result=0, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2973] RET, EXPR ldv___platform_driver_register_10(& iio_interrupt_trigger_driver, & __this_module) [L2973] tmp = ldv___platform_driver_register_10(& iio_interrupt_trigger_driver, & __this_module) [L2974] return (tmp); VAL [LDV_IN_INTERRUPT=1, \result=0, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3169] RET, EXPR iio_interrupt_trigger_driver_init() [L3169] ldv_retval_0 = iio_interrupt_trigger_driver_init() [L3155] case 1: [L3171] ldv_state_variable_0 = 3 VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp=1] [L3155] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp=1] [L3147] tmp = __VERIFIER_nondet_int() [L3149] case 0: [L3155] case 1: [L3189] case 2: [L3191] tmp___1 = __VERIFIER_nondet_int() [L3193] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp___1=0] [L3189] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp___1=0] [L3195] CALL iio_interrupt_trigger_probe(iio_interrupt_trigger_driver_group1) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2884] struct iio_interrupt_trigger_info *trig_info ; [L2885] struct iio_trigger *trig ; [L2886] unsigned long irqflags ; [L2887] struct resource *irq_res ; [L2888] int irq ; [L2889] int ret ; [L2890] void *tmp ; [L2892] ret = 0 [L2893] CALL, EXPR platform_get_resource(pdev, 1024U, 0U) [L3452] CALL, EXPR ldv_malloc(sizeof(struct resource)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND FALSE !(tmp___0 != 0) [L2700] tmp = malloc(size) [L2701] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 1 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2702] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2688] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2702] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 1 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2703] return (p); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, \result={-(((__int128) 1 << 64) | 18446744073709551615U):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3452] RET, EXPR ldv_malloc(sizeof(struct resource)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3452] return ldv_malloc(sizeof(struct resource)); [L2893] RET, EXPR platform_get_resource(pdev, 1024U, 0U) [L2893] irq_res = platform_get_resource(pdev, 1024U, 0U) [L2894] COND FALSE !((unsigned long )irq_res == (unsigned long )((struct resource *)0)) [L2898] EXPR irq_res->flags VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq_res={-(((__int128) 1 << 64) | 18446744073709551615U):0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0] [L2898] EXPR (irq_res->flags & 15UL) | 128UL VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq_res={-(((__int128) 1 << 64) | 18446744073709551615U):0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0] [L2898] irqflags = (irq_res->flags & 15UL) | 128UL [L2899] EXPR irq_res->start [L2899] irq = (int )irq_res->start [L2900] CALL, EXPR iio_trigger_alloc("irqtrig%d", irq) [L3433] CALL, EXPR ldv_malloc(sizeof(struct iio_trigger)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND FALSE !(tmp___0 != 0) [L2700] tmp = malloc(size) [L2701] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 0 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2702] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2688] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2702] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 0 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2703] return (p); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, \result={-(((__int128) 0 << 64) | 18446744073709551615U):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3433] RET, EXPR ldv_malloc(sizeof(struct iio_trigger)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3433] return ldv_malloc(sizeof(struct iio_trigger)); [L2900] RET, EXPR iio_trigger_alloc("irqtrig%d", irq) [L2900] trig = iio_trigger_alloc("irqtrig%d", irq) [L2901] COND FALSE !((unsigned long )trig == (unsigned long )((struct iio_trigger *)0)) [L2906] CALL, EXPR kzalloc(4UL, 208U) [L2676] void *tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, flags=208, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2678] EXPR flags | 32768U VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2678] CALL, EXPR kmalloc(size, flags | 32768U) [L2667] void *tmp___2 ; [L2669] CALL, EXPR __kmalloc(size, flags) [L2662] CALL, EXPR ldv_malloc(size) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=4, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND TRUE tmp___0 != 0 [L2698] return ((void *)0); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=4, \result={0:0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2662] RET, EXPR ldv_malloc(size) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2662] return ldv_malloc(size); [L2669] RET, EXPR __kmalloc(size, flags) [L2669] tmp___2 = __kmalloc(size, flags) [L2670] return (tmp___2); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \result={0:0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2678] RET, EXPR kmalloc(size, flags | 32768U) [L2678] tmp = kmalloc(size, flags | 32768U) [L2679] return (tmp); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \result={0:0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2906] RET, EXPR kzalloc(4UL, 208U) [L2906] tmp = kzalloc(4UL, 208U) [L2907] trig_info = (struct iio_interrupt_trigger_info *)tmp VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq=1, irqflags=128, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, trig={-(((__int128) 0 << 64) | 18446744073709551615U):0}, trig_info={0:0}] [L2908] COND TRUE (unsigned long )trig_info == (unsigned long )((struct iio_interrupt_trigger_info *)0) [L2909] ret = -12 VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={(((unsigned __int128) 1 << 64) | 1):0}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq=1, irqflags=128, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={(((unsigned __int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, ret=-12, trig={-(((__int128) 0 << 64) | 18446744073709551615U):0}] [L2935] CALL iio_trigger_put(trig) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2850] EXPR trig->ops [L2850] EXPR (trig->ops)->owner [L2850] CALL ldv_module_put_5((trig->ops)->owner) [L3247] CALL ldv_module_put(ldv_func_arg1) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3387] COND TRUE (unsigned long )module != (unsigned long )((struct module *)0) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3388] COND TRUE ldv_module_refcounter <= 1 VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3389] CALL ldv_error() VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3317] reach_error() VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={(((unsigned __int128) 1 << 64) | 25):(((unsigned __int128) 1 << 64) | 31)}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={(((unsigned __int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 205 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 931 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 931 mSDsluCounter, 4709 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2760 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1949 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=714occurred in iteration=8, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3094 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 100/113 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 06:35:16,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 c8d89254e21d3cff4bd8dad11ae69c000c4021a6b9610439085c76aaeb5514f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:35:18,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:35:18,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-06 06:35:18,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:35:18,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:35:18,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:35:18,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:35:18,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:35:18,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:35:18,764 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:35:18,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:35:18,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:35:18,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:35:18,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:35:18,765 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:35:18,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:35:18,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:35:18,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:35:18,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:35:18,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:35:18,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:35:18,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 06:35:18,766 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 06:35:18,766 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:35:18,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:35:18,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:35:18,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:35:18,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:35:18,768 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 -> c8d89254e21d3cff4bd8dad11ae69c000c4021a6b9610439085c76aaeb5514f3 [2025-02-06 06:35:18,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:35:19,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:35:19,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:35:19,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:35:19,004 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:35:19,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2025-02-06 06:35:20,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc4cfa56e/cb7a419e0081406a8726a2374da8d0fe/FLAGbd8034e3e [2025-02-06 06:35:20,540 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:35:20,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2025-02-06 06:35:20,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc4cfa56e/cb7a419e0081406a8726a2374da8d0fe/FLAGbd8034e3e [2025-02-06 06:35:20,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc4cfa56e/cb7a419e0081406a8726a2374da8d0fe [2025-02-06 06:35:20,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:35:20,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:35:20,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:35:20,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:35:20,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:35:20,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:35:20" (1/1) ... [2025-02-06 06:35:20,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b356991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:20, skipping insertion in model container [2025-02-06 06:35:20,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:35:20" (1/1) ... [2025-02-06 06:35:20,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:35:21,016 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,045 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,057 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,057 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,058 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,059 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,059 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,061 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,067 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,067 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,083 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,104 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2025-02-06 06:35:21,123 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 06:35:21,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:35:21,144 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:35:21,272 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i[90555,90568] [2025-02-06 06:35:21,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:35:21,333 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:35:21,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21 WrapperNode [2025-02-06 06:35:21,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:35:21,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:35:21,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:35:21,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:35:21,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,397 INFO L138 Inliner]: procedures = 95, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 553 [2025-02-06 06:35:21,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:35:21,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:35:21,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:35:21,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:35:21,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,448 INFO L175 MemorySlicer]: Split 42 memory accesses to 3 slices as follows [2, 25, 15]. 60 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 0, 4]. The 29 writes are split as follows [0, 25, 4]. [2025-02-06 06:35:21,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:35:21,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:35:21,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:35:21,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:35:21,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (1/1) ... [2025-02-06 06:35:21,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:35:21,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:21,531 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-02-06 06:35:21,536 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-02-06 06:35:21,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:35:21,550 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-02-06 06:35:21,550 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-02-06 06:35:21,550 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2025-02-06 06:35:21,550 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2025-02-06 06:35:21,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:35:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:35:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:35:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2025-02-06 06:35:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2025-02-06 06:35:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-02-06 06:35:21,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:35:21,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 06:35:21,552 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:35:21,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2025-02-06 06:35:21,552 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2025-02-06 06:35:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2025-02-06 06:35:21,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-02-06 06:35:21,553 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:35:21,553 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-02-06 06:35:21,553 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:35:21,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2025-02-06 06:35:21,553 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2025-02-06 06:35:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#2 [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#2 [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:35:21,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2025-02-06 06:35:21,555 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2025-02-06 06:35:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:35:21,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:35:21,781 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:35:21,782 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:35:21,815 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: havoc #t~mem20.base, #t~mem20.offset; [2025-02-06 06:35:22,072 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: havoc __kmalloc_#t~ret6#1.base, __kmalloc_#t~ret6#1.offset; [2025-02-06 06:35:22,072 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3459: havoc request_threaded_irq_#t~nondet94#1; [2025-02-06 06:35:22,072 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3452: havoc platform_get_resource_#t~ret93#1.base, platform_get_resource_#t~ret93#1.offset; [2025-02-06 06:35:22,072 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3440: havoc iio_trigger_register_#t~nondet92#1; [2025-02-06 06:35:22,072 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3433: havoc iio_trigger_alloc_#t~ret91#1.base, iio_trigger_alloc_#t~ret91#1.offset; [2025-02-06 06:35:22,100 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:35:26,492 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424: havoc __platform_driver_register_#t~nondet90#1; [2025-02-06 06:35:26,545 INFO L? ?]: Removed 331 outVars from TransFormulas that were not future-live. [2025-02-06 06:35:26,545 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:35:26,553 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:35:26,553 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:35:26,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:35:26 BoogieIcfgContainer [2025-02-06 06:35:26,554 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:35:26,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:35:26,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:35:26,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:35:26,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:35:20" (1/3) ... [2025-02-06 06:35:26,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276296f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:35:26, skipping insertion in model container [2025-02-06 06:35:26,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:35:21" (2/3) ... [2025-02-06 06:35:26,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276296f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:35:26, skipping insertion in model container [2025-02-06 06:35:26,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:35:26" (3/3) ... [2025-02-06 06:35:26,563 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2025-02-06 06:35:26,572 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:35:26,574 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i that has 16 procedures, 197 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-06 06:35:26,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:35:26,626 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;@515c403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:35:26,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:35:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 160 states have internal predecessors, (200), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 06:35:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 06:35:26,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:26,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:26,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash 555374763, now seen corresponding path program 1 times [2025-02-06 06:35:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 06:35:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76655955] [2025-02-06 06:35:26,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:26,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:26,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:26,666 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-02-06 06:35:26,667 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-02-06 06:35:26,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 06:35:26,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 06:35:26,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:26,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:26,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:35:26,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:35:27,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:27,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 06:35:27,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76655955] [2025-02-06 06:35:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76655955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:27,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:27,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 06:35:27,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361876804] [2025-02-06 06:35:27,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:27,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 06:35:27,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:27,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:35:27,040 INFO L87 Difference]: Start difference. First operand has 199 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 160 states have internal predecessors, (200), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:35:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:27,097 INFO L93 Difference]: Finished difference Result 391 states and 526 transitions. [2025-02-06 06:35:27,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:27,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 06:35:27,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:27,108 INFO L225 Difference]: With dead ends: 391 [2025-02-06 06:35:27,108 INFO L226 Difference]: Without dead ends: 177 [2025-02-06 06:35:27,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-02-06 06:35:27,114 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:27,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 250 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-06 06:35:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-02-06 06:35:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.286764705882353) internal successors, (175), 138 states have internal predecessors, (175), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 06:35:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 228 transitions. [2025-02-06 06:35:27,156 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 228 transitions. Word has length 16 [2025-02-06 06:35:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:27,156 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 228 transitions. [2025-02-06 06:35:27,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:35:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2025-02-06 06:35:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 06:35:27,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:27,159 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:35:27,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:35:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:27,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash 323976607, now seen corresponding path program 1 times [2025-02-06 06:35:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 06:35:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731157170] [2025-02-06 06:35:27,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:27,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:27,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:35:27,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:35:27,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 06:35:27,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 06:35:27,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:27,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:27,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:35:27,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:35:27,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:27,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 06:35:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731157170] [2025-02-06 06:35:27,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731157170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:27,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:27,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:35:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431412817] [2025-02-06 06:35:27,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:27,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:27,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 06:35:27,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:27,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:35:27,673 INFO L87 Difference]: Start difference. First operand 177 states and 228 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:35:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:27,772 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2025-02-06 06:35:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:27,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-02-06 06:35:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:27,774 INFO L225 Difference]: With dead ends: 393 [2025-02-06 06:35:27,774 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 06:35:27,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-02-06 06:35:27,775 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 53 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:27,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 442 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:35:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 06:35:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2025-02-06 06:35:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 171 states have (on average 1.2982456140350878) internal successors, (222), 173 states have internal predecessors, (222), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 06:35:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 283 transitions. [2025-02-06 06:35:27,803 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 283 transitions. Word has length 46 [2025-02-06 06:35:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:27,803 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 283 transitions. [2025-02-06 06:35:27,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:35:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 283 transitions. [2025-02-06 06:35:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 06:35:27,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:27,805 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 06:35:27,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 06:35:28,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:28,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:28,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1002076478, now seen corresponding path program 1 times [2025-02-06 06:35:28,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 06:35:28,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694221836] [2025-02-06 06:35:28,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:28,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:28,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:28,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:35:28,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 06:35:28,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 06:35:28,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 06:35:28,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:28,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:28,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 06:35:28,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 06:35:28,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:28,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 06:35:28,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694221836] [2025-02-06 06:35:28,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694221836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:28,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:28,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:35:28,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680005981] [2025-02-06 06:35:28,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:28,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:35:28,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 06:35:28,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:35:28,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:28,540 INFO L87 Difference]: Start difference. First operand 217 states and 283 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:35:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:28,639 INFO L93 Difference]: Finished difference Result 396 states and 517 transitions. [2025-02-06 06:35:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:35:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-02-06 06:35:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:28,642 INFO L225 Difference]: With dead ends: 396 [2025-02-06 06:35:28,643 INFO L226 Difference]: Without dead ends: 222 [2025-02-06 06:35:28,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:28,644 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:28,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1119 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:35:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-06 06:35:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-02-06 06:35:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 177 states have internal predecessors, (226), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (33), 31 states have call predecessors, (33), 30 states have call successors, (33) [2025-02-06 06:35:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 290 transitions. [2025-02-06 06:35:28,658 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 290 transitions. Word has length 71 [2025-02-06 06:35:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:28,659 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 290 transitions. [2025-02-06 06:35:28,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:35:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 290 transitions. [2025-02-06 06:35:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 06:35:28,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:28,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:28,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 06:35:28,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:28,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 601863527, now seen corresponding path program 1 times [2025-02-06 06:35:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 06:35:28,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920570012] [2025-02-06 06:35:28,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:28,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:28,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:35:28,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 06:35:29,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 06:35:29,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 06:35:29,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:29,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:29,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:35:29,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 06:35:29,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:29,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 06:35:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920570012] [2025-02-06 06:35:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920570012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:29,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:29,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 06:35:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478953445] [2025-02-06 06:35:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:29,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:35:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 06:35:29,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:35:29,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:35:29,317 INFO L87 Difference]: Start difference. First operand 222 states and 290 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 06:35:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:29,383 INFO L93 Difference]: Finished difference Result 555 states and 721 transitions. [2025-02-06 06:35:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:35:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-02-06 06:35:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:29,385 INFO L225 Difference]: With dead ends: 555 [2025-02-06 06:35:29,386 INFO L226 Difference]: Without dead ends: 376 [2025-02-06 06:35:29,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-02-06 06:35:29,387 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 159 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:29,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 528 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:35:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-06 06:35:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2025-02-06 06:35:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 295 states have (on average 1.2915254237288136) internal successors, (381), 299 states have internal predecessors, (381), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (54), 50 states have call predecessors, (54), 48 states have call successors, (54) [2025-02-06 06:35:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 484 transitions. [2025-02-06 06:35:29,413 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 484 transitions. Word has length 73 [2025-02-06 06:35:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:29,413 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 484 transitions. [2025-02-06 06:35:29,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 06:35:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 484 transitions. [2025-02-06 06:35:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 06:35:29,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:29,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:29,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 06:35:29,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:29,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:29,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2034907993, now seen corresponding path program 1 times [2025-02-06 06:35:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 06:35:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692157064] [2025-02-06 06:35:29,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:35:29,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:29,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:29,620 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:35:29,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 06:35:29,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 06:35:29,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 06:35:29,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:35:29,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:35:29,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 06:35:29,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:35:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 06:35:30,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:35:30,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 06:35:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692157064] [2025-02-06 06:35:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692157064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:35:30,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:35:30,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:35:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202595842] [2025-02-06 06:35:30,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:35:30,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:35:30,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 06:35:30,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:35:30,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:30,071 INFO L87 Difference]: Start difference. First operand 372 states and 484 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:35:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:35:30,236 INFO L93 Difference]: Finished difference Result 707 states and 920 transitions. [2025-02-06 06:35:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:35:30,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-02-06 06:35:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:35:30,240 INFO L225 Difference]: With dead ends: 707 [2025-02-06 06:35:30,240 INFO L226 Difference]: Without dead ends: 378 [2025-02-06 06:35:30,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:35:30,241 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:35:30,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:35:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-06 06:35:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-02-06 06:35:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 301 states have (on average 1.2857142857142858) internal successors, (387), 303 states have internal predecessors, (387), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (54), 52 states have call predecessors, (54), 48 states have call successors, (54) [2025-02-06 06:35:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 490 transitions. [2025-02-06 06:35:30,265 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 490 transitions. Word has length 77 [2025-02-06 06:35:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:35:30,265 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 490 transitions. [2025-02-06 06:35:30,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 06:35:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 490 transitions. [2025-02-06 06:35:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 06:35:30,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:35:30,266 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:35:30,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 06:35:30,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:30,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:35:30,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:35:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash -672147508, now seen corresponding path program 2 times [2025-02-06 06:35:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 06:35:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670503458] [2025-02-06 06:35:30,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:35:30,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:35:30,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:35:30,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:35:30,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 06:35:30,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes.