./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 15:26:30,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:26:30,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:26:30,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:26:30,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:26:30,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:26:30,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:26:30,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:26:30,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:26:30,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:26:30,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:26:30,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:26:30,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:26:30,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:26:30,383 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:26:30,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:26:30,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:26:30,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:26:30,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:26:30,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:26:30,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:26:30,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:26:30,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:26:30,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:26:30,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:26:30,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:26:30,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:26:30,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:26:30,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:26:30,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:26:30,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:26:30,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:26:30,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:26:30,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:26:30,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:26:30,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:26:30,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:26:30,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:26:30,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:26:30,390 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-clean/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-clean/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-11 15:26:30,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:26:30,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:26:30,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:26:30,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:26:30,675 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:26:30,676 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-11 15:26:32,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:26:32,529 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:26:32,530 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-11 15:26:32,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0841d46fc/b8e638ed0a1d458a9c76936bf5a86e29/FLAG71b233214 [2024-10-11 15:26:32,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0841d46fc/b8e638ed0a1d458a9c76936bf5a86e29 [2024-10-11 15:26:32,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:26:32,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:26:32,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:26:32,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:26:32,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:26:32,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:26:32" (1/1) ... [2024-10-11 15:26:32,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d302a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:32, skipping insertion in model container [2024-10-11 15:26:32,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:26:32" (1/1) ... [2024-10-11 15:26:32,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:26:33,275 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-11 15:26:33,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:26:33,327 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:26:33,446 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-11 15:26:33,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:26:33,485 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:26:33,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33 WrapperNode [2024-10-11 15:26:33,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:26:33,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:26:33,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:26:33,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:26:33,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,581 INFO L138 Inliner]: procedures = 88, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 596 [2024-10-11 15:26:33,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:26:33,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:26:33,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:26:33,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:26:33,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,693 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 15, 23]. 57 percent of accesses are in the largest equivalence class. The 29 initializations are split as follows [2, 4, 23]. The 4 writes are split as follows [0, 4, 0]. [2024-10-11 15:26:33,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:26:33,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:26:33,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:26:33,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:26:33,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (1/1) ... [2024-10-11 15:26:33,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:26:33,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:26:33,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:26:33,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:26:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:26:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2024-10-11 15:26:33,861 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2024-10-11 15:26:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2024-10-11 15:26:33,861 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2024-10-11 15:26:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:26:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:26:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:26:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2024-10-11 15:26:33,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2024-10-11 15:26:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:26:33,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:26:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:26:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:26:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:26:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-11 15:26:33,865 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-11 15:26:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:26:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:26:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:26:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:26:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:26:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2024-10-11 15:26:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2024-10-11 15:26:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-10-11 15:26:33,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-10-11 15:26:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:26:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-10-11 15:26:33,867 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-10-11 15:26:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:26:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:26:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:26:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:26:33,868 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:26:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2024-10-11 15:26:33,868 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2024-10-11 15:26:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:26:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:26:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:26:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:26:33,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:26:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2024-10-11 15:26:33,870 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2024-10-11 15:26:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:26:33,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:26:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:26:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:26:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:26:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:26:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2024-10-11 15:26:33,871 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2024-10-11 15:26:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:26:33,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:26:34,122 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:26:34,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:26:34,427 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:26:34,819 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2024-10-11 15:26:34,819 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:26:34,912 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:26:34,913 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 15:26:34,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:34 BoogieIcfgContainer [2024-10-11 15:26:34,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:26:34,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:26:34,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:26:34,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:26:34,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:26:32" (1/3) ... [2024-10-11 15:26:34,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3ca185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:34, skipping insertion in model container [2024-10-11 15:26:34,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:33" (2/3) ... [2024-10-11 15:26:34,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3ca185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:34, skipping insertion in model container [2024-10-11 15:26:34,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:34" (3/3) ... [2024-10-11 15:26:34,923 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-11 15:26:34,939 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:26:34,940 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:26:35,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:26:35,025 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;@1defcf2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:26:35,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:26:35,031 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-11 15:26:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 15:26:35,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:35,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:26:35,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:35,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1057273273, now seen corresponding path program 1 times [2024-10-11 15:26:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:35,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277098079] [2024-10-11 15:26:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:35,430 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-11 15:26:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277098079] [2024-10-11 15:26:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277098079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:35,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:35,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:26:35,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153511641] [2024-10-11 15:26:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:35,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:35,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:26:35,470 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-11 15:26:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:35,668 INFO L93 Difference]: Finished difference Result 485 states and 712 transitions. [2024-10-11 15:26:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:35,671 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-11 15:26:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:35,682 INFO L225 Difference]: With dead ends: 485 [2024-10-11 15:26:35,682 INFO L226 Difference]: Without dead ends: 305 [2024-10-11 15:26:35,690 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-11 15:26:35,696 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-11 15:26:35,697 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-11 15:26:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-11 15:26:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2024-10-11 15:26:35,791 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-11 15:26:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 416 transitions. [2024-10-11 15:26:35,801 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 416 transitions. Word has length 11 [2024-10-11 15:26:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:35,801 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 416 transitions. [2024-10-11 15:26:35,802 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-11 15:26:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 416 transitions. [2024-10-11 15:26:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 15:26:35,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:35,804 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-11 15:26:35,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:26:35,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1800264538, now seen corresponding path program 1 times [2024-10-11 15:26:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:35,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161251240] [2024-10-11 15:26:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:35,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 15:26:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:35,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:26:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:35,950 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-11 15:26:35,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:35,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161251240] [2024-10-11 15:26:35,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161251240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:35,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:35,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:26:35,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661087507] [2024-10-11 15:26:35,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:35,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:26:35,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:35,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:26:35,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:26:35,954 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-11 15:26:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:36,293 INFO L93 Difference]: Finished difference Result 320 states and 434 transitions. [2024-10-11 15:26:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:26:36,294 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-11 15:26:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:36,302 INFO L225 Difference]: With dead ends: 320 [2024-10-11 15:26:36,304 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 15:26:36,305 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-11 15:26:36,307 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 248 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:36,309 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.3s Time] [2024-10-11 15:26:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 15:26:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 302. [2024-10-11 15:26:36,343 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-11 15:26:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 415 transitions. [2024-10-11 15:26:36,347 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 415 transitions. Word has length 24 [2024-10-11 15:26:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:36,348 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 415 transitions. [2024-10-11 15:26:36,349 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-11 15:26:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 415 transitions. [2024-10-11 15:26:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 15:26:36,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:36,351 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-11 15:26:36,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:26:36,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:36,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:36,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1857522840, now seen corresponding path program 1 times [2024-10-11 15:26:36,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:36,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238597344] [2024-10-11 15:26:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:36,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 15:26:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:26:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,469 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-11 15:26:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238597344] [2024-10-11 15:26:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238597344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:36,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:36,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:26:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853584287] [2024-10-11 15:26:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:36,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:26:36,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:26:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:26:36,474 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-11 15:26:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:36,716 INFO L93 Difference]: Finished difference Result 608 states and 850 transitions. [2024-10-11 15:26:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:26:36,717 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-11 15:26:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:36,720 INFO L225 Difference]: With dead ends: 608 [2024-10-11 15:26:36,721 INFO L226 Difference]: Without dead ends: 305 [2024-10-11 15:26:36,723 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-11 15:26:36,725 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 233 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11 15:26:36,726 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-11 15:26:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-11 15:26:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 296. [2024-10-11 15:26:36,779 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-11 15:26:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 405 transitions. [2024-10-11 15:26:36,782 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 405 transitions. Word has length 24 [2024-10-11 15:26:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:36,782 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 405 transitions. [2024-10-11 15:26:36,782 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-11 15:26:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 405 transitions. [2024-10-11 15:26:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 15:26:36,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:36,785 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-11 15:26:36,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:26:36,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:36,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:36,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1991221876, now seen corresponding path program 1 times [2024-10-11 15:26:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:36,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19719938] [2024-10-11 15:26:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:26:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 15:26:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:26:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 15:26:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:26:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:36,940 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-11 15:26:36,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:36,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19719938] [2024-10-11 15:26:36,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19719938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:26:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112536829] [2024-10-11 15:26:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:36,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:26:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:36,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:26:36,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:26:36,942 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-11 15:26:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:37,493 INFO L93 Difference]: Finished difference Result 817 states and 1161 transitions. [2024-10-11 15:26:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:26:37,494 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-11 15:26:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:37,501 INFO L225 Difference]: With dead ends: 817 [2024-10-11 15:26:37,502 INFO L226 Difference]: Without dead ends: 522 [2024-10-11 15:26:37,503 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-11 15:26:37,504 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 275 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:37,506 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.4s Time] [2024-10-11 15:26:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-10-11 15:26:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 373. [2024-10-11 15:26:37,555 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-11 15:26:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 516 transitions. [2024-10-11 15:26:37,557 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 516 transitions. Word has length 40 [2024-10-11 15:26:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:37,558 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 516 transitions. [2024-10-11 15:26:37,558 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-11 15:26:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 516 transitions. [2024-10-11 15:26:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 15:26:37,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:37,561 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-11 15:26:37,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:26:37,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:37,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1930909387, now seen corresponding path program 1 times [2024-10-11 15:26:37,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:37,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300192548] [2024-10-11 15:26:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:37,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 15:26:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:26:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:37,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:26:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:37,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:26:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 15:26:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:37,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 15:26:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 15:26:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:37,804 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-11 15:26:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300192548] [2024-10-11 15:26:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300192548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:26:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264884614] [2024-10-11 15:26:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:37,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:26:37,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:26:37,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:26:37,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:26:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:38,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:26:38,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:38,133 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-11 15:26:38,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264884614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:38,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:26:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-10-11 15:26:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348410128] [2024-10-11 15:26:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:38,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:26:38,136 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-11 15:26:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:38,249 INFO L93 Difference]: Finished difference Result 1077 states and 1490 transitions. [2024-10-11 15:26:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:38,250 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-11 15:26:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:38,254 INFO L225 Difference]: With dead ends: 1077 [2024-10-11 15:26:38,254 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 15:26:38,256 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-11 15:26:38,256 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:38,257 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.1s Time] [2024-10-11 15:26:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 15:26:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 701. [2024-10-11 15:26:38,316 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-11 15:26:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 968 transitions. [2024-10-11 15:26:38,320 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 968 transitions. Word has length 58 [2024-10-11 15:26:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:38,321 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 968 transitions. [2024-10-11 15:26:38,321 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-11 15:26:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 968 transitions. [2024-10-11 15:26:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 15:26:38,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:38,325 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-11 15:26:38,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 15:26:38,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:26:38,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:38,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1590495583, now seen corresponding path program 1 times [2024-10-11 15:26:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:38,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278015934] [2024-10-11 15:26:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:38,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 15:26:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:26:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:26:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 15:26:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:38,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 15:26:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:38,906 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-11 15:26:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278015934] [2024-10-11 15:26:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278015934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:26:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548573342] [2024-10-11 15:26:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:38,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:26:38,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:26:38,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:26:38,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:26:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:39,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 15:26:39,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:39,206 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-11 15:26:39,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:39,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548573342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:39,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:26:39,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 15:26:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240028536] [2024-10-11 15:26:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:39,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:39,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:26:39,209 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-11 15:26:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:39,329 INFO L93 Difference]: Finished difference Result 1401 states and 1939 transitions. [2024-10-11 15:26:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:39,329 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-11 15:26:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:39,336 INFO L225 Difference]: With dead ends: 1401 [2024-10-11 15:26:39,336 INFO L226 Difference]: Without dead ends: 701 [2024-10-11 15:26:39,338 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-11 15:26:39,339 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-11 15:26:39,339 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-11 15:26:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-11 15:26:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-10-11 15:26:39,410 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-11 15:26:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 964 transitions. [2024-10-11 15:26:39,414 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 964 transitions. Word has length 62 [2024-10-11 15:26:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:39,415 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 964 transitions. [2024-10-11 15:26:39,415 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-11 15:26:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 964 transitions. [2024-10-11 15:26:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 15:26:39,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:39,421 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-11 15:26:39,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 15:26:39,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:26:39,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:39,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:39,623 INFO L85 PathProgramCache]: Analyzing trace with hash -173908254, now seen corresponding path program 1 times [2024-10-11 15:26:39,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:39,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290229815] [2024-10-11 15:26:39,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:39,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 15:26:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:26:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:26:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:39,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 15:26:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:26:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:39,954 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-11 15:26:39,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:39,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290229815] [2024-10-11 15:26:39,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290229815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:26:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231289950] [2024-10-11 15:26:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:39,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:26:39,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:26:39,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:26:39,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 15:26:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:40,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 15:26:40,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 15:26:40,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231289950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:40,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:26:40,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-11 15:26:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595540199] [2024-10-11 15:26:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:40,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:26:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:26:40,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:26:40,260 INFO L87 Difference]: Start difference. First operand 701 states and 964 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-11 15:26:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:40,382 INFO L93 Difference]: Finished difference Result 1417 states and 1959 transitions. [2024-10-11 15:26:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:26:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-11 15:26:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:40,387 INFO L225 Difference]: With dead ends: 1417 [2024-10-11 15:26:40,387 INFO L226 Difference]: Without dead ends: 717 [2024-10-11 15:26:40,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:26:40,389 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:40,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 747 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:26:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-11 15:26:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-10-11 15:26:40,435 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-11 15:26:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 988 transitions. [2024-10-11 15:26:40,438 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 988 transitions. Word has length 64 [2024-10-11 15:26:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:40,439 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 988 transitions. [2024-10-11 15:26:40,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-11 15:26:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 988 transitions. [2024-10-11 15:26:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 15:26:40,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:40,441 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-11 15:26:40,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 15:26:40,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:26:40,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:40,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1696531790, now seen corresponding path program 1 times [2024-10-11 15:26:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600422033] [2024-10-11 15:26:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 15:26:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:26:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:40,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:26:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 15:26:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:26:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:26:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 15:26:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600422033] [2024-10-11 15:26:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600422033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:26:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392210496] [2024-10-11 15:26:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:40,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:26:40,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:26:40,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:26:40,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 15:26:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:41,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 15:26:41,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 15:26:41,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:41,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392210496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:41,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:26:41,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-10-11 15:26:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080433136] [2024-10-11 15:26:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:41,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:26:41,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:26:41,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:26:41,257 INFO L87 Difference]: Start difference. First operand 717 states and 988 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-11 15:26:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:41,406 INFO L93 Difference]: Finished difference Result 1441 states and 1991 transitions. [2024-10-11 15:26:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:26:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-11 15:26:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:41,412 INFO L225 Difference]: With dead ends: 1441 [2024-10-11 15:26:41,412 INFO L226 Difference]: Without dead ends: 725 [2024-10-11 15:26:41,414 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-11 15:26:41,416 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 15:26:41,417 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-11 15:26:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-11 15:26:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2024-10-11 15:26:41,482 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-11 15:26:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 996 transitions. [2024-10-11 15:26:41,486 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 996 transitions. Word has length 70 [2024-10-11 15:26:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:41,486 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 996 transitions. [2024-10-11 15:26:41,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-11 15:26:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 996 transitions. [2024-10-11 15:26:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 15:26:41,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:41,491 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-11 15:26:41,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 15:26:41,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 15:26:41,696 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:41,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash -958289182, now seen corresponding path program 2 times [2024-10-11 15:26:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055531031] [2024-10-11 15:26:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 15:26:41,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 15:26:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 15:26:41,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 15:26:41,921 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 15:26:41,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 15:26:41,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 15:26:41,926 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:26:42,056 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 15:26:42,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:26:42 BoogieIcfgContainer [2024-10-11 15:26:42,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 15:26:42,059 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 15:26:42,059 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 15:26:42,059 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 15:26:42,060 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:34" (3/4) ... [2024-10-11 15:26:42,062 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 15:26:42,063 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 15:26:42,064 INFO L158 Benchmark]: Toolchain (without parser) took 9469.97ms. Allocated memory was 146.8MB in the beginning and 381.7MB in the end (delta: 234.9MB). Free memory was 83.9MB in the beginning and 205.1MB in the end (delta: -121.2MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2024-10-11 15:26:42,064 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:26:42,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 891.43ms. Allocated memory was 146.8MB in the beginning and 239.1MB in the end (delta: 92.3MB). Free memory was 83.6MB in the beginning and 168.5MB in the end (delta: -84.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-11 15:26:42,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.44ms. Allocated memory is still 239.1MB. Free memory was 168.5MB in the beginning and 164.2MB in the end (delta: 4.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 15:26:42,066 INFO L158 Benchmark]: Boogie Preprocessor took 178.73ms. Allocated memory is still 239.1MB. Free memory was 164.2MB in the beginning and 154.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 15:26:42,066 INFO L158 Benchmark]: RCFGBuilder took 1148.09ms. Allocated memory is still 239.1MB. Free memory was 153.8MB in the beginning and 148.3MB in the end (delta: 5.5MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-10-11 15:26:42,067 INFO L158 Benchmark]: TraceAbstraction took 7143.17ms. Allocated memory was 239.1MB in the beginning and 381.7MB in the end (delta: 142.6MB). Free memory was 147.3MB in the beginning and 205.1MB in the end (delta: -57.9MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2024-10-11 15:26:42,067 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 381.7MB. Free memory is still 205.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:26:42,069 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.19ms. Allocated memory is still 146.8MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 891.43ms. Allocated memory was 146.8MB in the beginning and 239.1MB in the end (delta: 92.3MB). Free memory was 83.6MB in the beginning and 168.5MB in the end (delta: -84.9MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.44ms. Allocated memory is still 239.1MB. Free memory was 168.5MB in the beginning and 164.2MB in the end (delta: 4.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.73ms. Allocated memory is still 239.1MB. Free memory was 164.2MB in the beginning and 154.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1148.09ms. Allocated memory is still 239.1MB. Free memory was 153.8MB in the beginning and 148.3MB in the end (delta: 5.5MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7143.17ms. Allocated memory was 239.1MB in the beginning and 381.7MB in the end (delta: 142.6MB). Free memory was 147.3MB in the beginning and 205.1MB in the end (delta: -57.9MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 381.7MB. Free memory is still 205.1MB. 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq=-2, irqflags=128, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={-(((__int128) 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={4294967295:4294967297}, iio_interrupt_trigger_driver={7:0}, iio_interrupt_trigger_driver_group1={-(((__int128) 1 << 64) | 1):0}, iio_interrupt_trigger_ops={6:0}, irq=-2, irqflags=128, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, pdev={-(((__int128) 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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={4294967295:4294967297}, 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: 6.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1163 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1126 mSDsluCounter, 3541 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2149 mSDsCounter, 253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 879 IncrementalHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 253 mSolverCounterUnsat, 1392 mSDtfsCounter, 879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s 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.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 178 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 683 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2265 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 95/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-11 15:26:42,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 15:26:44,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:26:44,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 15:26:44,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:26:44,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:26:44,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:26:44,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:26:44,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:26:44,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:26:44,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:26:44,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:26:44,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:26:44,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:26:44,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:26:44,601 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:26:44,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:26:44,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:26:44,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:26:44,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:26:44,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:26:44,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:26:44,607 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 15:26:44,607 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 15:26:44,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:26:44,608 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 15:26:44,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:26:44,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:26:44,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:26:44,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:26:44,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:26:44,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:26:44,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:26:44,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:26:44,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:26:44,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:26:44,612 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 15:26:44,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 15:26:44,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:26:44,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:26:44,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:26:44,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:26:44,614 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 15:26:44,615 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-clean/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-clean/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-11 15:26:44,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:26:44,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:26:44,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:26:44,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:26:44,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:26:44,990 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-11 15:26:46,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:26:47,022 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:26:47,023 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-11 15:26:47,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d5ee74eff/2bb8b1cd592e4b0db9c36e3a5f7193ce/FLAGc12545c22 [2024-10-11 15:26:47,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d5ee74eff/2bb8b1cd592e4b0db9c36e3a5f7193ce [2024-10-11 15:26:47,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:26:47,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:26:47,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:26:47,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:26:47,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:26:47,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:26:47" (1/1) ... [2024-10-11 15:26:47,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491c6709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:47, skipping insertion in model container [2024-10-11 15:26:47,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:26:47" (1/1) ... [2024-10-11 15:26:47,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:26:47,772 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-11 15:26:47,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:26:47,829 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 15:26:47,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:26:47,960 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-11 15:26:47,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:26:47,972 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:26:48,090 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-11 15:26:48,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:26:48,145 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:26:48,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48 WrapperNode [2024-10-11 15:26:48,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:26:48,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:26:48,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:26:48,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:26:48,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,225 INFO L138 Inliner]: procedures = 93, calls = 129, calls flagged for inlining = 41, calls inlined = 36, statements flattened = 555 [2024-10-11 15:26:48,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:26:48,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:26:48,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:26:48,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:26:48,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,315 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-11 15:26:48,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:26:48,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:26:48,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:26:48,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:26:48,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (1/1) ... [2024-10-11 15:26:48,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:26:48,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:26:48,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:26:48,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:26:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:26:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2024-10-11 15:26:48,478 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2024-10-11 15:26:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2024-10-11 15:26:48,479 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2024-10-11 15:26:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:26:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:26:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:26:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2024-10-11 15:26:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2024-10-11 15:26:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2024-10-11 15:26:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2024-10-11 15:26:48,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2024-10-11 15:26:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 15:26:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 15:26:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 15:26:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:26:48,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:26:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-11 15:26:48,482 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-11 15:26:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:26:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:26:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:26:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:26:48,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:26:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2024-10-11 15:26:48,483 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2024-10-11 15:26:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-10-11 15:26:48,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-10-11 15:26:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:26:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 15:26:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 15:26:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 15:26:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-10-11 15:26:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-10-11 15:26:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:26:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:26:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:26:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:26:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:26:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2024-10-11 15:26:48,485 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2024-10-11 15:26:48,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 15:26:48,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 15:26:48,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 15:26:48,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 15:26:48,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 15:26:48,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 15:26:48,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:26:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:26:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2024-10-11 15:26:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2024-10-11 15:26:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:26:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:26:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:26:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2024-10-11 15:26:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2024-10-11 15:26:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:26:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:26:48,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:26:48,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:26:49,202 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:26:49,582 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2024-10-11 15:26:49,583 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:26:49,698 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:26:49,698 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 15:26:49,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:49 BoogieIcfgContainer [2024-10-11 15:26:49,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:26:49,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:26:49,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:26:49,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:26:49,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:26:47" (1/3) ... [2024-10-11 15:26:49,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b29a0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:49, skipping insertion in model container [2024-10-11 15:26:49,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:26:48" (2/3) ... [2024-10-11 15:26:49,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b29a0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:49, skipping insertion in model container [2024-10-11 15:26:49,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:49" (3/3) ... [2024-10-11 15:26:49,707 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-11 15:26:49,728 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:26:49,728 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:26:49,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:26:49,815 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;@2609544c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:26:49,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:26:49,821 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-11 15:26:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 15:26:49,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:49,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:26:49,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:49,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 659070431, now seen corresponding path program 1 times [2024-10-11 15:26:49,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:49,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64060535] [2024-10-11 15:26:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:49,845 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-11 15:26:49,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:49,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 15:26:49,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:50,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:26:50,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:50,125 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-11 15:26:50,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:50,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:50,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64060535] [2024-10-11 15:26:50,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64060535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:26:50,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970665000] [2024-10-11 15:26:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:50,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:50,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:26:50,161 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-11 15:26:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:50,518 INFO L93 Difference]: Finished difference Result 461 states and 676 transitions. [2024-10-11 15:26:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:50,520 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-11 15:26:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:50,530 INFO L225 Difference]: With dead ends: 461 [2024-10-11 15:26:50,530 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 15:26:50,534 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-11 15:26:50,540 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 204 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:50,542 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.3s Time] [2024-10-11 15:26:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 15:26:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2024-10-11 15:26:50,601 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-11 15:26:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 396 transitions. [2024-10-11 15:26:50,608 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 396 transitions. Word has length 11 [2024-10-11 15:26:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:50,609 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 396 transitions. [2024-10-11 15:26:50,610 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-11 15:26:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 396 transitions. [2024-10-11 15:26:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 15:26:50,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:50,615 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-11 15:26:50,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:50,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 15:26:50,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:50,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1267116966, now seen corresponding path program 1 times [2024-10-11 15:26:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:50,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475537197] [2024-10-11 15:26:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:50,818 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-11 15:26:50,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:50,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 15:26:50,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:51,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:26:51,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:51,090 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-11 15:26:51,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:51,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:51,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475537197] [2024-10-11 15:26:51,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475537197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:51,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:51,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 15:26:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387229136] [2024-10-11 15:26:51,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:51,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:51,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:26:51,095 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-11 15:26:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:51,259 INFO L93 Difference]: Finished difference Result 296 states and 404 transitions. [2024-10-11 15:26:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:51,260 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-11 15:26:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:51,264 INFO L225 Difference]: With dead ends: 296 [2024-10-11 15:26:51,266 INFO L226 Difference]: Without dead ends: 291 [2024-10-11 15:26:51,266 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-11 15:26:51,267 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-11 15:26:51,268 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-11 15:26:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-11 15:26:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 286. [2024-10-11 15:26:51,321 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-11 15:26:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 395 transitions. [2024-10-11 15:26:51,324 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 395 transitions. Word has length 24 [2024-10-11 15:26:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:51,325 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 395 transitions. [2024-10-11 15:26:51,326 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-11 15:26:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 395 transitions. [2024-10-11 15:26:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 15:26:51,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:51,328 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-11 15:26:51,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:51,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 15:26:51,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:51,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1209858664, now seen corresponding path program 1 times [2024-10-11 15:26:51,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:51,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224600094] [2024-10-11 15:26:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:51,531 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-11 15:26:51,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:51,534 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 15:26:51,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:51,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:26:51,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:51,762 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-11 15:26:51,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:51,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224600094] [2024-10-11 15:26:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224600094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:51,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:26:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252615784] [2024-10-11 15:26:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:51,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:51,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:26:51,765 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-11 15:26:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:51,930 INFO L93 Difference]: Finished difference Result 568 states and 798 transitions. [2024-10-11 15:26:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:51,933 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-11 15:26:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:51,937 INFO L225 Difference]: With dead ends: 568 [2024-10-11 15:26:51,937 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 15:26:51,938 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-11 15:26:51,939 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-11 15:26:51,943 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-11 15:26:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 15:26:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2024-10-11 15:26:51,976 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-11 15:26:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2024-10-11 15:26:51,978 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 24 [2024-10-11 15:26:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2024-10-11 15:26:51,979 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-11 15:26:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2024-10-11 15:26:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 15:26:51,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:51,985 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-11 15:26:51,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:52,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 15:26:52,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:52,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:52,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1091813748, now seen corresponding path program 1 times [2024-10-11 15:26:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:52,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113428399] [2024-10-11 15:26:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:52,187 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-11 15:26:52,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:52,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 15:26:52,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:52,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:26:52,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:52,444 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-11 15:26:52,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:52,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:52,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113428399] [2024-10-11 15:26:52,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113428399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:52,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:52,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:26:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026204494] [2024-10-11 15:26:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:52,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:52,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:26:52,449 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-11 15:26:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:52,699 INFO L93 Difference]: Finished difference Result 637 states and 883 transitions. [2024-10-11 15:26:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:52,700 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-11 15:26:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:52,703 INFO L225 Difference]: With dead ends: 637 [2024-10-11 15:26:52,703 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 15:26:52,704 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-11 15:26:52,704 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 52 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11 15:26:52,705 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-11 15:26:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 15:26:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2024-10-11 15:26:52,731 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-11 15:26:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 496 transitions. [2024-10-11 15:26:52,734 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 496 transitions. Word has length 40 [2024-10-11 15:26:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:52,734 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 496 transitions. [2024-10-11 15:26:52,734 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-11 15:26:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 496 transitions. [2024-10-11 15:26:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 15:26:52,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:52,737 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-11 15:26:52,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 15:26:52,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 15:26:52,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:52,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1562901392, now seen corresponding path program 1 times [2024-10-11 15:26:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120609062] [2024-10-11 15:26:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:52,939 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-11 15:26:52,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:52,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 15:26:52,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:53,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:26:53,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:53,247 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-11 15:26:53,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:53,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120609062] [2024-10-11 15:26:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120609062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:53,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:26:53,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463700168] [2024-10-11 15:26:53,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:53,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:53,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:26:53,250 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-11 15:26:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:53,514 INFO L93 Difference]: Finished difference Result 1029 states and 1430 transitions. [2024-10-11 15:26:53,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:53,515 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-11 15:26:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:53,520 INFO L225 Difference]: With dead ends: 1029 [2024-10-11 15:26:53,520 INFO L226 Difference]: Without dead ends: 673 [2024-10-11 15:26:53,521 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-11 15:26:53,523 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 143 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11 15:26:53,523 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-11 15:26:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-11 15:26:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 669. [2024-10-11 15:26:53,582 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-11 15:26:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 928 transitions. [2024-10-11 15:26:53,587 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 928 transitions. Word has length 59 [2024-10-11 15:26:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:53,587 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 928 transitions. [2024-10-11 15:26:53,587 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-11 15:26:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 928 transitions. [2024-10-11 15:26:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 15:26:53,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:53,590 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-11 15:26:53,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:53,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 15:26:53,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:53,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1882975602, now seen corresponding path program 1 times [2024-10-11 15:26:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030598356] [2024-10-11 15:26:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:53,793 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-11 15:26:53,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:53,796 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 15:26:53,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:54,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 15:26:54,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:54,114 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-11 15:26:54,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:54,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:54,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030598356] [2024-10-11 15:26:54,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030598356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:54,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:54,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:26:54,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476138720] [2024-10-11 15:26:54,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:54,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:26:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:26:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:26:54,117 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-11 15:26:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:54,580 INFO L93 Difference]: Finished difference Result 1353 states and 1887 transitions. [2024-10-11 15:26:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:26:54,581 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-11 15:26:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:54,586 INFO L225 Difference]: With dead ends: 1353 [2024-10-11 15:26:54,586 INFO L226 Difference]: Without dead ends: 685 [2024-10-11 15:26:54,588 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-11 15:26:54,588 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:54,589 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.4s Time] [2024-10-11 15:26:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-10-11 15:26:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2024-10-11 15:26:54,635 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-11 15:26:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 952 transitions. [2024-10-11 15:26:54,639 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 952 transitions. Word has length 58 [2024-10-11 15:26:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:54,640 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 952 transitions. [2024-10-11 15:26:54,640 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-11 15:26:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 952 transitions. [2024-10-11 15:26:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 15:26:54,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:54,643 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-11 15:26:54,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 15:26:54,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 15:26:54,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:54,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1838102686, now seen corresponding path program 1 times [2024-10-11 15:26:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387402081] [2024-10-11 15:26:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:54,849 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-11 15:26:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:54,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 15:26:54,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:55,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 15:26:55,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:55,179 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-11 15:26:55,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:55,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387402081] [2024-10-11 15:26:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387402081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:26:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254788196] [2024-10-11 15:26:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:55,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:26:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:26:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:26:55,184 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-11 15:26:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:55,628 INFO L93 Difference]: Finished difference Result 1377 states and 1919 transitions. [2024-10-11 15:26:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:26:55,629 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-11 15:26:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:55,635 INFO L225 Difference]: With dead ends: 1377 [2024-10-11 15:26:55,635 INFO L226 Difference]: Without dead ends: 693 [2024-10-11 15:26:55,637 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-11 15:26:55,639 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:55,639 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.4s Time] [2024-10-11 15:26:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-11 15:26:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-11 15:26:55,686 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-11 15:26:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 960 transitions. [2024-10-11 15:26:55,690 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 960 transitions. Word has length 64 [2024-10-11 15:26:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:55,691 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 960 transitions. [2024-10-11 15:26:55,691 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-11 15:26:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 960 transitions. [2024-10-11 15:26:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 15:26:55,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:55,693 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-11 15:26:55,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:55,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-11 15:26:55,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:55,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:55,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1411163378, now seen corresponding path program 2 times [2024-10-11 15:26:55,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350463820] [2024-10-11 15:26:55,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 15:26:55,895 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-11 15:26:55,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:55,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 15:26:55,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:56,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 15:26:56,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 15:26:56,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 15:26:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 15:26:56,799 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 15:26:56,800 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 15:26:56,801 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 15:26:56,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 15:26:57,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-11 15:26:57,006 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-11 15:26:57,149 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 15:26:57,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:26:57 BoogieIcfgContainer [2024-10-11 15:26:57,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 15:26:57,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 15:26:57,153 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 15:26:57,153 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 15:26:57,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:49" (3/4) ... [2024-10-11 15:26:57,155 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 15:26:57,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 15:26:57,157 INFO L158 Benchmark]: Toolchain (without parser) took 10078.61ms. Allocated memory was 71.3MB in the beginning and 167.8MB in the end (delta: 96.5MB). Free memory was 38.3MB in the beginning and 118.9MB in the end (delta: -80.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-11 15:26:57,157 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 58.7MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:26:57,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1065.41ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 38.0MB in the beginning and 38.2MB in the end (delta: -227.5kB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-11 15:26:57,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.20ms. Allocated memory is still 86.0MB. Free memory was 38.2MB in the beginning and 33.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 15:26:57,158 INFO L158 Benchmark]: Boogie Preprocessor took 152.85ms. Allocated memory is still 86.0MB. Free memory was 33.7MB in the beginning and 51.6MB in the end (delta: -17.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-11 15:26:57,159 INFO L158 Benchmark]: RCFGBuilder took 1315.05ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 51.6MB in the beginning and 61.8MB in the end (delta: -10.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-10-11 15:26:57,159 INFO L158 Benchmark]: TraceAbstraction took 7450.94ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 61.1MB in the beginning and 118.9MB in the end (delta: -57.8MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2024-10-11 15:26:57,160 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 167.8MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:26:57,162 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.27ms. Allocated memory is still 58.7MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1065.41ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 38.0MB in the beginning and 38.2MB in the end (delta: -227.5kB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.20ms. Allocated memory is still 86.0MB. Free memory was 38.2MB in the beginning and 33.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 152.85ms. Allocated memory is still 86.0MB. Free memory was 33.7MB in the beginning and 51.6MB in the end (delta: -17.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1315.05ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 51.6MB in the beginning and 61.8MB in the end (delta: -10.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7450.94ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 61.1MB in the beginning and 118.9MB in the end (delta: -57.8MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 167.8MB. Free memory is still 118.9MB. 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: 7.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 783 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 783 mSDsluCounter, 2884 SdHoareTripleChecker+Invalid, 1.5s 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, 1.0s SatisfiabilityAnalysisTime, 0.4s 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-11 15:26:57,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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