./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /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 --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /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 -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-wip.fs.cvc5-61a6796-m [2024-10-14 15:27:40,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 15:27:40,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 15:27:40,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 15:27:40,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 15:27:40,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 15:27:40,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 15:27:40,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 15:27:40,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 15:27:40,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 15:27:40,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 15:27:40,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 15:27:40,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 15:27:40,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 15:27:40,184 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 15:27:40,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 15:27:40,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 15:27:40,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 15:27:40,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 15:27:40,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 15:27:40,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 15:27:40,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 15:27:40,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 15:27:40,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 15:27:40,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 15:27:40,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 15:27:40,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 15:27:40,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 15:27:40,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 15:27:40,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:27:40,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 15:27:40,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 15:27:40,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 15:27:40,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 15:27:40,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 15:27:40,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 15:27:40,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 15:27:40,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 15:27:40,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 15:27:40,191 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-10-14 15:27:40,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 15:27:40,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 15:27:40,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 15:27:40,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 15:27:40,430 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 15:27:40,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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-10-14 15:27:41,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 15:27:42,085 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 15:27:42,086 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-10-14 15:27:42,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710694b4a/babb3ecf696e4ec1a405341d90d85ca2/FLAG0296b0c24 [2024-10-14 15:27:42,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710694b4a/babb3ecf696e4ec1a405341d90d85ca2 [2024-10-14 15:27:42,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 15:27:42,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 15:27:42,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 15:27:42,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 15:27:42,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 15:27:42,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:42,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15df7429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42, skipping insertion in model container [2024-10-14 15:27:42,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:42,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 15:27:42,661 WARN L248 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-10-14 15:27:42,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:27:42,710 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 15:27:42,857 WARN L248 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-10-14 15:27:42,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:27:42,888 INFO L204 MainTranslator]: Completed translation [2024-10-14 15:27:42,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42 WrapperNode [2024-10-14 15:27:42,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 15:27:42,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 15:27:42,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 15:27:42,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 15:27:42,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:42,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:42,953 INFO L138 Inliner]: procedures = 88, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 596 [2024-10-14 15:27:42,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 15:27:42,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 15:27:42,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 15:27:42,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 15:27:42,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:42,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:42,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:43,016 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [15, 2, 23]. 57 percent of accesses are in the largest equivalence class. The 29 initializations are split as follows [4, 2, 23]. The 4 writes are split as follows [4, 0, 0]. [2024-10-14 15:27:43,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:43,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:43,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:43,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:43,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:43,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:43,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 15:27:43,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 15:27:43,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 15:27:43,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 15:27:43,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (1/1) ... [2024-10-14 15:27:43,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:27:43,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:27:43,081 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-10-14 15:27:43,087 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-10-14 15:27:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 15:27:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2024-10-14 15:27:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2024-10-14 15:27:43,118 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2024-10-14 15:27:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2024-10-14 15:27:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 15:27:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 15:27:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 15:27:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2024-10-14 15:27:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2024-10-14 15:27:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-14 15:27:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-14 15:27:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 15:27:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 15:27:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 15:27:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-14 15:27:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-14 15:27:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 15:27:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 15:27:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 15:27:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 15:27:43,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 15:27:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2024-10-14 15:27:43,121 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2024-10-14 15:27:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-10-14 15:27:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-10-14 15:27:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 15:27:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-10-14 15:27:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-10-14 15:27:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 15:27:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 15:27:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 15:27:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-14 15:27:43,123 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-14 15:27:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2024-10-14 15:27:43,123 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2024-10-14 15:27:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 15:27:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-14 15:27:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2024-10-14 15:27:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 15:27:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 15:27:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2024-10-14 15:27:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2024-10-14 15:27:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 15:27:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 15:27:43,318 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 15:27:43,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 15:27:43,518 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-14 15:27:43,749 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2024-10-14 15:27:43,749 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 15:27:43,828 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 15:27:43,828 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 15:27:43,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:27:43 BoogieIcfgContainer [2024-10-14 15:27:43,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 15:27:43,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 15:27:43,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 15:27:43,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 15:27:43,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:27:42" (1/3) ... [2024-10-14 15:27:43,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c28bcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:27:43, skipping insertion in model container [2024-10-14 15:27:43,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:42" (2/3) ... [2024-10-14 15:27:43,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c28bcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:27:43, skipping insertion in model container [2024-10-14 15:27:43,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:27:43" (3/3) ... [2024-10-14 15:27:43,836 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-10-14 15:27:43,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 15:27:43,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 15:27:43,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 15:27:43,923 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;@1a521d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 15:27:43,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 15:27:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 128 states have internal predecessors, (175), 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-10-14 15:27:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 15:27:43,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:43,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:27:43,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:43,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1057273273, now seen corresponding path program 1 times [2024-10-14 15:27:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:43,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483225836] [2024-10-14 15:27:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 15:27:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:27:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483225836] [2024-10-14 15:27:44,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483225836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:44,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:44,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 15:27:44,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226891420] [2024-10-14 15:27:44,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:44,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:27:44,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:27:44,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:27:44,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 15:27:44,304 INFO L87 Difference]: Start difference. First operand has 167 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 128 states have internal predecessors, (175), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-14 15:27:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:44,478 INFO L93 Difference]: Finished difference Result 485 states and 712 transitions. [2024-10-14 15:27:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:27:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 11 [2024-10-14 15:27:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:44,494 INFO L225 Difference]: With dead ends: 485 [2024-10-14 15:27:44,494 INFO L226 Difference]: Without dead ends: 305 [2024-10-14 15:27:44,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-14 15:27:44,502 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 214 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:44,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 405 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:27:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-14 15:27:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2024-10-14 15:27:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 224 states have (on average 1.4017857142857142) internal successors, (314), 229 states have internal predecessors, (314), 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-10-14 15:27:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 416 transitions. [2024-10-14 15:27:44,581 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 416 transitions. Word has length 11 [2024-10-14 15:27:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:44,581 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 416 transitions. [2024-10-14 15:27:44,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-14 15:27:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 416 transitions. [2024-10-14 15:27:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 15:27:44,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:44,587 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] [2024-10-14 15:27:44,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 15:27:44,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:44,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:44,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1800264538, now seen corresponding path program 1 times [2024-10-14 15:27:44,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:44,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473911642] [2024-10-14 15:27:44,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:44,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:27:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:27:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 15:27:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:27:44,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473911642] [2024-10-14 15:27:44,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473911642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:44,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:44,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 15:27:44,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854811141] [2024-10-14 15:27:44,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:44,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 15:27:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:27:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 15:27:44,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 15:27:44,713 INFO L87 Difference]: Start difference. First operand 302 states and 416 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 15:27:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:45,174 INFO L93 Difference]: Finished difference Result 320 states and 434 transitions. [2024-10-14 15:27:45,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 15:27:45,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 24 [2024-10-14 15:27:45,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:45,181 INFO L225 Difference]: With dead ends: 320 [2024-10-14 15:27:45,181 INFO L226 Difference]: Without dead ends: 315 [2024-10-14 15:27:45,181 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-10-14 15:27:45,184 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 248 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:45,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 225 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 15:27:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-14 15:27:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 302. [2024-10-14 15:27:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 224 states have (on average 1.3973214285714286) internal successors, (313), 229 states have internal predecessors, (313), 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-10-14 15:27:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 415 transitions. [2024-10-14 15:27:45,218 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 415 transitions. Word has length 24 [2024-10-14 15:27:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:45,219 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 415 transitions. [2024-10-14 15:27:45,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 15:27:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 415 transitions. [2024-10-14 15:27:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 15:27:45,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:45,221 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] [2024-10-14 15:27:45,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 15:27:45,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:45,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1857522840, now seen corresponding path program 1 times [2024-10-14 15:27:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:45,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655571407] [2024-10-14 15:27:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:27:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:27:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 15:27:45,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:27:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655571407] [2024-10-14 15:27:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655571407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 15:27:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896849694] [2024-10-14 15:27:45,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:45,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 15:27:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:27:45,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 15:27:45,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 15:27:45,309 INFO L87 Difference]: Start difference. First operand 302 states and 415 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 15:27:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:45,490 INFO L93 Difference]: Finished difference Result 608 states and 850 transitions. [2024-10-14 15:27:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 15:27:45,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 24 [2024-10-14 15:27:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:45,492 INFO L225 Difference]: With dead ends: 608 [2024-10-14 15:27:45,493 INFO L226 Difference]: Without dead ends: 305 [2024-10-14 15:27:45,496 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-10-14 15:27:45,497 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 233 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:45,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 216 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:27:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-14 15:27:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 296. [2024-10-14 15:27:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.3881278538812785) internal successors, (304), 223 states have internal predecessors, (304), 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-10-14 15:27:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 405 transitions. [2024-10-14 15:27:45,528 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 405 transitions. Word has length 24 [2024-10-14 15:27:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:45,529 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 405 transitions. [2024-10-14 15:27:45,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 15:27:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 405 transitions. [2024-10-14 15:27:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 15:27:45,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:45,533 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 15:27:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 15:27:45,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1991221876, now seen corresponding path program 1 times [2024-10-14 15:27:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830369450] [2024-10-14 15:27:45,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:27:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 15:27:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 15:27:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 15:27:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:27:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 15:27:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:27:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830369450] [2024-10-14 15:27:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830369450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:45,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 15:27:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203406456] [2024-10-14 15:27:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:45,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:27:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:27:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:27:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:27:45,632 INFO L87 Difference]: Start difference. First operand 296 states and 405 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 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-10-14 15:27:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:46,028 INFO L93 Difference]: Finished difference Result 817 states and 1161 transitions. [2024-10-14 15:27:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 15:27:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 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 40 [2024-10-14 15:27:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:46,031 INFO L225 Difference]: With dead ends: 817 [2024-10-14 15:27:46,032 INFO L226 Difference]: Without dead ends: 522 [2024-10-14 15:27:46,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-10-14 15:27:46,034 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 275 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:46,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 447 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 15:27:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-10-14 15:27:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 373. [2024-10-14 15:27:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 286 states have (on average 1.3951048951048952) internal successors, (399), 290 states have internal predecessors, (399), 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-10-14 15:27:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 516 transitions. [2024-10-14 15:27:46,076 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 516 transitions. Word has length 40 [2024-10-14 15:27:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 516 transitions. [2024-10-14 15:27:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 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-10-14 15:27:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 516 transitions. [2024-10-14 15:27:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 15:27:46,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:46,079 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:27:46,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 15:27:46,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:46,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:46,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1930909387, now seen corresponding path program 1 times [2024-10-14 15:27:46,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:46,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975355104] [2024-10-14 15:27:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:27:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:27:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 15:27:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:27:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 15:27:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 15:27:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 15:27:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 15:27:46,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:27:46,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975355104] [2024-10-14 15:27:46,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975355104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:27:46,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150427352] [2024-10-14 15:27:46,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:46,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:27:46,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:27:46,268 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-10-14 15:27:46,270 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-10-14 15:27:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:46,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 15:27:46,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 15:27:46,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150427352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:46,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:27:46,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-10-14 15:27:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218482645] [2024-10-14 15:27:46,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:46,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:27:46,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:27:46,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:27:46,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:27:46,493 INFO L87 Difference]: Start difference. First operand 373 states and 516 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-10-14 15:27:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:46,594 INFO L93 Difference]: Finished difference Result 1077 states and 1490 transitions. [2024-10-14 15:27:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:27:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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 58 [2024-10-14 15:27:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:46,597 INFO L225 Difference]: With dead ends: 1077 [2024-10-14 15:27:46,597 INFO L226 Difference]: Without dead ends: 705 [2024-10-14 15:27:46,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:27:46,598 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 154 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:46,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 389 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 15:27:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-14 15:27:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 701. [2024-10-14 15:27:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 549 states have (on average 1.3970856102003644) internal successors, (767), 557 states have internal predecessors, (767), 101 states have call successors, (101), 51 states have call predecessors, (101), 50 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 15:27:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 968 transitions. [2024-10-14 15:27:46,638 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 968 transitions. Word has length 58 [2024-10-14 15:27:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:46,638 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 968 transitions. [2024-10-14 15:27:46,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-10-14 15:27:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 968 transitions. [2024-10-14 15:27:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 15:27:46,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:46,640 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] [2024-10-14 15:27:46,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 15:27:46,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:27:46,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:46,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1590495583, now seen corresponding path program 1 times [2024-10-14 15:27:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755968210] [2024-10-14 15:27:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:27:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:27:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:27:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 15:27:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 15:27:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 15:27:47,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:27:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755968210] [2024-10-14 15:27:47,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755968210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:27:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945161681] [2024-10-14 15:27:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:27:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:27:47,151 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-10-14 15:27:47,153 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-10-14 15:27:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 15:27:47,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 15:27:47,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945161681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:47,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:27:47,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-14 15:27:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855088695] [2024-10-14 15:27:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:47,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:27:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:27:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:27:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:27:47,376 INFO L87 Difference]: Start difference. First operand 701 states and 968 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-10-14 15:27:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:47,466 INFO L93 Difference]: Finished difference Result 1401 states and 1939 transitions. [2024-10-14 15:27:47,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:27:47,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 62 [2024-10-14 15:27:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:47,472 INFO L225 Difference]: With dead ends: 1401 [2024-10-14 15:27:47,472 INFO L226 Difference]: Without dead ends: 701 [2024-10-14 15:27:47,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 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-10-14 15:27:47,474 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:47,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 370 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 15:27:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-14 15:27:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-10-14 15:27:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 549 states have (on average 1.389799635701275) internal successors, (763), 557 states have internal predecessors, (763), 101 states have call successors, (101), 51 states have call predecessors, (101), 50 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 15:27:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 964 transitions. [2024-10-14 15:27:47,534 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 964 transitions. Word has length 62 [2024-10-14 15:27:47,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:47,535 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 964 transitions. [2024-10-14 15:27:47,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-10-14 15:27:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 964 transitions. [2024-10-14 15:27:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 15:27:47,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:47,541 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] [2024-10-14 15:27:47,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 15:27:47,743 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,SelfDestructingSolverStorable5 [2024-10-14 15:27:47,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:47,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash -173908254, now seen corresponding path program 1 times [2024-10-14 15:27:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:47,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764080826] [2024-10-14 15:27:47,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:27:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:27:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:27:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:47,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 15:27:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:48,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 15:27:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 15:27:48,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:27:48,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764080826] [2024-10-14 15:27:48,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764080826] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:27:48,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448180296] [2024-10-14 15:27:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:48,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:27:48,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:27:48,011 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-10-14 15:27:48,012 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-10-14 15:27:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:48,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 15:27:48,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 15:27:48,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:48,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448180296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:48,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:27:48,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-10-14 15:27:48,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354962412] [2024-10-14 15:27:48,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:48,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:27:48,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:27:48,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:27:48,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:27:48,215 INFO L87 Difference]: Start difference. First operand 701 states and 964 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 15:27:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:48,318 INFO L93 Difference]: Finished difference Result 1417 states and 1959 transitions. [2024-10-14 15:27:48,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 15:27:48,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 64 [2024-10-14 15:27:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:48,322 INFO L225 Difference]: With dead ends: 1417 [2024-10-14 15:27:48,322 INFO L226 Difference]: Without dead ends: 717 [2024-10-14 15:27:48,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:27:48,324 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:48,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:27:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-14 15:27:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-10-14 15:27:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 561 states have (on average 1.3814616755793225) internal successors, (775), 569 states have internal predecessors, (775), 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-10-14 15:27:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 988 transitions. [2024-10-14 15:27:48,361 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 988 transitions. Word has length 64 [2024-10-14 15:27:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:48,362 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 988 transitions. [2024-10-14 15:27:48,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 15:27:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 988 transitions. [2024-10-14 15:27:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 15:27:48,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:48,364 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] [2024-10-14 15:27:48,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 15:27:48,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:27:48,565 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:48,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1690897646, now seen corresponding path program 1 times [2024-10-14 15:27:48,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:48,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131049742] [2024-10-14 15:27:48,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:48,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:27:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 15:27:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:27:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 15:27:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 15:27:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:49,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 15:27:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 15:27:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:27:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131049742] [2024-10-14 15:27:49,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131049742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:27:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866248636] [2024-10-14 15:27:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:49,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:27:49,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:27:49,038 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-10-14 15:27:49,042 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-10-14 15:27:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:49,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 15:27:49,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 15:27:49,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866248636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:49,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:27:49,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-10-14 15:27:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618810752] [2024-10-14 15:27:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:49,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:27:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:27:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:27:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:27:49,250 INFO L87 Difference]: Start difference. First operand 717 states and 988 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-10-14 15:27:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:49,347 INFO L93 Difference]: Finished difference Result 1441 states and 1991 transitions. [2024-10-14 15:27:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 15:27:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 70 [2024-10-14 15:27:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:49,351 INFO L225 Difference]: With dead ends: 1441 [2024-10-14 15:27:49,351 INFO L226 Difference]: Without dead ends: 725 [2024-10-14 15:27:49,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:27:49,352 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:49,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 741 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:27:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-14 15:27:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2024-10-14 15:27:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 569 states have (on average 1.37609841827768) internal successors, (783), 573 states have internal predecessors, (783), 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-10-14 15:27:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 996 transitions. [2024-10-14 15:27:49,383 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 996 transitions. Word has length 70 [2024-10-14 15:27:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:49,384 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 996 transitions. [2024-10-14 15:27:49,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-10-14 15:27:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 996 transitions. [2024-10-14 15:27:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 15:27:49,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:49,385 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] [2024-10-14 15:27:49,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 15:27:49,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:27:49,590 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:49,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash -958289182, now seen corresponding path program 2 times [2024-10-14 15:27:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:27:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412279244] [2024-10-14 15:27:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:27:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 15:27:49,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 15:27:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 15:27:49,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 15:27:49,742 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 15:27:49,743 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 15:27:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 15:27:49,747 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:27:49,827 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 15:27:49,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:27:49 BoogieIcfgContainer [2024-10-14 15:27:49,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 15:27:49,829 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 15:27:49,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 15:27:49,830 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 15:27:49,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:27:43" (3/4) ... [2024-10-14 15:27:49,832 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 15:27:49,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 15:27:49,833 INFO L158 Benchmark]: Toolchain (without parser) took 7711.41ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 100.6MB in the beginning and 203.2MB in the end (delta: -102.6MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2024-10-14 15:27:49,833 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 161.5MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 15:27:49,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.19ms. Allocated memory is still 161.5MB. Free memory was 100.6MB in the beginning and 107.4MB in the end (delta: -6.8MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-10-14 15:27:49,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.23ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 102.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 15:27:49,834 INFO L158 Benchmark]: Boogie Preprocessor took 92.26ms. Allocated memory is still 161.5MB. Free memory was 102.5MB in the beginning and 93.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 15:27:49,834 INFO L158 Benchmark]: RCFGBuilder took 778.78ms. Allocated memory was 161.5MB in the beginning and 255.9MB in the end (delta: 94.4MB). Free memory was 93.4MB in the beginning and 178.5MB in the end (delta: -85.0MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-10-14 15:27:49,835 INFO L158 Benchmark]: TraceAbstraction took 5999.20ms. Allocated memory was 255.9MB in the beginning and 343.9MB in the end (delta: 88.1MB). Free memory was 178.5MB in the beginning and 204.2MB in the end (delta: -25.8MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2024-10-14 15:27:49,835 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 343.9MB. Free memory was 204.2MB in the beginning and 203.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 15:27:49,836 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.09ms. Allocated memory is still 161.5MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.19ms. Allocated memory is still 161.5MB. Free memory was 100.6MB in the beginning and 107.4MB in the end (delta: -6.8MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.23ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 102.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.26ms. Allocated memory is still 161.5MB. Free memory was 102.5MB in the beginning and 93.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 778.78ms. Allocated memory was 161.5MB in the beginning and 255.9MB in the end (delta: 94.4MB). Free memory was 93.4MB in the beginning and 178.5MB in the end (delta: -85.0MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5999.20ms. Allocated memory was 255.9MB in the beginning and 343.9MB in the end (delta: 88.1MB). Free memory was 178.5MB in the beginning and 204.2MB in the end (delta: -25.8MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 343.9MB. Free memory was 204.2MB in the beginning and 203.2MB in the end (delta: 1.0MB). There was no memory consumed. 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}; [L2984] int ldv_retval_0 ; [L2985] int ldv_retval_1 ; [L2988] int ldv_retval_2 ; [L3356] int ldv_module_refcounter = 1; [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={32770:32771}, 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={32770:32771}, 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={32770:32771}, 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={32770:32771}, 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={32770:32771}, 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) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, size=1472] [L2731] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={32770:32771}, 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={32770:32771}, 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={32770:32771}, 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) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, size=1472] [L2732] return (p); [L3104] RET, EXPR ldv_init_zalloc(1472UL) [L3104] tmp = ldv_init_zalloc(1472UL) [L3105] iio_interrupt_trigger_driver_group1 = (struct platform_device *)tmp [L3300] RET ldv_platform_driver_init_2() [L3301] return (ldv_func_res); [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); [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={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp=1] [L3155] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp=1] [L3147] tmp = __VERIFIER_nondet_int() [L3149] case 0: [L3155] case 1: [L3189] case 2: [L3191] tmp___1 = __VERIFIER_nondet_int() [L3193] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp___1=0] [L3189] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, tmp___1=0] [L3195] CALL iio_interrupt_trigger_probe(iio_interrupt_trigger_driver_group1) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2884] struct iio_interrupt_trigger_info *trig_info ; [L2885] struct iio_trigger *trig ; [L2886] unsigned long irqflags ; [L2887] struct resource *irq_res ; [L2888] int irq ; [L2889] int ret ; [L2890] void *tmp ; [L2892] ret = 0 [L2893] CALL, EXPR platform_get_resource(pdev, 1024U, 0U) [L3452] CALL, EXPR ldv_malloc(sizeof(struct resource)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND FALSE !(tmp___0 != 0) [L2700] tmp = malloc(size) [L2701] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 0 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2702] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2688] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2702] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 0 << 64) | 18446744073709551615U):0}, probed_2=0, ref_cnt=0] [L2703] return (p); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, \result={-(((__int128) 0 << 64) | 18446744073709551615U):0}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3452] RET, EXPR ldv_malloc(sizeof(struct resource)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3452] return ldv_malloc(sizeof(struct resource)); [L2893] RET, EXPR platform_get_resource(pdev, 1024U, 0U) [L2893] irq_res = platform_get_resource(pdev, 1024U, 0U) [L2894] COND FALSE !((unsigned long )irq_res == (unsigned long )((struct resource *)0)) [L2898] EXPR irq_res->flags VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={-(((__int128) 1 << 64) | 1):0}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 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) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0] [L2898] EXPR (irq_res->flags & 15UL) | 128UL VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(pdev)={-(((__int128) 1 << 64) | 1):0}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 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) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0] [L2898] irqflags = (irq_res->flags & 15UL) | 128UL [L2899] EXPR irq_res->start [L2899] irq = (int )irq_res->start [L2900] CALL, EXPR iio_trigger_alloc("irqtrig%d", irq) [L3433] CALL, EXPR ldv_malloc(sizeof(struct iio_trigger)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND FALSE !(tmp___0 != 0) [L2700] tmp = malloc(size) [L2701] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 2 << 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={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2688] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2702] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=1803, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-(((__int128) 2 << 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) 2 << 64) | 1):0}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3433] RET, EXPR ldv_malloc(sizeof(struct iio_trigger)) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3433] return ldv_malloc(sizeof(struct iio_trigger)); [L2900] RET, EXPR iio_trigger_alloc("irqtrig%d", irq) [L2900] trig = iio_trigger_alloc("irqtrig%d", irq) [L2901] COND FALSE !((unsigned long )trig == (unsigned long )((struct iio_trigger *)0)) [L2906] CALL, EXPR kzalloc(4UL, 208U) [L2676] void *tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, flags=208, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2678] EXPR flags | 32768U VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2678] CALL, EXPR kmalloc(size, flags | 32768U) [L2667] void *tmp___2 ; [L2669] CALL, EXPR __kmalloc(size, flags) [L2662] CALL, EXPR ldv_malloc(size) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=4, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2692] void *p ; [L2693] void *tmp ; [L2694] int tmp___0 ; [L2696] tmp___0 = __VERIFIER_nondet_int() [L2697] COND TRUE tmp___0 != 0 [L2698] return ((void *)0); VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=4, \result={0:0}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2662] RET, EXPR ldv_malloc(size) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0, size=4] [L2662] return ldv_malloc(size); [L2669] RET, EXPR __kmalloc(size, flags) [L2669] tmp___2 = __kmalloc(size, flags) [L2670] return (tmp___2); [L2678] RET, EXPR kmalloc(size, flags | 32768U) [L2678] tmp = kmalloc(size, flags | 32768U) [L2679] return (tmp); [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) 1 << 64) | 1):0}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):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={-(((__int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, trig={-(((__int128) 2 << 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) 1 << 64) | 1):0}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):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={-(((__int128) 1 << 64) | 1):0}, probed_2=0, ref_cnt=0, ret=-12, trig={-(((__int128) 2 << 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={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2850] EXPR trig->ops [L2850] EXPR (trig->ops)->owner [L2850] CALL ldv_module_put_5((trig->ops)->owner) [L3247] CALL ldv_module_put(ldv_func_arg1) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3387] COND TRUE (unsigned long )module != (unsigned long )((struct module *)0) VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3388] COND TRUE ldv_module_refcounter <= 1 VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(module)={9:-8}, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3389] CALL ldv_error() VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3317] reach_error() VAL [LDV_IN_INTERRUPT=1, \old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={32770:32771}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 168 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1163 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1126 mSDsluCounter, 3535 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2145 mSDsCounter, 253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 875 IncrementalHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 253 mSolverCounterUnsat, 1390 mSDtfsCounter, 875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=725occurred in iteration=8, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 178 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 683 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2265 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 97/110 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-10-14 15:27:49,865 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/current/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 /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 -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-wip.fs.cvc5-61a6796-m [2024-10-14 15:27:51,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 15:27:51,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 15:27:51,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 15:27:51,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 15:27:51,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 15:27:51,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 15:27:51,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 15:27:51,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 15:27:51,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 15:27:51,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 15:27:51,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 15:27:51,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 15:27:51,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 15:27:51,965 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 15:27:51,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 15:27:51,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 15:27:51,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 15:27:51,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 15:27:51,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 15:27:51,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 15:27:51,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 15:27:51,971 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 15:27:51,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 15:27:51,971 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 15:27:51,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 15:27:51,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 15:27:51,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 15:27:51,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 15:27:51,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 15:27:51,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 15:27:51,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:27:51,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 15:27:51,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 15:27:51,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 15:27:51,973 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 15:27:51,973 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 15:27:51,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 15:27:51,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 15:27:51,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 15:27:51,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 15:27:51,974 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 15:27:51,974 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-10-14 15:27:52,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 15:27:52,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 15:27:52,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 15:27:52,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 15:27:52,282 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 15:27:52,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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-10-14 15:27:53,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 15:27:53,976 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 15:27:53,978 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-10-14 15:27:54,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bad4ee3f/64676ed520b647a59752a3936a580116/FLAG84067c8ea [2024-10-14 15:27:54,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bad4ee3f/64676ed520b647a59752a3936a580116 [2024-10-14 15:27:54,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 15:27:54,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 15:27:54,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 15:27:54,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 15:27:54,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 15:27:54,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:54,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41599a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54, skipping insertion in model container [2024-10-14 15:27:54,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:54,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 15:27:54,509 WARN L248 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-10-14 15:27:54,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:27:54,569 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 15:27:54,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 15:27:54,710 WARN L248 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-10-14 15:27:54,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:27:54,721 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 15:27:54,817 WARN L248 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-10-14 15:27:54,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:27:54,861 INFO L204 MainTranslator]: Completed translation [2024-10-14 15:27:54,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54 WrapperNode [2024-10-14 15:27:54,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 15:27:54,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 15:27:54,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 15:27:54,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 15:27:54,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:54,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:54,931 INFO L138 Inliner]: procedures = 93, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 555 [2024-10-14 15:27:54,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 15:27:54,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 15:27:54,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 15:27:54,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 15:27:54,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:54,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:54,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:54,999 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 23, 15]. 57 percent of accesses are in the largest equivalence class. The 29 initializations are split as follows [2, 23, 4]. The 4 writes are split as follows [0, 0, 4]. [2024-10-14 15:27:55,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:55,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:55,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:55,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:55,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:55,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:55,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 15:27:55,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 15:27:55,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 15:27:55,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 15:27:55,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (1/1) ... [2024-10-14 15:27:55,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:27:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:27:55,111 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-10-14 15:27:55,116 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-10-14 15:27:55,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 15:27:55,148 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2024-10-14 15:27:55,148 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2024-10-14 15:27:55,149 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2024-10-14 15:27:55,149 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2024-10-14 15:27:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 15:27:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 15:27:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 15:27:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2024-10-14 15:27:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2024-10-14 15:27:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2024-10-14 15:27:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2024-10-14 15:27:55,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2024-10-14 15:27:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 15:27:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 15:27:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 15:27:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-14 15:27:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-14 15:27:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-14 15:27:55,152 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-14 15:27:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 15:27:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 15:27:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 15:27:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 15:27:55,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 15:27:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2024-10-14 15:27:55,153 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2024-10-14 15:27:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-10-14 15:27:55,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-10-14 15:27:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 15:27:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 15:27:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 15:27:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 15:27:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-10-14 15:27:55,154 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-10-14 15:27:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 15:27:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 15:27:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 15:27:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-14 15:27:55,155 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-14 15:27:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2024-10-14 15:27:55,155 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2024-10-14 15:27:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 15:27:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 15:27:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 15:27:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 15:27:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 15:27:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 15:27:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-14 15:27:55,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-14 15:27:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2024-10-14 15:27:55,156 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2024-10-14 15:27:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 15:27:55,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 15:27:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 15:27:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2024-10-14 15:27:55,157 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2024-10-14 15:27:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 15:27:55,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 15:27:55,371 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 15:27:55,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 15:27:55,680 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-14 15:27:55,987 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2024-10-14 15:27:55,987 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 15:27:56,080 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 15:27:56,081 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 15:27:56,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:27:56 BoogieIcfgContainer [2024-10-14 15:27:56,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 15:27:56,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 15:27:56,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 15:27:56,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 15:27:56,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:27:54" (1/3) ... [2024-10-14 15:27:56,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fd7f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:27:56, skipping insertion in model container [2024-10-14 15:27:56,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:54" (2/3) ... [2024-10-14 15:27:56,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fd7f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:27:56, skipping insertion in model container [2024-10-14 15:27:56,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:27:56" (3/3) ... [2024-10-14 15:27:56,090 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-10-14 15:27:56,102 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 15:27:56,102 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 15:27:56,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 15:27:56,161 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;@6b70c242, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 15:27:56,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 15:27:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 110 states have (on average 1.481818181818182) internal successors, (163), 120 states have internal predecessors, (163), 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-10-14 15:27:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 15:27:56,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:56,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:27:56,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:56,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash 659070431, now seen corresponding path program 1 times [2024-10-14 15:27:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 15:27:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078615950] [2024-10-14 15:27:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:56,185 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-10-14 15:27:56,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 15:27:56,192 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-10-14 15:27:56,207 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-10-14 15:27:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:56,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 15:27:56,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 15:27:56,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:56,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 15:27:56,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078615950] [2024-10-14 15:27:56,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078615950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:56,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:56,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 15:27:56,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639243552] [2024-10-14 15:27:56,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:56,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:27:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 15:27:56,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:27:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 15:27:56,444 INFO L87 Difference]: Start difference. First operand has 159 states, 110 states have (on average 1.481818181818182) internal successors, (163), 120 states have internal predecessors, (163), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-14 15:27:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:56,663 INFO L93 Difference]: Finished difference Result 461 states and 676 transitions. [2024-10-14 15:27:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:27:56,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 11 [2024-10-14 15:27:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:56,685 INFO L225 Difference]: With dead ends: 461 [2024-10-14 15:27:56,685 INFO L226 Difference]: Without dead ends: 289 [2024-10-14 15:27:56,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-10-14 15:27:56,698 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 204 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:56,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 383 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:27:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-14 15:27:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2024-10-14 15:27:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 208 states have (on average 1.4134615384615385) internal successors, (294), 213 states have internal predecessors, (294), 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-10-14 15:27:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 396 transitions. [2024-10-14 15:27:56,822 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 396 transitions. Word has length 11 [2024-10-14 15:27:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:56,822 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 396 transitions. [2024-10-14 15:27:56,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-14 15:27:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 396 transitions. [2024-10-14 15:27:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 15:27:56,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:56,829 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] [2024-10-14 15:27:56,835 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-10-14 15:27:57,030 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-10-14 15:27:57,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:57,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1267116966, now seen corresponding path program 1 times [2024-10-14 15:27:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 15:27:57,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906794486] [2024-10-14 15:27:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:57,034 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-10-14 15:27:57,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 15:27:57,037 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-10-14 15:27:57,037 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-10-14 15:27:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:57,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 15:27:57,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 15:27:57,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:57,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 15:27:57,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906794486] [2024-10-14 15:27:57,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906794486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:57,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:57,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 15:27:57,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559110136] [2024-10-14 15:27:57,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:57,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:27:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 15:27:57,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:27:57,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 15:27:57,211 INFO L87 Difference]: Start difference. First operand 286 states and 396 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 15:27:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:57,309 INFO L93 Difference]: Finished difference Result 296 states and 404 transitions. [2024-10-14 15:27:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:27:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 24 [2024-10-14 15:27:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:57,312 INFO L225 Difference]: With dead ends: 296 [2024-10-14 15:27:57,312 INFO L226 Difference]: Without dead ends: 291 [2024-10-14 15:27:57,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-10-14 15:27:57,313 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 202 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:57,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 192 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:27:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-14 15:27:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 286. [2024-10-14 15:27:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 208 states have (on average 1.4086538461538463) internal successors, (293), 213 states have internal predecessors, (293), 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-10-14 15:27:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 395 transitions. [2024-10-14 15:27:57,352 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 395 transitions. Word has length 24 [2024-10-14 15:27:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:57,353 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 395 transitions. [2024-10-14 15:27:57,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10-14 15:27:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 395 transitions. [2024-10-14 15:27:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 15:27:57,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:57,356 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] [2024-10-14 15:27:57,361 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-10-14 15:27:57,556 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-10-14 15:27:57,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:57,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1209858664, now seen corresponding path program 1 times [2024-10-14 15:27:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 15:27:57,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632793840] [2024-10-14 15:27:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:57,558 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-10-14 15:27:57,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 15:27:57,563 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-10-14 15:27:57,564 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-10-14 15:27:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:57,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 15:27:57,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 15:27:57,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:57,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 15:27:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632793840] [2024-10-14 15:27:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632793840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 15:27:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710751614] [2024-10-14 15:27:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:57,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:27:57,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 15:27:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:27:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 15:27:57,720 INFO L87 Difference]: Start difference. First operand 286 states and 395 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-10-14 15:27:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:57,818 INFO L93 Difference]: Finished difference Result 568 states and 798 transitions. [2024-10-14 15:27:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:27:57,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 24 [2024-10-14 15:27:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:57,828 INFO L225 Difference]: With dead ends: 568 [2024-10-14 15:27:57,828 INFO L226 Difference]: Without dead ends: 281 [2024-10-14 15:27:57,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-10-14 15:27:57,830 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:57,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 180 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:27:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-14 15:27:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2024-10-14 15:27:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.3990147783251232) internal successors, (284), 207 states have internal predecessors, (284), 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-10-14 15:27:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2024-10-14 15:27:57,871 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 24 [2024-10-14 15:27:57,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:57,872 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2024-10-14 15:27:57,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-10-14 15:27:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2024-10-14 15:27:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 15:27:57,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:57,878 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 15:27:57,888 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-10-14 15:27:58,079 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-10-14 15:27:58,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:58,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1091813748, now seen corresponding path program 1 times [2024-10-14 15:27:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 15:27:58,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963275498] [2024-10-14 15:27:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:58,084 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-10-14 15:27:58,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 15:27:58,086 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-10-14 15:27:58,087 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-10-14 15:27:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:58,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 15:27:58,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 15:27:58,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:58,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 15:27:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963275498] [2024-10-14 15:27:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963275498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 15:27:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571102264] [2024-10-14 15:27:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:58,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:27:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 15:27:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:27:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 15:27:58,256 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 15:27:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:58,429 INFO L93 Difference]: Finished difference Result 637 states and 883 transitions. [2024-10-14 15:27:58,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:27:58,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (9), 1 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 40 [2024-10-14 15:27:58,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:58,431 INFO L225 Difference]: With dead ends: 637 [2024-10-14 15:27:58,431 INFO L226 Difference]: Without dead ends: 358 [2024-10-14 15:27:58,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-10-14 15:27:58,433 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 52 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:58,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 348 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:27:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-14 15:27:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2024-10-14 15:27:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 270 states have (on average 1.4037037037037037) internal successors, (379), 274 states have internal predecessors, (379), 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-10-14 15:27:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 496 transitions. [2024-10-14 15:27:58,452 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 496 transitions. Word has length 40 [2024-10-14 15:27:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:58,452 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 496 transitions. [2024-10-14 15:27:58,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 15:27:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 496 transitions. [2024-10-14 15:27:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 15:27:58,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:58,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:27:58,463 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-10-14 15:27:58,655 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-10-14 15:27:58,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:58,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1562901392, now seen corresponding path program 1 times [2024-10-14 15:27:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 15:27:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509310891] [2024-10-14 15:27:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:58,657 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-10-14 15:27:58,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 15:27:58,659 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-10-14 15:27:58,660 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-10-14 15:27:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:58,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 15:27:58,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 15:27:58,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:58,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 15:27:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509310891] [2024-10-14 15:27:58,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509310891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:58,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:58,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 15:27:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687401414] [2024-10-14 15:27:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:58,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:27:58,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 15:27:58,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:27:58,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 15:27:58,899 INFO L87 Difference]: Start difference. First operand 357 states and 496 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-10-14 15:27:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:59,128 INFO L93 Difference]: Finished difference Result 1029 states and 1430 transitions. [2024-10-14 15:27:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:27:59,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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 59 [2024-10-14 15:27:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:59,133 INFO L225 Difference]: With dead ends: 1029 [2024-10-14 15:27:59,133 INFO L226 Difference]: Without dead ends: 673 [2024-10-14 15:27:59,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-10-14 15:27:59,136 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 143 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:59,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 369 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:27:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-14 15:27:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 669. [2024-10-14 15:27:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 517 states have (on average 1.4061895551257253) internal successors, (727), 525 states have internal predecessors, (727), 101 states have call successors, (101), 51 states have call predecessors, (101), 50 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 15:27:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 928 transitions. [2024-10-14 15:27:59,173 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 928 transitions. Word has length 59 [2024-10-14 15:27:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:59,173 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 928 transitions. [2024-10-14 15:27:59,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-10-14 15:27:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 928 transitions. [2024-10-14 15:27:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 15:27:59,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:59,176 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] [2024-10-14 15:27:59,183 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 (6)] Ended with exit code 0 [2024-10-14 15:27:59,376 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-10-14 15:27:59,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:27:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:27:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1882975602, now seen corresponding path program 1 times [2024-10-14 15:27:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 15:27:59,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006782976] [2024-10-14 15:27:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:27:59,378 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-10-14 15:27:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 15:27:59,381 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-10-14 15:27:59,381 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-10-14 15:27:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:27:59,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 15:27:59,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:27:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 15:27:59,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:27:59,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 15:27:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006782976] [2024-10-14 15:27:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006782976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:27:59,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:27:59,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 15:27:59,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658720209] [2024-10-14 15:27:59,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:27:59,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:27:59,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 15:27:59,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:27:59,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:27:59,604 INFO L87 Difference]: Start difference. First operand 669 states and 928 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-10-14 15:27:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:27:59,891 INFO L93 Difference]: Finished difference Result 1353 states and 1887 transitions. [2024-10-14 15:27:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 15:27:59,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 58 [2024-10-14 15:27:59,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:27:59,897 INFO L225 Difference]: With dead ends: 1353 [2024-10-14 15:27:59,897 INFO L226 Difference]: Without dead ends: 685 [2024-10-14 15:27:59,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:27:59,900 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:27:59,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 707 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:27:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-10-14 15:27:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2024-10-14 15:27:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 529 states have (on average 1.3969754253308129) internal successors, (739), 537 states have internal predecessors, (739), 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-10-14 15:27:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 952 transitions. [2024-10-14 15:27:59,941 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 952 transitions. Word has length 58 [2024-10-14 15:27:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:27:59,941 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 952 transitions. [2024-10-14 15:27:59,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-10-14 15:27:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 952 transitions. [2024-10-14 15:27:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 15:27:59,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:27:59,944 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] [2024-10-14 15:27:59,952 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 (7)] Ended with exit code 0 [2024-10-14 15:28:00,144 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-10-14 15:28:00,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:28:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:28:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1838102686, now seen corresponding path program 1 times [2024-10-14 15:28:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 15:28:00,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512072527] [2024-10-14 15:28:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:28:00,148 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-10-14 15:28:00,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 15:28:00,151 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-10-14 15:28:00,155 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-10-14 15:28:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:28:00,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 15:28:00,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:28:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 15:28:00,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:28:00,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 15:28:00,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512072527] [2024-10-14 15:28:00,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512072527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:28:00,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:28:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 15:28:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068128024] [2024-10-14 15:28:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:28:00,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:28:00,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 15:28:00,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:28:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:28:00,392 INFO L87 Difference]: Start difference. First operand 685 states and 952 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 15:28:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:28:00,660 INFO L93 Difference]: Finished difference Result 1377 states and 1919 transitions. [2024-10-14 15:28:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 15:28:00,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 64 [2024-10-14 15:28:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:28:00,664 INFO L225 Difference]: With dead ends: 1377 [2024-10-14 15:28:00,664 INFO L226 Difference]: Without dead ends: 693 [2024-10-14 15:28:00,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:28:00,666 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:28:00,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 705 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:28:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-14 15:28:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-14 15:28:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 537 states have (on average 1.3910614525139664) internal successors, (747), 541 states have internal predecessors, (747), 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-10-14 15:28:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 960 transitions. [2024-10-14 15:28:00,703 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 960 transitions. Word has length 64 [2024-10-14 15:28:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:28:00,703 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 960 transitions. [2024-10-14 15:28:00,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 15:28:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 960 transitions. [2024-10-14 15:28:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 15:28:00,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:28:00,706 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] [2024-10-14 15:28:00,713 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 (8)] Forceful destruction successful, exit code 0 [2024-10-14 15:28:00,906 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-10-14 15:28:00,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:28:00,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:28:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1411163378, now seen corresponding path program 2 times [2024-10-14 15:28:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 15:28:00,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145123273] [2024-10-14 15:28:00,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 15:28:00,908 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-10-14 15:28:00,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 15:28:00,912 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-10-14 15:28:00,913 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-10-14 15:28:01,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 15:28:01,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 15:28:01,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 15:28:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 15:28:01,608 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 15:28:01,609 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 15:28:01,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 15:28:01,620 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 (9)] Forceful destruction successful, exit code 0 [2024-10-14 15:28:01,811 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-10-14 15:28:01,814 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-14 15:28:01,914 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 15:28:01,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:28:01 BoogieIcfgContainer [2024-10-14 15:28:01,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 15:28:01,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 15:28:01,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 15:28:01,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 15:28:01,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:27:56" (3/4) ... [2024-10-14 15:28:01,926 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 15:28:01,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 15:28:01,927 INFO L158 Benchmark]: Toolchain (without parser) took 7908.02ms. Allocated memory was 92.3MB in the beginning and 184.5MB in the end (delta: 92.3MB). Free memory was 48.5MB in the beginning and 58.7MB in the end (delta: -10.3MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-10-14 15:28:01,927 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 40.4MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 15:28:01,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.22ms. Allocated memory is still 92.3MB. Free memory was 48.0MB in the beginning and 38.7MB in the end (delta: 9.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 15:28:01,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.84ms. Allocated memory is still 92.3MB. Free memory was 38.7MB in the beginning and 34.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 15:28:01,928 INFO L158 Benchmark]: Boogie Preprocessor took 146.47ms. Allocated memory is still 92.3MB. Free memory was 34.0MB in the beginning and 61.2MB in the end (delta: -27.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-14 15:28:01,928 INFO L158 Benchmark]: RCFGBuilder took 999.41ms. Allocated memory was 92.3MB in the beginning and 148.9MB in the end (delta: 56.6MB). Free memory was 61.2MB in the beginning and 62.2MB in the end (delta: -1.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-10-14 15:28:01,928 INFO L158 Benchmark]: TraceAbstraction took 5836.54ms. Allocated memory was 148.9MB in the beginning and 184.5MB in the end (delta: 35.7MB). Free memory was 61.1MB in the beginning and 58.7MB in the end (delta: 2.3MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-10-14 15:28:01,928 INFO L158 Benchmark]: Witness Printer took 6.31ms. Allocated memory is still 184.5MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 15:28:01,929 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.13ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 40.4MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.22ms. Allocated memory is still 92.3MB. Free memory was 48.0MB in the beginning and 38.7MB in the end (delta: 9.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.84ms. Allocated memory is still 92.3MB. Free memory was 38.7MB in the beginning and 34.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.47ms. Allocated memory is still 92.3MB. Free memory was 34.0MB in the beginning and 61.2MB in the end (delta: -27.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * RCFGBuilder took 999.41ms. Allocated memory was 92.3MB in the beginning and 148.9MB in the end (delta: 56.6MB). Free memory was 61.2MB in the beginning and 62.2MB in the end (delta: -1.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5836.54ms. Allocated memory was 148.9MB in the beginning and 184.5MB in the end (delta: 35.7MB). Free memory was 61.1MB in the beginning and 58.7MB in the end (delta: 2.3MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 6.31ms. Allocated memory is still 184.5MB. Free memory is still 58.7MB. There was no memory consumed. 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}; [L2984] int ldv_retval_0 ; [L2985] int ldv_retval_1 ; [L2988] int ldv_retval_2 ; [L3356] int ldv_module_refcounter = 1; [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); [L3104] RET, EXPR ldv_init_zalloc(1472UL) [L3104] tmp = ldv_init_zalloc(1472UL) [L3105] iio_interrupt_trigger_driver_group1 = (struct platform_device *)tmp [L3300] RET ldv_platform_driver_init_2() [L3301] return (ldv_func_res); [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); [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); [L2678] RET, EXPR kmalloc(size, flags | 32768U) [L2678] tmp = kmalloc(size, flags | 32768U) [L2679] return (tmp); [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)={-9223370937343148032: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)={-9223370937343148032: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)={-9223370937343148032: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, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 783 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 783 mSDsluCounter, 2884 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1585 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1299 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=7, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1590 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 41/41 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-10-14 15:28:01,980 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