./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 07:29:28,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:29:28,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:29:28,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:29:28,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:29:28,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:29:28,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:29:28,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:29:28,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:29:28,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:29:28,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:29:28,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:29:28,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:29:28,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:29:28,202 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:29:28,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:29:28,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:29:28,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:29:28,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:29:28,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:29:28,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:29:28,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:29:28,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:29:28,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:29:28,204 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:29:28,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:29:28,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:29:28,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:29:28,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:29:28,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:29:28,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:29:28,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:29:28,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2025-03-17 07:29:28,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:29:28,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:29:28,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:29:28,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:29:28,486 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:29:28,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-17 07:29:29,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d8ebf86/fc183d0594b54e06bfb71e670e8feca4/FLAG81f58bf12 [2025-03-17 07:29:30,043 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:29:30,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-17 07:29:30,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d8ebf86/fc183d0594b54e06bfb71e670e8feca4/FLAG81f58bf12 [2025-03-17 07:29:30,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d8ebf86/fc183d0594b54e06bfb71e670e8feca4 [2025-03-17 07:29:30,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:29:30,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:29:30,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:29:30,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:29:30,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:29:30,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:30,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f06c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30, skipping insertion in model container [2025-03-17 07:29:30,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:30,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:29:30,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-03-17 07:29:30,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:29:30,726 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:29:30,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-03-17 07:29:30,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:29:30,943 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:29:30,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30 WrapperNode [2025-03-17 07:29:30,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:29:30,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:29:30,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:29:30,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:29:30,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:30,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,013 INFO L138 Inliner]: procedures = 78, calls = 266, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 1011 [2025-03-17 07:29:31,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:29:31,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:29:31,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:29:31,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:29:31,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,088 INFO L175 MemorySlicer]: Split 160 memory accesses to 6 slices as follows [2, 42, 6, 8, 20, 82]. 51 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 0, 6, 8, 1, 6]. The 103 writes are split as follows [0, 42, 0, 0, 19, 42]. [2025-03-17 07:29:31,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,120 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:29:31,149 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:29:31,149 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:29:31,149 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:29:31,150 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (1/1) ... [2025-03-17 07:29:31,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:29:31,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:29:31,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 07:29:31,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2025-03-17 07:29:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-17 07:29:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-03-17 07:29:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2025-03-17 07:29:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 07:29:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-17 07:29:31,191 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-17 07:29:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 07:29:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-17 07:29:31,192 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 07:29:31,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 07:29:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 07:29:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:29:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:29:31,395 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:29:31,396 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:29:31,459 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4257: havoc usb_register_driver_#t~nondet120#1; [2025-03-17 07:29:31,466 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc #t~ret114.base, #t~ret114.offset; [2025-03-17 07:29:31,504 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4204: havoc #t~malloc112.base, #t~malloc112.offset; [2025-03-17 07:29:31,514 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4214: havoc #t~nondet115; [2025-03-17 07:29:31,520 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4243: havoc #t~nondet118; [2025-03-17 07:29:31,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4207: havoc __kmalloc_#t~ret113#1.base, __kmalloc_#t~ret113#1.offset; [2025-03-17 07:29:31,552 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-03-17 07:29:31,562 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4239: havoc #t~ret117.base, #t~ret117.offset; [2025-03-17 07:29:36,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: havoc strlcat_#t~nondet119#1; [2025-03-17 07:29:36,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3513: havoc input_allocate_device_#t~ret28#1.base, input_allocate_device_#t~ret28#1.offset; [2025-03-17 07:29:36,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4001: assume false; [2025-03-17 07:29:36,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4001: assume !false; [2025-03-17 07:29:36,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4224: havoc input_register_device_#t~nondet116#1; [2025-03-17 07:29:36,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3509: havoc __create_pipe_#t~mem26#1;havoc __create_pipe_#t~bitwise27#1; [2025-03-17 07:29:36,317 INFO L? ?]: Removed 241 outVars from TransFormulas that were not future-live. [2025-03-17 07:29:36,317 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:29:36,345 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:29:36,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:29:36,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:29:36 BoogieIcfgContainer [2025-03-17 07:29:36,348 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:29:36,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:29:36,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:29:36,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:29:36,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:29:30" (1/3) ... [2025-03-17 07:29:36,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccc465b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:29:36, skipping insertion in model container [2025-03-17 07:29:36,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:30" (2/3) ... [2025-03-17 07:29:36,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccc465b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:29:36, skipping insertion in model container [2025-03-17 07:29:36,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:29:36" (3/3) ... [2025-03-17 07:29:36,355 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-03-17 07:29:36,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:29:36,367 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i that has 16 procedures, 187 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-17 07:29:36,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:29:36,412 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;@5801e9c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:29:36,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:29:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 142 states have (on average 1.3591549295774648) internal successors, (193), 148 states have internal predecessors, (193), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 07:29:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 07:29:36,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:29:36,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:29:36,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:29:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:29:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1762169147, now seen corresponding path program 1 times [2025-03-17 07:29:36,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:29:36,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855138906] [2025-03-17 07:29:36,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:29:37,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 07:29:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 07:29:37,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:29:37,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:29:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:29:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:29:37,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855138906] [2025-03-17 07:29:37,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855138906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:29:37,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:29:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 07:29:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886743081] [2025-03-17 07:29:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:29:37,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 07:29:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:29:37,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 07:29:37,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:29:37,983 INFO L87 Difference]: Start difference. First operand has 186 states, 142 states have (on average 1.3591549295774648) internal successors, (193), 148 states have internal predecessors, (193), 30 states have call successors, (30), 15 states have call predecessors, (30), 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.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 07:29:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:29:38,160 INFO L93 Difference]: Finished difference Result 513 states and 716 transitions. [2025-03-17 07:29:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 07:29:38,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-17 07:29:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:29:38,172 INFO L225 Difference]: With dead ends: 513 [2025-03-17 07:29:38,172 INFO L226 Difference]: Without dead ends: 333 [2025-03-17 07:29:38,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:29:38,178 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 222 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:29:38,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 477 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:29:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-17 07:29:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2025-03-17 07:29:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 254 states have (on average 1.2834645669291338) internal successors, (326), 258 states have internal predecessors, (326), 50 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 07:29:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 422 transitions. [2025-03-17 07:29:38,239 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 422 transitions. Word has length 14 [2025-03-17 07:29:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:29:38,239 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 422 transitions. [2025-03-17 07:29:38,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 07:29:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 422 transitions. [2025-03-17 07:29:38,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 07:29:38,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:29:38,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:29:38,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 07:29:38,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:29:38,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:29:38,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1207093420, now seen corresponding path program 1 times [2025-03-17 07:29:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:29:38,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153103308] [2025-03-17 07:29:38,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:29:39,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 07:29:39,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 07:29:39,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:29:39,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:29:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:29:39,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:29:39,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153103308] [2025-03-17 07:29:39,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153103308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:29:39,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:29:39,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 07:29:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022479860] [2025-03-17 07:29:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:29:39,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 07:29:39,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:29:39,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 07:29:39,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:29:39,276 INFO L87 Difference]: Start difference. First operand 329 states and 422 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 07:29:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:29:39,430 INFO L93 Difference]: Finished difference Result 954 states and 1233 transitions. [2025-03-17 07:29:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 07:29:39,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 07:29:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:29:39,439 INFO L225 Difference]: With dead ends: 954 [2025-03-17 07:29:39,439 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 07:29:39,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:29:39,442 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 213 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:29:39,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 488 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:29:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 07:29:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 626. [2025-03-17 07:29:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 487 states have (on average 1.2792607802874743) internal successors, (623), 490 states have internal predecessors, (623), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-17 07:29:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 805 transitions. [2025-03-17 07:29:39,485 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 805 transitions. Word has length 15 [2025-03-17 07:29:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:29:39,486 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 805 transitions. [2025-03-17 07:29:39,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 07:29:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 805 transitions. [2025-03-17 07:29:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 07:29:39,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:29:39,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:29:39,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:29:39,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:29:39,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:29:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1560735706, now seen corresponding path program 1 times [2025-03-17 07:29:39,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:29:39,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495983464] [2025-03-17 07:29:39,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:39,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:29:40,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 07:29:40,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 07:29:40,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:29:40,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:29:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:29:40,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:29:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495983464] [2025-03-17 07:29:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495983464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:29:40,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:29:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 07:29:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872034147] [2025-03-17 07:29:40,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:29:40,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 07:29:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:29:40,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 07:29:40,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:29:40,609 INFO L87 Difference]: Start difference. First operand 626 states and 805 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 07:29:44,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:29:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:29:44,812 INFO L93 Difference]: Finished difference Result 1281 states and 1665 transitions. [2025-03-17 07:29:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 07:29:44,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-17 07:29:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:29:44,816 INFO L225 Difference]: With dead ends: 1281 [2025-03-17 07:29:44,817 INFO L226 Difference]: Without dead ends: 669 [2025-03-17 07:29:44,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:29:44,819 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 98 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:29:44,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 321 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 07:29:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-17 07:29:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 657. [2025-03-17 07:29:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 518 states have (on average 1.2837837837837838) internal successors, (665), 521 states have internal predecessors, (665), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-17 07:29:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 847 transitions. [2025-03-17 07:29:44,854 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 847 transitions. Word has length 44 [2025-03-17 07:29:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:29:44,854 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 847 transitions. [2025-03-17 07:29:44,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 07:29:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 847 transitions. [2025-03-17 07:29:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 07:29:44,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:29:44,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 07:29:44,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 07:29:44,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:29:44,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:29:44,857 INFO L85 PathProgramCache]: Analyzing trace with hash 643031119, now seen corresponding path program 1 times [2025-03-17 07:29:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:29:44,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608549186] [2025-03-17 07:29:44,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:44,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:29:45,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 07:29:45,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 07:29:45,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:29:45,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:29:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 07:29:46,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:29:46,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608549186] [2025-03-17 07:29:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608549186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:29:46,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524879973] [2025-03-17 07:29:46,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:46,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:29:46,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:29:46,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:29:46,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 07:29:47,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 07:29:47,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 07:29:47,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:29:47,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:29:47,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 07:29:47,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:29:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 07:29:47,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:29:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524879973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:29:47,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:29:47,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-03-17 07:29:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224404265] [2025-03-17 07:29:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:29:47,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:29:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:29:47,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:29:47,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:29:47,800 INFO L87 Difference]: Start difference. First operand 657 states and 847 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 07:29:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:29:47,903 INFO L93 Difference]: Finished difference Result 1078 states and 1386 transitions. [2025-03-17 07:29:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:29:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-03-17 07:29:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:29:47,906 INFO L225 Difference]: With dead ends: 1078 [2025-03-17 07:29:47,906 INFO L226 Difference]: Without dead ends: 436 [2025-03-17 07:29:47,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:29:47,908 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:29:47,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 627 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:29:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-17 07:29:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-17 07:29:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 339 states have (on average 1.2684365781710913) internal successors, (430), 342 states have internal predecessors, (430), 63 states have call successors, (63), 34 states have call predecessors, (63), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 07:29:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 552 transitions. [2025-03-17 07:29:47,922 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 552 transitions. Word has length 80 [2025-03-17 07:29:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:29:47,922 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 552 transitions. [2025-03-17 07:29:47,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 07:29:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 552 transitions. [2025-03-17 07:29:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 07:29:47,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:29:47,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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] [2025-03-17 07:29:47,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 07:29:48,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:29:48,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:29:48,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:29:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1352316314, now seen corresponding path program 1 times [2025-03-17 07:29:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:29:48,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743787592] [2025-03-17 07:29:48,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:29:48,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 07:29:48,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 07:29:48,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:29:48,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:29:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 07:29:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:29:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743787592] [2025-03-17 07:29:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743787592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:29:49,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:29:49,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:29:49,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219073502] [2025-03-17 07:29:49,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:29:49,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:29:49,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:29:49,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:29:49,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:29:49,278 INFO L87 Difference]: Start difference. First operand 436 states and 552 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 07:29:53,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:29:57,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:29:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:29:57,420 INFO L93 Difference]: Finished difference Result 862 states and 1093 transitions. [2025-03-17 07:29:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 07:29:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-17 07:29:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:29:57,423 INFO L225 Difference]: With dead ends: 862 [2025-03-17 07:29:57,423 INFO L226 Difference]: Without dead ends: 436 [2025-03-17 07:29:57,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:29:57,425 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:29:57,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1048 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-17 07:29:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-17 07:29:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-17 07:29:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 339 states have (on average 1.2654867256637168) internal successors, (429), 342 states have internal predecessors, (429), 63 states have call successors, (63), 34 states have call predecessors, (63), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 07:29:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 551 transitions. [2025-03-17 07:29:57,437 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 551 transitions. Word has length 76 [2025-03-17 07:29:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:29:57,437 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 551 transitions. [2025-03-17 07:29:57,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 07:29:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 551 transitions. [2025-03-17 07:29:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 07:29:57,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:29:57,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:29:57,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 07:29:57,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:29:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:29:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1602207014, now seen corresponding path program 1 times [2025-03-17 07:29:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:29:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405752729] [2025-03-17 07:29:57,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:29:58,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 07:29:58,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 07:29:58,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:29:58,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:29:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 07:29:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:29:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405752729] [2025-03-17 07:29:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405752729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:29:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832817062] [2025-03-17 07:29:58,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:58,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:29:58,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:29:58,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:29:58,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 07:29:59,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 07:29:59,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 07:29:59,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:29:59,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:29:59,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 07:29:59,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:30:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 07:30:00,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:30:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832817062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:00,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:30:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2025-03-17 07:30:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041910548] [2025-03-17 07:30:00,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:00,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:30:00,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:00,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:30:00,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 07:30:00,007 INFO L87 Difference]: Start difference. First operand 436 states and 551 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:30:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:00,143 INFO L93 Difference]: Finished difference Result 791 states and 1014 transitions. [2025-03-17 07:30:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:30:00,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-03-17 07:30:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:00,147 INFO L225 Difference]: With dead ends: 791 [2025-03-17 07:30:00,147 INFO L226 Difference]: Without dead ends: 457 [2025-03-17 07:30:00,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 07:30:00,148 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:00,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1247 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:30:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-17 07:30:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-03-17 07:30:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 354 states have (on average 1.2542372881355932) internal successors, (444), 357 states have internal predecessors, (444), 63 states have call successors, (63), 34 states have call predecessors, (63), 39 states have return successors, (73), 65 states have call predecessors, (73), 59 states have call successors, (73) [2025-03-17 07:30:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2025-03-17 07:30:00,162 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 81 [2025-03-17 07:30:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:00,162 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2025-03-17 07:30:00,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:30:00,163 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2025-03-17 07:30:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 07:30:00,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:00,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:30:00,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 07:30:00,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 07:30:00,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:00,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:00,365 INFO L85 PathProgramCache]: Analyzing trace with hash 321021020, now seen corresponding path program 1 times [2025-03-17 07:30:00,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:00,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218322394] [2025-03-17 07:30:00,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:01,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 07:30:01,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 07:30:01,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:01,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 07:30:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218322394] [2025-03-17 07:30:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218322394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:30:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349054351] [2025-03-17 07:30:01,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:30:01,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:30:01,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:30:01,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 07:30:02,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 07:30:02,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 07:30:02,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:02,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:02,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 07:30:02,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:30:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 07:30:03,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:30:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349054351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:30:03,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-17 07:30:03,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690796011] [2025-03-17 07:30:03,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:03,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:30:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:03,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:30:03,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-17 07:30:03,178 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:30:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:03,346 INFO L93 Difference]: Finished difference Result 805 states and 1031 transitions. [2025-03-17 07:30:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:30:03,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-03-17 07:30:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:03,350 INFO L225 Difference]: With dead ends: 805 [2025-03-17 07:30:03,350 INFO L226 Difference]: Without dead ends: 457 [2025-03-17 07:30:03,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-17 07:30:03,352 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:03,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:30:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-17 07:30:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-03-17 07:30:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 354 states have (on average 1.2485875706214689) internal successors, (442), 357 states have internal predecessors, (442), 63 states have call successors, (63), 34 states have call predecessors, (63), 39 states have return successors, (73), 65 states have call predecessors, (73), 59 states have call successors, (73) [2025-03-17 07:30:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 578 transitions. [2025-03-17 07:30:03,369 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 578 transitions. Word has length 81 [2025-03-17 07:30:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:03,370 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 578 transitions. [2025-03-17 07:30:03,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:30:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 578 transitions. [2025-03-17 07:30:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 07:30:03,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:03,371 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 07:30:03,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 07:30:03,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:30:03,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:03,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:03,573 INFO L85 PathProgramCache]: Analyzing trace with hash -915788541, now seen corresponding path program 1 times [2025-03-17 07:30:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:03,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560003771] [2025-03-17 07:30:03,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:03,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:04,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 07:30:04,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 07:30:04,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:04,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 07:30:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560003771] [2025-03-17 07:30:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560003771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:30:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148477090] [2025-03-17 07:30:04,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:30:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:30:04,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:30:04,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 07:30:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 07:30:06,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 07:30:06,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:06,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 07:30:06,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:30:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 07:30:06,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:30:06,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148477090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:06,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:30:06,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-17 07:30:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056345261] [2025-03-17 07:30:06,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:06,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:30:06,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:06,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:30:06,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:30:06,299 INFO L87 Difference]: Start difference. First operand 457 states and 578 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:30:10,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:30:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:10,510 INFO L93 Difference]: Finished difference Result 672 states and 845 transitions. [2025-03-17 07:30:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:30:10,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-17 07:30:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:10,514 INFO L225 Difference]: With dead ends: 672 [2025-03-17 07:30:10,514 INFO L226 Difference]: Without dead ends: 669 [2025-03-17 07:30:10,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:30:10,517 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 263 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:10,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 394 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 07:30:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-17 07:30:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 649. [2025-03-17 07:30:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 498 states have (on average 1.2469879518072289) internal successors, (621), 499 states have internal predecessors, (621), 89 states have call successors, (89), 52 states have call predecessors, (89), 61 states have return successors, (111), 97 states have call predecessors, (111), 85 states have call successors, (111) [2025-03-17 07:30:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 821 transitions. [2025-03-17 07:30:10,546 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 821 transitions. Word has length 85 [2025-03-17 07:30:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:10,546 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 821 transitions. [2025-03-17 07:30:10,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:30:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 821 transitions. [2025-03-17 07:30:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 07:30:10,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:10,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:30:10,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 07:30:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:30:10,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1852259641, now seen corresponding path program 1 times [2025-03-17 07:30:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274947832] [2025-03-17 07:30:10,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:11,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 07:30:11,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 07:30:11,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:11,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 07:30:11,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:11,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274947832] [2025-03-17 07:30:11,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274947832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:11,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:11,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:30:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953660697] [2025-03-17 07:30:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:11,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:30:11,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:11,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:30:11,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:30:11,689 INFO L87 Difference]: Start difference. First operand 649 states and 821 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 07:30:15,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:30:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:15,901 INFO L93 Difference]: Finished difference Result 1286 states and 1632 transitions. [2025-03-17 07:30:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:30:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2025-03-17 07:30:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:15,907 INFO L225 Difference]: With dead ends: 1286 [2025-03-17 07:30:15,907 INFO L226 Difference]: Without dead ends: 637 [2025-03-17 07:30:15,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:30:15,911 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 87 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:15,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 752 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 07:30:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-17 07:30:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 614. [2025-03-17 07:30:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 472 states have (on average 1.2394067796610169) internal successors, (585), 474 states have internal predecessors, (585), 87 states have call successors, (87), 46 states have call predecessors, (87), 54 states have return successors, (108), 93 states have call predecessors, (108), 83 states have call successors, (108) [2025-03-17 07:30:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 780 transitions. [2025-03-17 07:30:15,938 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 780 transitions. Word has length 92 [2025-03-17 07:30:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:15,939 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 780 transitions. [2025-03-17 07:30:15,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 07:30:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 780 transitions. [2025-03-17 07:30:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 07:30:15,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:15,940 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:30:15,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 07:30:15,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:15,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash -131236187, now seen corresponding path program 1 times [2025-03-17 07:30:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334202131] [2025-03-17 07:30:15,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:16,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 07:30:16,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 07:30:16,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:16,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 07:30:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334202131] [2025-03-17 07:30:17,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334202131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:30:17,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681820348] [2025-03-17 07:30:17,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:17,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:30:17,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:30:17,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:30:17,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 07:30:18,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 07:30:18,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 07:30:18,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:18,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:18,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 07:30:18,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:30:19,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-17 07:30:19,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 07:30:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 07:30:19,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:30:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 07:30:20,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681820348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 07:30:20,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 07:30:20,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 13] total 22 [2025-03-17 07:30:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123134541] [2025-03-17 07:30:20,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 07:30:20,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 07:30:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:20,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 07:30:20,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2025-03-17 07:30:20,107 INFO L87 Difference]: Start difference. First operand 614 states and 780 transitions. Second operand has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 18 states have internal predecessors, (99), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (22), 9 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 07:30:24,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:30:28,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:30:32,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:30:36,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:30:40,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:30:44,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:30:48,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:30:53,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:30:57,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:31:01,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]