./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-?-c7c6ca5-m [2024-11-09 04:29:04,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:29:04,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-09 04:29:04,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:29:04,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:29:04,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:29:04,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:29:04,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:29:04,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 04:29:04,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 04:29:04,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:29:04,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:29:04,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:29:04,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:29:04,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 04:29:04,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:29:04,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:29:04,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:29:04,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:29:04,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:29:04,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:29:04,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:29:04,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:29:04,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:29:04,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:29:04,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:29:04,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:29:04,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:29:04,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:29:04,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:29:04,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:29:04,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:29:04,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:29:04,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 04:29:04,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:29:04,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:29:04,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 04:29:04,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 04:29:04,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:29:04,969 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 [2024-11-09 04:29:05,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:29:05,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:29:05,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:29:05,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:29:05,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:29:05,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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 [2024-11-09 04:29:06,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:29:07,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:29:07,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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 [2024-11-09 04:29:07,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1cbc709/0a5b67d6f0af4370998127a2add96c71/FLAG5e7a4d0e0 [2024-11-09 04:29:07,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1cbc709/0a5b67d6f0af4370998127a2add96c71 [2024-11-09 04:29:07,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:29:07,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:29:07,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:07,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:29:07,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:29:07,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:07" (1/1) ... [2024-11-09 04:29:07,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c204429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:07, skipping insertion in model container [2024-11-09 04:29:07,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:07" (1/1) ... [2024-11-09 04:29:07,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:29:08,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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] [2024-11-09 04:29:08,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:08,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:29:08,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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] [2024-11-09 04:29:08,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:08,399 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:29:08,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08 WrapperNode [2024-11-09 04:29:08,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:08,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:08,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:29:08,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:29:08,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,494 INFO L138 Inliner]: procedures = 90, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 598 [2024-11-09 04:29:08,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:08,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:29:08,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:29:08,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:29:08,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,579 INFO L175 MemorySlicer]: Split 42 memory accesses to 3 slices as follows [2, 15, 25]. 60 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4, 0]. The 29 writes are split as follows [0, 4, 25]. [2024-11-09 04:29:08,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:29:08,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:29:08,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:29:08,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:29:08,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (1/1) ... [2024-11-09 04:29:08,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:29:08,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:29:08,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 04:29:08,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 04:29:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:29:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2024-11-09 04:29:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2024-11-09 04:29:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2024-11-09 04:29:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2024-11-09 04:29:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 04:29:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 04:29:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-09 04:29:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 04:29:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 04:29:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 04:29:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2024-11-09 04:29:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2024-11-09 04:29:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-09 04:29:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-09 04:29:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-09 04:29:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-09 04:29:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-09 04:29:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 04:29:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 04:29:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 04:29:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 04:29:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 04:29:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 04:29:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 04:29:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 04:29:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 04:29:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 04:29:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2024-11-09 04:29:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2024-11-09 04:29:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-11-09 04:29:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-11-09 04:29:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:29:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-11-09 04:29:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-11-09 04:29:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 04:29:08,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 04:29:08,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 04:29:08,745 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-09 04:29:08,745 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-09 04:29:08,745 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2024-11-09 04:29:08,746 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2024-11-09 04:29:08,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 04:29:08,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 04:29:08,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 04:29:08,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-09 04:29:08,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-09 04:29:08,748 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2024-11-09 04:29:08,748 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2024-11-09 04:29:08,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:29:08,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:29:08,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 04:29:08,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 04:29:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 04:29:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:29:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2024-11-09 04:29:08,749 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2024-11-09 04:29:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:29:08,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:29:09,047 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:29:09,049 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:29:09,409 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-09 04:29:11,553 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2024-11-09 04:29:11,553 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:29:11,585 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:29:11,586 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:29:11,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:11 BoogieIcfgContainer [2024-11-09 04:29:11,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:29:11,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:29:11,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:29:11,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:29:11,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:29:07" (1/3) ... [2024-11-09 04:29:11,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc83adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:11, skipping insertion in model container [2024-11-09 04:29:11,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:08" (2/3) ... [2024-11-09 04:29:11,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc83adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:11, skipping insertion in model container [2024-11-09 04:29:11,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:11" (3/3) ... [2024-11-09 04:29:11,629 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2024-11-09 04:29:11,647 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:29:11,648 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:29:11,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:29:11,723 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;@235655c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:29:11,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:29:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 155 states have (on average 1.367741935483871) internal successors, (212), 165 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) [2024-11-09 04:29:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 04:29:11,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:11,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:11,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:11,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -954832609, now seen corresponding path program 1 times [2024-11-09 04:29:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524962576] [2024-11-09 04:29:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524962576] [2024-11-09 04:29:12,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524962576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:12,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:12,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:29:12,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144859627] [2024-11-09 04:29:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:12,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:12,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:12,349 INFO L87 Difference]: Start difference. First operand has 204 states, 155 states have (on average 1.367741935483871) internal successors, (212), 165 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) [2024-11-09 04:29:15,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:15,247 INFO L93 Difference]: Finished difference Result 579 states and 806 transitions. [2024-11-09 04:29:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:15,255 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 [2024-11-09 04:29:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:15,267 INFO L225 Difference]: With dead ends: 579 [2024-11-09 04:29:15,267 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 04:29:15,273 INFO L431 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 [2024-11-09 04:29:15,278 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 243 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:15,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 507 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 04:29:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 04:29:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2024-11-09 04:29:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 281 states have (on average 1.3202846975088969) internal successors, (371), 286 states have internal predecessors, (371), 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) [2024-11-09 04:29:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 473 transitions. [2024-11-09 04:29:15,389 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 473 transitions. Word has length 16 [2024-11-09 04:29:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:15,392 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 473 transitions. [2024-11-09 04:29:15,393 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) [2024-11-09 04:29:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 473 transitions. [2024-11-09 04:29:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:29:15,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:15,396 INFO L215 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] [2024-11-09 04:29:15,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:29:15,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:15,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash -15070204, now seen corresponding path program 1 times [2024-11-09 04:29:15,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545877679] [2024-11-09 04:29:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 04:29:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:29:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545877679] [2024-11-09 04:29:15,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545877679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:15,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:15,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:29:15,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913679837] [2024-11-09 04:29:15,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:15,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:29:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:15,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:29:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:29:15,674 INFO L87 Difference]: Start difference. First operand 359 states and 473 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:29:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:15,992 INFO L93 Difference]: Finished difference Result 377 states and 491 transitions. [2024-11-09 04:29:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:29:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 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 [2024-11-09 04:29:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:16,000 INFO L225 Difference]: With dead ends: 377 [2024-11-09 04:29:16,000 INFO L226 Difference]: Without dead ends: 372 [2024-11-09 04:29:16,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:29:16,002 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 298 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:16,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 286 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:29:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-09 04:29:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 359. [2024-11-09 04:29:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 281 states have (on average 1.3167259786476868) internal successors, (370), 286 states have internal predecessors, (370), 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) [2024-11-09 04:29:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 472 transitions. [2024-11-09 04:29:16,046 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 472 transitions. Word has length 32 [2024-11-09 04:29:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:16,047 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 472 transitions. [2024-11-09 04:29:16,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:29:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 472 transitions. [2024-11-09 04:29:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:29:16,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:16,051 INFO L215 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] [2024-11-09 04:29:16,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:29:16,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:16,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash 42188098, now seen corresponding path program 1 times [2024-11-09 04:29:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:16,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366383235] [2024-11-09 04:29:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 04:29:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:29:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366383235] [2024-11-09 04:29:16,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366383235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:16,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:16,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:29:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794174412] [2024-11-09 04:29:16,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:16,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:29:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:16,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:29:16,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:29:16,267 INFO L87 Difference]: Start difference. First operand 359 states and 472 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:29:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:16,550 INFO L93 Difference]: Finished difference Result 720 states and 962 transitions. [2024-11-09 04:29:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:29:16,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 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 [2024-11-09 04:29:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:16,558 INFO L225 Difference]: With dead ends: 720 [2024-11-09 04:29:16,561 INFO L226 Difference]: Without dead ends: 359 [2024-11-09 04:29:16,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:29:16,568 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 276 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:16,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 277 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:29:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-09 04:29:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2024-11-09 04:29:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 273 states have (on average 1.3113553113553114) internal successors, (358), 277 states have internal predecessors, (358), 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) [2024-11-09 04:29:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 459 transitions. [2024-11-09 04:29:16,606 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 459 transitions. Word has length 32 [2024-11-09 04:29:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:16,606 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 459 transitions. [2024-11-09 04:29:16,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:29:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 459 transitions. [2024-11-09 04:29:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 04:29:16,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:16,609 INFO L215 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] [2024-11-09 04:29:16,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:29:16,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash -789286265, now seen corresponding path program 1 times [2024-11-09 04:29:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863914980] [2024-11-09 04:29:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 04:29:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 04:29:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:29:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 04:29:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 04:29:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:29:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863914980] [2024-11-09 04:29:16,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863914980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:16,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:16,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:29:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604457835] [2024-11-09 04:29:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:16,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:29:16,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:16,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:29:16,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:29:16,821 INFO L87 Difference]: Start difference. First operand 350 states and 459 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:29:20,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:24,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:25,415 INFO L93 Difference]: Finished difference Result 968 states and 1312 transitions. [2024-11-09 04:29:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:29:25,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 4 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 48 [2024-11-09 04:29:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:25,421 INFO L225 Difference]: With dead ends: 968 [2024-11-09 04:29:25,422 INFO L226 Difference]: Without dead ends: 621 [2024-11-09 04:29:25,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:29:25,426 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 340 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 115 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:25,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 586 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 273 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-11-09 04:29:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-09 04:29:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 431. [2024-11-09 04:29:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 344 states have (on average 1.3284883720930232) internal successors, (457), 348 states have internal predecessors, (457), 59 states have call successors, (59), 28 states have call predecessors, (59), 27 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 04:29:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 574 transitions. [2024-11-09 04:29:25,512 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 574 transitions. Word has length 48 [2024-11-09 04:29:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 574 transitions. [2024-11-09 04:29:25,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:29:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 574 transitions. [2024-11-09 04:29:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 04:29:25,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:25,516 INFO L215 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, 1] [2024-11-09 04:29:25,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:29:25,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:25,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1152309619, now seen corresponding path program 1 times [2024-11-09 04:29:25,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:25,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663045805] [2024-11-09 04:29:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 04:29:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:25,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:29:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:29:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:25,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 04:29:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 04:29:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 04:29:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 04:29:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:29:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:25,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663045805] [2024-11-09 04:29:25,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663045805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:25,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:25,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:29:25,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596162263] [2024-11-09 04:29:25,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:25,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:29:25,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:25,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:29:25,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:29:25,837 INFO L87 Difference]: Start difference. First operand 431 states and 574 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 04:29:28,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:31,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:35,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:35,877 INFO L93 Difference]: Finished difference Result 1260 states and 1695 transitions. [2024-11-09 04:29:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 04:29:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2024-11-09 04:29:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:35,884 INFO L225 Difference]: With dead ends: 1260 [2024-11-09 04:29:35,884 INFO L226 Difference]: Without dead ends: 832 [2024-11-09 04:29:35,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-09 04:29:35,887 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 636 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 245 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:35,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 688 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 408 Invalid, 1 Unknown, 0 Unchecked, 9.8s Time] [2024-11-09 04:29:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-11-09 04:29:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 610. [2024-11-09 04:29:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 485 states have (on average 1.3237113402061855) internal successors, (642), 489 states have internal predecessors, (642), 81 states have call successors, (81), 44 states have call predecessors, (81), 43 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 04:29:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 803 transitions. [2024-11-09 04:29:35,951 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 803 transitions. Word has length 74 [2024-11-09 04:29:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:35,953 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 803 transitions. [2024-11-09 04:29:35,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 04:29:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 803 transitions. [2024-11-09 04:29:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 04:29:35,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:35,958 INFO L215 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] [2024-11-09 04:29:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:29:35,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash -626210754, now seen corresponding path program 1 times [2024-11-09 04:29:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554301137] [2024-11-09 04:29:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 04:29:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:29:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 04:29:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 04:29:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 04:29:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 04:29:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 04:29:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:29:36,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:36,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554301137] [2024-11-09 04:29:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554301137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:29:36,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101189119] [2024-11-09 04:29:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:29:36,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:29:36,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:29:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:36,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:29:36,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 04:29:36,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:29:36,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101189119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:36,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:29:36,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2024-11-09 04:29:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522674677] [2024-11-09 04:29:36,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:36,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:36,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:29:36,952 INFO L87 Difference]: Start difference. First operand 610 states and 803 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) [2024-11-09 04:29:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:37,029 INFO L93 Difference]: Finished difference Result 1554 states and 2043 transitions. [2024-11-09 04:29:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:37,029 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 [2024-11-09 04:29:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:37,034 INFO L225 Difference]: With dead ends: 1554 [2024-11-09 04:29:37,035 INFO L226 Difference]: Without dead ends: 947 [2024-11-09 04:29:37,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:29:37,037 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 171 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:37,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 497 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:29:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-09 04:29:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 943. [2024-11-09 04:29:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 758 states have (on average 1.3205804749340369) internal successors, (1001), 766 states have internal predecessors, (1001), 119 states have call successors, (119), 66 states have call predecessors, (119), 65 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-09 04:29:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1238 transitions. [2024-11-09 04:29:37,129 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1238 transitions. Word has length 73 [2024-11-09 04:29:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:37,132 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1238 transitions. [2024-11-09 04:29:37,132 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) [2024-11-09 04:29:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1238 transitions. [2024-11-09 04:29:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 04:29:37,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:37,136 INFO L215 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] [2024-11-09 04:29:37,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:29:37,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 04:29:37,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:37,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:37,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1068678208, now seen corresponding path program 1 times [2024-11-09 04:29:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:37,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274654188] [2024-11-09 04:29:37,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:37,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 04:29:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:37,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:29:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:37,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 04:29:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:37,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 04:29:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:37,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 04:29:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 04:29:37,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274654188] [2024-11-09 04:29:37,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274654188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:29:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702947861] [2024-11-09 04:29:37,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:29:37,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:29:37,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:29:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:38,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 04:29:38,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 04:29:38,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:29:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702947861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:38,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:29:38,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-09 04:29:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330564113] [2024-11-09 04:29:38,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:38,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:38,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:29:38,235 INFO L87 Difference]: Start difference. First operand 943 states and 1238 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) [2024-11-09 04:29:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:38,301 INFO L93 Difference]: Finished difference Result 1843 states and 2421 transitions. [2024-11-09 04:29:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:38,302 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 [2024-11-09 04:29:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:38,309 INFO L225 Difference]: With dead ends: 1843 [2024-11-09 04:29:38,309 INFO L226 Difference]: Without dead ends: 943 [2024-11-09 04:29:38,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:29:38,313 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:38,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 473 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:29:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-09 04:29:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2024-11-09 04:29:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 758 states have (on average 1.3153034300791557) internal successors, (997), 766 states have internal predecessors, (997), 119 states have call successors, (119), 66 states have call predecessors, (119), 65 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-09 04:29:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1234 transitions. [2024-11-09 04:29:38,375 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1234 transitions. Word has length 75 [2024-11-09 04:29:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:38,375 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1234 transitions. [2024-11-09 04:29:38,375 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) [2024-11-09 04:29:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1234 transitions. [2024-11-09 04:29:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 04:29:38,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:38,378 INFO L215 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] [2024-11-09 04:29:38,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:29:38,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 04:29:38,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:38,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1148613853, now seen corresponding path program 1 times [2024-11-09 04:29:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:38,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811193824] [2024-11-09 04:29:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:38,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 04:29:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:29:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 04:29:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:39,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 04:29:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 04:29:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 04:29:39,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:39,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811193824] [2024-11-09 04:29:39,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811193824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:29:39,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396050437] [2024-11-09 04:29:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:39,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:39,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:29:39,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:29:39,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:29:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:39,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 04:29:39,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:29:39,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:29:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396050437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:29:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2024-11-09 04:29:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822932447] [2024-11-09 04:29:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:39,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:29:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:39,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:29:39,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:29:39,537 INFO L87 Difference]: Start difference. First operand 943 states and 1234 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2024-11-09 04:29:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:39,644 INFO L93 Difference]: Finished difference Result 1863 states and 2445 transitions. [2024-11-09 04:29:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:29:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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 [2024-11-09 04:29:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:39,651 INFO L225 Difference]: With dead ends: 1863 [2024-11-09 04:29:39,651 INFO L226 Difference]: Without dead ends: 963 [2024-11-09 04:29:39,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:29:39,656 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:39,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1187 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:29:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-09 04:29:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-09 04:29:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 774 states have (on average 1.3087855297157622) internal successors, (1013), 782 states have internal predecessors, (1013), 119 states have call successors, (119), 66 states have call predecessors, (119), 69 states have return successors, (130), 122 states have call predecessors, (130), 118 states have call successors, (130) [2024-11-09 04:29:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1262 transitions. [2024-11-09 04:29:39,730 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1262 transitions. Word has length 77 [2024-11-09 04:29:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:39,731 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1262 transitions. [2024-11-09 04:29:39,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2024-11-09 04:29:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1262 transitions. [2024-11-09 04:29:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 04:29:39,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:39,756 INFO L215 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] [2024-11-09 04:29:39,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:29:39,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:39,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:39,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash -473381523, now seen corresponding path program 1 times [2024-11-09 04:29:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:39,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999196245] [2024-11-09 04:29:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 04:29:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:29:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 04:29:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 04:29:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:29:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 04:29:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 04:29:40,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:29:40,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999196245] [2024-11-09 04:29:40,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999196245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:29:40,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959925634] [2024-11-09 04:29:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:40,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:40,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:29:40,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:29:40,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:29:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:40,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 04:29:40,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 04:29:40,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:29:40,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959925634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:40,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:29:40,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2024-11-09 04:29:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153526707] [2024-11-09 04:29:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:40,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:29:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:29:40,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:29:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:29:40,887 INFO L87 Difference]: Start difference. First operand 963 states and 1262 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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) [2024-11-09 04:29:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:40,960 INFO L93 Difference]: Finished difference Result 1895 states and 2485 transitions. [2024-11-09 04:29:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:29:40,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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 [2024-11-09 04:29:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:40,967 INFO L225 Difference]: With dead ends: 1895 [2024-11-09 04:29:40,967 INFO L226 Difference]: Without dead ends: 975 [2024-11-09 04:29:40,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:29:40,972 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:40,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1178 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:29:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-09 04:29:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2024-11-09 04:29:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 786 states have (on average 1.3040712468193385) internal successors, (1025), 790 states have internal predecessors, (1025), 119 states have call successors, (119), 66 states have call predecessors, (119), 69 states have return successors, (130), 126 states have call predecessors, (130), 118 states have call successors, (130) [2024-11-09 04:29:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1274 transitions. [2024-11-09 04:29:41,053 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1274 transitions. Word has length 83 [2024-11-09 04:29:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:41,053 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1274 transitions. [2024-11-09 04:29:41,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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) [2024-11-09 04:29:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1274 transitions. [2024-11-09 04:29:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 04:29:41,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:41,057 INFO L215 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] [2024-11-09 04:29:41,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:29:41,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:41,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:41,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2103604547, now seen corresponding path program 2 times [2024-11-09 04:29:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:29:41,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199969998] [2024-11-09 04:29:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:41,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:29:41,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:29:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:29:41,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 04:29:41,627 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:29:41,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:29:41,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:29:41,633 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:41,771 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:29:41,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:29:41 BoogieIcfgContainer [2024-11-09 04:29:41,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:29:41,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:29:41,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:29:41,776 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:29:41,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:11" (3/4) ... [2024-11-09 04:29:41,779 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 04:29:41,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:29:41,780 INFO L158 Benchmark]: Toolchain (without parser) took 34396.71ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 124.2MB in the beginning and 108.8MB in the end (delta: 15.4MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2024-11-09 04:29:41,781 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:29:41,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1016.04ms. Allocated memory is still 201.3MB. Free memory was 124.1MB in the beginning and 121.6MB in the end (delta: 2.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 04:29:41,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.93ms. Allocated memory is still 201.3MB. Free memory was 121.6MB in the beginning and 117.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 04:29:41,782 INFO L158 Benchmark]: Boogie Preprocessor took 138.35ms. Allocated memory is still 201.3MB. Free memory was 117.5MB in the beginning and 108.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 04:29:41,782 INFO L158 Benchmark]: RCFGBuilder took 2951.30ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 108.0MB in the beginning and 216.1MB in the end (delta: -108.1MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-11-09 04:29:41,783 INFO L158 Benchmark]: TraceAbstraction took 30160.66ms. Allocated memory is still 268.4MB. Free memory was 215.1MB in the beginning and 109.9MB in the end (delta: 105.2MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. [2024-11-09 04:29:41,783 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 268.4MB. Free memory was 109.9MB in the beginning and 108.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:29:41,784 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.22ms. Allocated memory is still 201.3MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1016.04ms. Allocated memory is still 201.3MB. Free memory was 124.1MB in the beginning and 121.6MB in the end (delta: 2.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.93ms. Allocated memory is still 201.3MB. Free memory was 121.6MB in the beginning and 117.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.35ms. Allocated memory is still 201.3MB. Free memory was 117.5MB in the beginning and 108.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2951.30ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 108.0MB in the beginning and 216.1MB in the end (delta: -108.1MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30160.66ms. Allocated memory is still 268.4MB. Free memory was 215.1MB in the beginning and 109.9MB in the end (delta: 105.2MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 268.4MB. Free memory was 109.9MB in the beginning and 108.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 large string literal at line 2900, 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={4294967318:4294967323}, 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={4294967318:4294967323}, 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={4294967318:4294967323}, 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={4294967318:4294967323}, 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={4294967318:4294967323}, 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={4294967318:4294967323}, 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={-(((__int128) 2 << 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={4294967318:4294967323}, 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={4294967318:4294967323}, 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={4294967318:4294967323}, 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={-(((__int128) 2 << 64) | 1):0}, probed_2=0, ref_cnt=0, size=1472] [L2732] return (p); VAL [LDV_IN_INTERRUPT=1, \result={-(((__int128) 2 << 64) | 1):0}, __this_module={4294967318:4294967323}, 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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)=56, \result={-(((__int128) 0 << 64) | 18446744073709551615U):0}, __this_module={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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)={-(((__int128) 2 << 64) | 1):0}, __this_module={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq_res={-(((__int128) 0 << 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={-(((__int128) 2 << 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)={-(((__int128) 2 << 64) | 1):0}, __this_module={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq_res={-(((__int128) 0 << 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={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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) | 1):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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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) | 1):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) 1 << 64) | 1):0}, __this_module={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, flags=208, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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)={-(((__int128) 2 << 64) | 1):0}, __this_module={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq=-2, 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={-(((__int128) 2 << 64) | 1):0}, probed_2=0, ref_cnt=0, trig={-(((__int128) 1 << 64) | 1):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)={-(((__int128) 2 << 64) | 1):0}, __this_module={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq=-2, 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={-(((__int128) 2 << 64) | 1):0}, probed_2=0, ref_cnt=0, ret=-12, trig={-(((__int128) 1 << 64) | 1):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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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={4294967318:4294967323}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 2 << 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: 29.9s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 2018 SdHoareTripleChecker+Valid, 21.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1966 mSDsluCounter, 5679 SdHoareTripleChecker+Invalid, 21.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3679 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 960 IncrementalHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 2000 mSDtfsCounter, 960 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=975occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 441 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 1329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3106 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 105/119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 04:29:41,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-?-c7c6ca5-m [2024-11-09 04:29:44,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:29:44,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-09 04:29:44,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:29:44,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:29:44,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:29:44,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:29:44,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:29:44,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 04:29:44,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 04:29:44,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:29:44,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:29:44,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:29:44,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:29:44,148 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 04:29:44,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:29:44,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:29:44,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:29:44,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:29:44,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:29:44,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:29:44,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:29:44,156 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:29:44,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:29:44,157 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:29:44,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:29:44,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:29:44,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:29:44,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:29:44,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:29:44,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:29:44,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:29:44,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:29:44,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:29:44,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:29:44,162 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 04:29:44,163 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:29:44,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:29:44,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 04:29:44,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 04:29:44,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:29:44,164 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 [2024-11-09 04:29:44,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:29:44,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:29:44,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:29:44,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:29:44,529 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:29:44,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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 [2024-11-09 04:29:46,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:29:46,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:29:46,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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 [2024-11-09 04:29:46,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9750d71d3/55b7a39b619c40668e7034a944719f2c/FLAG31c6859e7 [2024-11-09 04:29:46,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9750d71d3/55b7a39b619c40668e7034a944719f2c [2024-11-09 04:29:46,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:29:46,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:29:46,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:46,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:29:46,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:29:46,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:46" (1/1) ... [2024-11-09 04:29:46,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280e6ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:46, skipping insertion in model container [2024-11-09 04:29:46,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:46" (1/1) ... [2024-11-09 04:29:46,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:29:47,159 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,200 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,211 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,215 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,216 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,217 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,218 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,218 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,225 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,225 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,260 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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] [2024-11-09 04:29:47,315 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:29:47,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:47,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:29:47,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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] [2024-11-09 04:29:47,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:47,559 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:29:47,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47 WrapperNode [2024-11-09 04:29:47,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:47,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:47,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:29:47,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:29:47,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,658 INFO L138 Inliner]: procedures = 95, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 557 [2024-11-09 04:29:47,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:47,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:29:47,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:29:47,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:29:47,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,765 INFO L175 MemorySlicer]: Split 42 memory accesses to 3 slices as follows [2, 15, 25]. 60 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4, 0]. The 29 writes are split as follows [0, 4, 25]. [2024-11-09 04:29:47,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:29:47,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:29:47,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:29:47,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:29:47,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (1/1) ... [2024-11-09 04:29:47,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:29:47,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:29:47,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 04:29:47,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 04:29:47,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:29:47,964 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2024-11-09 04:29:47,964 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2024-11-09 04:29:47,964 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2024-11-09 04:29:47,965 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2024-11-09 04:29:47,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 04:29:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 04:29:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 04:29:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2024-11-09 04:29:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2024-11-09 04:29:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2024-11-09 04:29:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2024-11-09 04:29:47,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2024-11-09 04:29:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 04:29:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 04:29:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 04:29:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-09 04:29:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-09 04:29:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-09 04:29:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-09 04:29:47,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-09 04:29:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 04:29:47,971 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 04:29:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 04:29:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 04:29:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 04:29:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 04:29:47,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 04:29:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2024-11-09 04:29:47,972 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2024-11-09 04:29:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-11-09 04:29:47,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-11-09 04:29:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:29:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 04:29:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 04:29:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 04:29:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-11-09 04:29:47,973 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-11-09 04:29:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 04:29:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 04:29:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 04:29:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-09 04:29:47,973 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-09 04:29:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2024-11-09 04:29:47,973 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2024-11-09 04:29:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 04:29:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 04:29:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 04:29:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-09 04:29:47,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-09 04:29:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2024-11-09 04:29:47,974 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2024-11-09 04:29:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 04:29:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 04:29:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#2 [2024-11-09 04:29:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 04:29:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 04:29:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#2 [2024-11-09 04:29:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:29:47,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:29:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:29:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2024-11-09 04:29:47,975 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2024-11-09 04:29:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:29:47,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:29:48,272 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:29:48,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:29:48,630 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-09 04:29:53,098 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2024-11-09 04:29:53,099 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:29:53,114 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:29:53,114 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:29:53,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:53 BoogieIcfgContainer [2024-11-09 04:29:53,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:29:53,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:29:53,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:29:53,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:29:53,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:29:46" (1/3) ... [2024-11-09 04:29:53,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8fcc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:53, skipping insertion in model container [2024-11-09 04:29:53,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:47" (2/3) ... [2024-11-09 04:29:53,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8fcc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:53, skipping insertion in model container [2024-11-09 04:29:53,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:53" (3/3) ... [2024-11-09 04:29:53,122 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2024-11-09 04:29:53,139 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:29:53,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:29:53,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:29:53,211 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;@4af4d053, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:29:53,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:29:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 196 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 157 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) [2024-11-09 04:29:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 04:29:53,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:53,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:53,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:53,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1261264738, now seen corresponding path program 1 times [2024-11-09 04:29:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 04:29:53,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996432148] [2024-11-09 04:29:53,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:29:53,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 04:29:53,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:29:53,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 04:29:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:53,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:29:53,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:53,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:29:53,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 04:29:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996432148] [2024-11-09 04:29:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996432148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:29:53,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115035683] [2024-11-09 04:29:53,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:53,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 04:29:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:53,775 INFO L87 Difference]: Start difference. First operand has 196 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 157 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), 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) [2024-11-09 04:29:57,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:29:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:57,982 INFO L93 Difference]: Finished difference Result 555 states and 770 transitions. [2024-11-09 04:29:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:57,989 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 [2024-11-09 04:29:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:58,002 INFO L225 Difference]: With dead ends: 555 [2024-11-09 04:29:58,002 INFO L226 Difference]: Without dead ends: 346 [2024-11-09 04:29:58,007 INFO L431 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 [2024-11-09 04:29:58,010 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 233 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:58,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 486 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 04:29:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-09 04:29:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2024-11-09 04:29:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 265 states have (on average 1.3245283018867924) internal successors, (351), 270 states have internal predecessors, (351), 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) [2024-11-09 04:29:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 453 transitions. [2024-11-09 04:29:58,163 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 453 transitions. Word has length 16 [2024-11-09 04:29:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:58,163 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 453 transitions. [2024-11-09 04:29:58,163 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) [2024-11-09 04:29:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 453 transitions. [2024-11-09 04:29:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:29:58,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:58,171 INFO L215 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] [2024-11-09 04:29:58,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 04:29:58,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:29:58,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:58,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 153897654, now seen corresponding path program 1 times [2024-11-09 04:29:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 04:29:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967347901] [2024-11-09 04:29:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:58,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:29:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 04:29:58,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:29:58,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 04:29:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:58,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:29:58,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:58,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:29:58,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 04:29:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967347901] [2024-11-09 04:29:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967347901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:58,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:29:58,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78352965] [2024-11-09 04:29:58,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:58,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 04:29:58,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:58,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:58,770 INFO L87 Difference]: Start difference. First operand 343 states and 453 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) [2024-11-09 04:29:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:58,847 INFO L93 Difference]: Finished difference Result 353 states and 461 transitions. [2024-11-09 04:29:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:58,848 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 [2024-11-09 04:29:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:58,851 INFO L225 Difference]: With dead ends: 353 [2024-11-09 04:29:58,853 INFO L226 Difference]: Without dead ends: 348 [2024-11-09 04:29:58,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:58,855 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 236 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:58,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 247 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:29:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-09 04:29:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 343. [2024-11-09 04:29:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 265 states have (on average 1.320754716981132) internal successors, (350), 270 states have internal predecessors, (350), 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) [2024-11-09 04:29:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 452 transitions. [2024-11-09 04:29:58,958 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 452 transitions. Word has length 32 [2024-11-09 04:29:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:58,959 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 452 transitions. [2024-11-09 04:29:58,959 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) [2024-11-09 04:29:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 452 transitions. [2024-11-09 04:29:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:29:58,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:58,963 INFO L215 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] [2024-11-09 04:29:58,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 04:29:59,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:29:59,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:59,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash 211155956, now seen corresponding path program 1 times [2024-11-09 04:29:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 04:29:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767029000] [2024-11-09 04:29:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:59,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:29:59,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 04:29:59,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:29:59,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 04:29:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:59,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:29:59,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:59,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:29:59,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 04:29:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767029000] [2024-11-09 04:29:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767029000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:29:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117418265] [2024-11-09 04:29:59,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 04:29:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:59,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:59,765 INFO L87 Difference]: Start difference. First operand 343 states and 452 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 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) [2024-11-09 04:29:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:59,807 INFO L93 Difference]: Finished difference Result 680 states and 910 transitions. [2024-11-09 04:29:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:59,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 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 [2024-11-09 04:29:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:59,812 INFO L225 Difference]: With dead ends: 680 [2024-11-09 04:29:59,815 INFO L226 Difference]: Without dead ends: 335 [2024-11-09 04:29:59,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:59,820 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 208 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:59,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 236 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:29:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-09 04:29:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 334. [2024-11-09 04:29:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 257 states have (on average 1.3151750972762646) internal successors, (338), 261 states have internal predecessors, (338), 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) [2024-11-09 04:29:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 439 transitions. [2024-11-09 04:29:59,861 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 439 transitions. Word has length 32 [2024-11-09 04:29:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:59,861 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 439 transitions. [2024-11-09 04:29:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 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) [2024-11-09 04:29:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 439 transitions. [2024-11-09 04:29:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 04:29:59,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:59,865 INFO L215 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] [2024-11-09 04:29:59,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 04:30:00,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:00,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1058202050, now seen corresponding path program 1 times [2024-11-09 04:30:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 04:30:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773928166] [2024-11-09 04:30:00,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:00,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 04:30:00,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:30:00,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 04:30:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:00,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:30:00,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:30:00,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:00,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 04:30:00,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773928166] [2024-11-09 04:30:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773928166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:00,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:30:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938577372] [2024-11-09 04:30:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:00,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:30:00,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 04:30:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:30:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:00,500 INFO L87 Difference]: Start difference. First operand 334 states and 439 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) [2024-11-09 04:30:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:00,622 INFO L93 Difference]: Finished difference Result 748 states and 994 transitions. [2024-11-09 04:30:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:00,623 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 [2024-11-09 04:30:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:00,626 INFO L225 Difference]: With dead ends: 748 [2024-11-09 04:30:00,627 INFO L226 Difference]: Without dead ends: 417 [2024-11-09 04:30:00,628 INFO L431 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 [2024-11-09 04:30:00,630 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 56 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:00,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 448 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:30:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-09 04:30:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2024-11-09 04:30:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 328 states have (on average 1.3323170731707317) internal successors, (437), 332 states have internal predecessors, (437), 59 states have call successors, (59), 28 states have call predecessors, (59), 27 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 04:30:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 554 transitions. [2024-11-09 04:30:00,665 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 554 transitions. Word has length 46 [2024-11-09 04:30:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:00,666 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 554 transitions. [2024-11-09 04:30:00,666 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) [2024-11-09 04:30:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 554 transitions. [2024-11-09 04:30:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 04:30:00,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:00,671 INFO L215 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] [2024-11-09 04:30:00,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 04:30:00,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:00,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:00,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash -961530910, now seen corresponding path program 1 times [2024-11-09 04:30:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 04:30:00,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947041629] [2024-11-09 04:30:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:00,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:00,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 04:30:00,877 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:30:00,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 04:30:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:01,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 04:30:01,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 04:30:01,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:01,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 04:30:01,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947041629] [2024-11-09 04:30:01,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947041629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:01,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:01,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:30:01,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945299887] [2024-11-09 04:30:01,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:01,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:30:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 04:30:01,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:30:01,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:01,612 INFO L87 Difference]: Start difference. First operand 415 states and 554 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) [2024-11-09 04:30:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:01,784 INFO L93 Difference]: Finished difference Result 837 states and 1123 transitions. [2024-11-09 04:30:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:30:01,785 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 [2024-11-09 04:30:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:01,790 INFO L225 Difference]: With dead ends: 837 [2024-11-09 04:30:01,790 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 04:30:01,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:01,792 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1134 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 [2024-11-09 04:30:01,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1134 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:30:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 04:30:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-09 04:30:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 336 states have (on average 1.3244047619047619) internal successors, (445), 340 states have internal predecessors, (445), 59 states have call successors, (59), 28 states have call predecessors, (59), 29 states have return successors, (64), 60 states have call predecessors, (64), 58 states have call successors, (64) [2024-11-09 04:30:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 568 transitions. [2024-11-09 04:30:01,822 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 568 transitions. Word has length 71 [2024-11-09 04:30:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:01,822 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 568 transitions. [2024-11-09 04:30:01,822 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) [2024-11-09 04:30:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 568 transitions. [2024-11-09 04:30:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 04:30:01,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:01,824 INFO L215 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, 1] [2024-11-09 04:30:01,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:02,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:02,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:02,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1474244522, now seen corresponding path program 1 times [2024-11-09 04:30:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 04:30:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583121868] [2024-11-09 04:30:02,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:02,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:02,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 04:30:02,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:30:02,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 04:30:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:02,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:30:02,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 04:30:02,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:02,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 04:30:02,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583121868] [2024-11-09 04:30:02,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583121868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:02,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:02,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:30:02,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313923202] [2024-11-09 04:30:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:02,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:30:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 04:30:02,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:30:02,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:02,841 INFO L87 Difference]: Start difference. First operand 425 states and 568 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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) [2024-11-09 04:30:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:02,926 INFO L93 Difference]: Finished difference Result 1219 states and 1632 transitions. [2024-11-09 04:30:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:30:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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 74 [2024-11-09 04:30:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:02,933 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 04:30:02,933 INFO L226 Difference]: Without dead ends: 797 [2024-11-09 04:30:02,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:30:02,936 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 161 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 477 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 [2024-11-09 04:30:02,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 477 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:30:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-09 04:30:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 793. [2024-11-09 04:30:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 637 states have (on average 1.3296703296703296) internal successors, (847), 645 states have internal predecessors, (847), 101 states have call successors, (101), 51 states have call predecessors, (101), 54 states have return successors, (112), 104 states have call predecessors, (112), 100 states have call successors, (112) [2024-11-09 04:30:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1060 transitions. [2024-11-09 04:30:03,006 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1060 transitions. Word has length 74 [2024-11-09 04:30:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:03,008 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1060 transitions. [2024-11-09 04:30:03,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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) [2024-11-09 04:30:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1060 transitions. [2024-11-09 04:30:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 04:30:03,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:03,013 INFO L215 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] [2024-11-09 04:30:03,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:03,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:03,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:03,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1835113710, now seen corresponding path program 1 times [2024-11-09 04:30:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 04:30:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927170291] [2024-11-09 04:30:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:03,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:03,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 04:30:03,223 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:30:03,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 04:30:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:03,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 04:30:03,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 04:30:03,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:03,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 04:30:03,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927170291] [2024-11-09 04:30:03,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927170291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:03,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:03,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:30:03,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035011083] [2024-11-09 04:30:03,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:03,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:30:03,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 04:30:03,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:30:03,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:03,905 INFO L87 Difference]: Start difference. First operand 793 states and 1060 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) [2024-11-09 04:30:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:04,120 INFO L93 Difference]: Finished difference Result 1595 states and 2137 transitions. [2024-11-09 04:30:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:30:04,134 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 [2024-11-09 04:30:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:04,140 INFO L225 Difference]: With dead ends: 1595 [2024-11-09 04:30:04,140 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 04:30:04,142 INFO L431 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 [2024-11-09 04:30:04,143 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1129 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:04,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1129 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:30:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 04:30:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-11-09 04:30:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 649 states have (on average 1.3235747303543914) internal successors, (859), 653 states have internal predecessors, (859), 101 states have call successors, (101), 51 states have call predecessors, (101), 54 states have return successors, (112), 108 states have call predecessors, (112), 100 states have call successors, (112) [2024-11-09 04:30:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1072 transitions. [2024-11-09 04:30:04,193 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1072 transitions. Word has length 77 [2024-11-09 04:30:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:04,195 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1072 transitions. [2024-11-09 04:30:04,195 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) [2024-11-09 04:30:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1072 transitions. [2024-11-09 04:30:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 04:30:04,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:04,198 INFO L215 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] [2024-11-09 04:30:04,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 04:30:04,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:04,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:04,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash 136768066, now seen corresponding path program 2 times [2024-11-09 04:30:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 04:30:04,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008571645] [2024-11-09 04:30:04,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:30:04,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:04,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 04:30:04,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:30:04,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 04:30:05,030 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:30:05,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 04:30:05,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:30:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:30:05,558 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 04:30:05,559 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:30:05,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:30:05,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 04:30:05,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:30:05,766 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:05,922 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:30:05,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:30:05 BoogieIcfgContainer [2024-11-09 04:30:05,926 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:30:05,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:30:05,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:30:05,927 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:30:05,927 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:53" (3/4) ... [2024-11-09 04:30:05,929 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 04:30:05,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:30:05,931 INFO L158 Benchmark]: Toolchain (without parser) took 19392.73ms. Allocated memory was 75.5MB in the beginning and 125.8MB in the end (delta: 50.3MB). Free memory was 43.2MB in the beginning and 23.4MB in the end (delta: 19.8MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-11-09 04:30:05,931 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:30:05,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1021.92ms. Allocated memory is still 75.5MB. Free memory was 43.1MB in the beginning and 36.4MB in the end (delta: 6.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-09 04:30:05,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.44ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 31.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 04:30:05,932 INFO L158 Benchmark]: Boogie Preprocessor took 201.53ms. Allocated memory was 75.5MB in the beginning and 104.9MB in the end (delta: 29.4MB). Free memory was 31.8MB in the beginning and 67.4MB in the end (delta: -35.5MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-09 04:30:05,932 INFO L158 Benchmark]: RCFGBuilder took 5249.22ms. Allocated memory is still 104.9MB. Free memory was 67.4MB in the beginning and 48.3MB in the end (delta: 19.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-09 04:30:05,933 INFO L158 Benchmark]: TraceAbstraction took 12809.38ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 47.7MB in the beginning and 24.5MB in the end (delta: 23.3MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2024-11-09 04:30:05,933 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 125.8MB. Free memory was 24.5MB in the beginning and 23.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:30:05,935 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.18ms. Allocated memory is still 56.6MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1021.92ms. Allocated memory is still 75.5MB. Free memory was 43.1MB in the beginning and 36.4MB in the end (delta: 6.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.44ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 31.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 201.53ms. Allocated memory was 75.5MB in the beginning and 104.9MB in the end (delta: 29.4MB). Free memory was 31.8MB in the beginning and 67.4MB in the end (delta: -35.5MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 5249.22ms. Allocated memory is still 104.9MB. Free memory was 67.4MB in the beginning and 48.3MB in the end (delta: 19.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12809.38ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 47.7MB in the beginning and 24.5MB in the end (delta: 23.3MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 125.8MB. Free memory was 24.5MB in the beginning and 23.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 large string literal at line 2900. 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={0:0}, 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={0:0}, 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={0:0}, 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={0:0}, 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={0:0}, 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={0:0}, 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={14: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={0:0}, 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={0:0}, 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={0:0}, 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={14:0}, probed_2=0, ref_cnt=0, size=1472] [L2732] return (p); VAL [LDV_IN_INTERRUPT=1, \result={14:0}, __this_module={0:0}, 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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={4611686018427387905: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={4611686018427387905: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={4611686018427387905:0}, __this_module={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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 [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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={-9223372036854775807: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={-9223372036854775807: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={-9223372036854775807:0}, __this_module={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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 ; [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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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)={14:0}, __this_module={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14:0}, iio_interrupt_trigger_ops={6:0}, irq=0, 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={14:0}, probed_2=0, ref_cnt=0, trig={-9223372036854775807: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)={14:0}, __this_module={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14:0}, iio_interrupt_trigger_ops={6:0}, irq=0, 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={14:0}, probed_2=0, ref_cnt=0, ret=-12, trig={-9223372036854775807: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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)={-9223372036854775808:0}, __this_module={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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)={-9223372036854775808:0}, __this_module={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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)={-9223372036854775808:0}, __this_module={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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={0:0}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={14: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, 197 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 894 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 894 mSDsluCounter, 4157 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2479 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1678 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=805occurred in iteration=7, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 341 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2430 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 52/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 04:30:05,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample