./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ef92dd0c18fa389aa454198685fbcc052698924a127f9f39b737e9548a23680b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:00:41,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:00:42,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:00:42,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:00:42,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:00:42,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:00:42,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:00:42,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:00:42,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:00:42,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:00:42,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:00:42,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:00:42,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:00:42,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:00:42,074 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:00:42,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:00:42,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:00:42,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:42,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:00:42,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:00:42,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:00:42,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:00:42,077 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 -> ef92dd0c18fa389aa454198685fbcc052698924a127f9f39b737e9548a23680b [2025-03-04 04:00:42,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:00:42,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:00:42,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:00:42,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:00:42,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:00:42,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i [2025-03-04 04:00:43,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07900b3f/95539333755c49b48865ea2747ce1bdb/FLAG10bf38c87 [2025-03-04 04:00:43,845 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:00:43,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i [2025-03-04 04:00:43,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07900b3f/95539333755c49b48865ea2747ce1bdb/FLAG10bf38c87 [2025-03-04 04:00:43,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07900b3f/95539333755c49b48865ea2747ce1bdb [2025-03-04 04:00:43,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:00:43,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:00:43,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:43,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:00:43,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:00:43,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:43" (1/1) ... [2025-03-04 04:00:43,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110580f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:43, skipping insertion in model container [2025-03-04 04:00:43,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:43" (1/1) ... [2025-03-04 04:00:43,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:00:44,425 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i[160969,160982] [2025-03-04 04:00:44,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:44,593 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:00:44,711 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i[160969,160982] [2025-03-04 04:00:44,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:44,775 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:00:44,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44 WrapperNode [2025-03-04 04:00:44,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:44,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:44,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:00:44,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:00:44,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,842 INFO L138 Inliner]: procedures = 101, calls = 399, calls flagged for inlining = 41, calls inlined = 38, statements flattened = 1032 [2025-03-04 04:00:44,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:44,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:00:44,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:00:44,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:00:44,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,917 INFO L175 MemorySlicer]: Split 259 memory accesses to 11 slices as follows [2, 90, 21, 7, 19, 44, 3, 2, 17, 33, 21]. 35 percent of accesses are in the largest equivalence class. The 78 initializations are split as follows [2, 0, 21, 7, 0, 0, 0, 0, 15, 33, 0]. The 113 writes are split as follows [0, 29, 0, 0, 19, 44, 1, 1, 1, 0, 18]. [2025-03-04 04:00:44,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:44,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:45,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:00:45,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:00:45,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:00:45,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:00:45,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (1/1) ... [2025-03-04 04:00:45,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:45,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:00:45,031 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-04 04:00:45,033 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-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:00:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:00:45,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2025-03-04 04:00:45,050 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 04:00:45,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 04:00:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:00:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:00:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-04 04:00:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-04 04:00:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:00:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:00:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:00:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:00:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2025-03-04 04:00:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:00:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 04:00:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 04:00:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 04:00:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2025-03-04 04:00:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:00:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure genelink_tx_fixup [2025-03-04 04:00:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure genelink_tx_fixup [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure genelink_rx_fixup [2025-03-04 04:00:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure genelink_rx_fixup [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:00:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-03-04 04:00:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:00:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:00:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:00:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:00:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 04:00:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 04:00:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 04:00:45,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 04:00:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:00:45,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:00:45,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:00:45,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:00:45,321 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:00:45,360 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5689: havoc #t~mem49;havoc #t~bitwise50; [2025-03-04 04:00:45,480 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6421: havoc #t~ret163.base, #t~ret163.offset; [2025-03-04 04:00:45,522 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6407: havoc #t~nondet159; [2025-03-04 04:00:45,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5564: havoc skb_headroom_#t~mem30#1.base, skb_headroom_#t~mem30#1.offset;havoc skb_headroom_#t~mem31#1.base, skb_headroom_#t~mem31#1.offset; [2025-03-04 04:00:45,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5540: havoc skb_is_nonlinear_#t~mem20#1; [2025-03-04 04:00:45,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6424: havoc skb_push_#t~ret164#1.base, skb_push_#t~ret164#1.offset; [2025-03-04 04:00:45,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5501: havoc atomic_read_#t~mem10#1; [2025-03-04 04:00:45,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6418: havoc skb_copy_expand_#t~ret162#1.base, skb_copy_expand_#t~ret162#1.offset; [2025-03-04 04:00:45,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5514: havoc skb_end_pointer_#t~mem15#1.base, skb_end_pointer_#t~mem15#1.offset;havoc skb_end_pointer_#t~mem16#1; [2025-03-04 04:00:45,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5572: havoc skb_tailroom_#t~ite35#1;havoc skb_tailroom_#t~mem33#1;havoc skb_tailroom_#t~mem34#1; [2025-03-04 04:00:45,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset;call ULTIMATE.dealloc(~#descriptor___0~0#1.base, ~#descriptor___0~0#1.offset);havoc ~#descriptor___0~0#1.base, ~#descriptor___0~0#1.offset;call ULTIMATE.dealloc(~#descriptor___1~0#1.base, ~#descriptor___1~0#1.offset);havoc ~#descriptor___1~0#1.base, ~#descriptor___1~0#1.offset; [2025-03-04 04:00:50,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6411: havoc ldv_release_2_#t~nondet160#1; [2025-03-04 04:00:50,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6436: havoc usb_register_driver_#t~nondet168#1; [2025-03-04 04:00:50,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6454: havoc usbnet_suspend_#t~nondet171#1; [2025-03-04 04:00:50,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6447: havoc usbnet_resume_#t~nondet170#1; [2025-03-04 04:00:50,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5927: call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-04 04:00:50,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6415: havoc ldv_reset_resume_1_#t~nondet161#1; [2025-03-04 04:00:50,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6443: havoc usbnet_probe_#t~nondet169#1; [2025-03-04 04:00:50,180 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-03-04 04:00:50,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:00:50,196 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:00:50,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:00:50,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:50 BoogieIcfgContainer [2025-03-04 04:00:50,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:00:50,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:00:50,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:00:50,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:00:50,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:00:43" (1/3) ... [2025-03-04 04:00:50,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27421bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:00:50, skipping insertion in model container [2025-03-04 04:00:50,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:44" (2/3) ... [2025-03-04 04:00:50,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27421bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:00:50, skipping insertion in model container [2025-03-04 04:00:50,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:50" (3/3) ... [2025-03-04 04:00:50,205 INFO L128 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i [2025-03-04 04:00:50,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:00:50,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i that has 26 procedures, 295 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-03-04 04:00:50,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:00:50,277 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;@17255074, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:00:50,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:00:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 202 states have (on average 1.391089108910891) internal successors, (281), 208 states have internal predecessors, (281), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 04:00:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 04:00:50,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:50,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:00:50,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:50,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1300291084, now seen corresponding path program 1 times [2025-03-04 04:00:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393212127] [2025-03-04 04:00:50,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:50,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 04:00:50,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 04:00:50,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:50,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 04:00:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393212127] [2025-03-04 04:00:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393212127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616295190] [2025-03-04 04:00:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:51,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:51,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:51,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:51,139 INFO L87 Difference]: Start difference. First operand has 258 states, 202 states have (on average 1.391089108910891) internal successors, (281), 208 states have internal predecessors, (281), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 04:00:55,165 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-04 04:00:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:55,279 INFO L93 Difference]: Finished difference Result 722 states and 1040 transitions. [2025-03-04 04:00:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:55,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-04 04:00:55,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:55,288 INFO L225 Difference]: With dead ends: 722 [2025-03-04 04:00:55,288 INFO L226 Difference]: Without dead ends: 453 [2025-03-04 04:00:55,294 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-04 04:00:55,295 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 296 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:55,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 683 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:00:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-04 04:00:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-03-04 04:00:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 364 states have (on average 1.3681318681318682) internal successors, (498), 364 states have internal predecessors, (498), 62 states have call successors, (62), 27 states have call predecessors, (62), 26 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 04:00:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 621 transitions. [2025-03-04 04:00:55,352 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 621 transitions. Word has length 42 [2025-03-04 04:00:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:55,353 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 621 transitions. [2025-03-04 04:00:55,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 04:00:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 621 transitions. [2025-03-04 04:00:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 04:00:55,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:55,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:00:55,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:00:55,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1048033786, now seen corresponding path program 1 times [2025-03-04 04:00:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:55,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748052867] [2025-03-04 04:00:55,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:55,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 04:00:55,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 04:00:55,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:55,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:00:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:55,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748052867] [2025-03-04 04:00:55,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748052867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:55,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:00:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533811140] [2025-03-04 04:00:55,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:55,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:00:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:55,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:00:55,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:00:55,858 INFO L87 Difference]: Start difference. First operand 453 states and 621 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 04:00:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:55,982 INFO L93 Difference]: Finished difference Result 1316 states and 1825 transitions. [2025-03-04 04:00:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:00:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2025-03-04 04:00:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:55,989 INFO L225 Difference]: With dead ends: 1316 [2025-03-04 04:00:55,989 INFO L226 Difference]: Without dead ends: 877 [2025-03-04 04:00:55,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:00:55,991 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 308 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:55,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1331 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:00:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-04 04:00:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2025-03-04 04:00:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 707 states have (on average 1.3691654879773691) internal successors, (968), 707 states have internal predecessors, (968), 119 states have call successors, (119), 51 states have call predecessors, (119), 50 states have return successors, (124), 118 states have call predecessors, (124), 118 states have call successors, (124) [2025-03-04 04:00:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1211 transitions. [2025-03-04 04:00:56,045 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1211 transitions. Word has length 52 [2025-03-04 04:00:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:56,046 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1211 transitions. [2025-03-04 04:00:56,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 04:00:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1211 transitions. [2025-03-04 04:00:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 04:00:56,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:56,055 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:00:56,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:00:56,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:56,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:56,059 INFO L85 PathProgramCache]: Analyzing trace with hash -703498254, now seen corresponding path program 1 times [2025-03-04 04:00:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:56,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443713171] [2025-03-04 04:00:56,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:56,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 04:00:56,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 04:00:56,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:56,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 04:00:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443713171] [2025-03-04 04:00:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443713171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:56,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:56,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336333030] [2025-03-04 04:00:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:56,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:56,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:56,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:56,462 INFO L87 Difference]: Start difference. First operand 877 states and 1211 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 04:00:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:56,589 INFO L93 Difference]: Finished difference Result 1964 states and 2729 transitions. [2025-03-04 04:00:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:56,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-04 04:00:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:56,597 INFO L225 Difference]: With dead ends: 1964 [2025-03-04 04:00:56,598 INFO L226 Difference]: Without dead ends: 1107 [2025-03-04 04:00:56,601 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-04 04:00:56,602 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 115 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:56,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 634 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:00:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-04 04:00:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1098. [2025-03-04 04:00:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 905 states have (on average 1.3933701657458564) internal successors, (1261), 905 states have internal predecessors, (1261), 132 states have call successors, (132), 61 states have call predecessors, (132), 60 states have return successors, (137), 131 states have call predecessors, (137), 131 states have call successors, (137) [2025-03-04 04:00:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1530 transitions. [2025-03-04 04:00:56,664 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1530 transitions. Word has length 125 [2025-03-04 04:00:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:56,665 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1530 transitions. [2025-03-04 04:00:56,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 04:00:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1530 transitions. [2025-03-04 04:00:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 04:00:56,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:56,670 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:00:56,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:00:56,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:56,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1545278224, now seen corresponding path program 1 times [2025-03-04 04:00:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:56,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158883179] [2025-03-04 04:00:56,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:56,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 04:00:56,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 04:00:56,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:56,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 04:00:57,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:57,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158883179] [2025-03-04 04:00:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158883179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:57,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:57,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722560238] [2025-03-04 04:00:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:57,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:57,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:57,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:57,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:57,079 INFO L87 Difference]: Start difference. First operand 1098 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 04:01:01,094 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-04 04:01:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:01,197 INFO L93 Difference]: Finished difference Result 2906 states and 4051 transitions. [2025-03-04 04:01:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:01,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 147 [2025-03-04 04:01:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:01,205 INFO L225 Difference]: With dead ends: 2906 [2025-03-04 04:01:01,205 INFO L226 Difference]: Without dead ends: 1839 [2025-03-04 04:01:01,208 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-04 04:01:01,208 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 282 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:01,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 693 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 24 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:01:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-03-04 04:01:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1830. [2025-03-04 04:01:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1507 states have (on average 1.3782349037823491) internal successors, (2077), 1507 states have internal predecessors, (2077), 218 states have call successors, (218), 105 states have call predecessors, (218), 104 states have return successors, (225), 217 states have call predecessors, (225), 217 states have call successors, (225) [2025-03-04 04:01:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2520 transitions. [2025-03-04 04:01:01,263 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2520 transitions. Word has length 147 [2025-03-04 04:01:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:01,264 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 2520 transitions. [2025-03-04 04:01:01,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 04:01:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2520 transitions. [2025-03-04 04:01:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 04:01:01,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:01,267 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:01,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:01:01,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:01,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash 39687610, now seen corresponding path program 1 times [2025-03-04 04:01:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27245498] [2025-03-04 04:01:01,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:01,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 04:01:01,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 04:01:01,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:01,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 04:01:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27245498] [2025-03-04 04:01:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27245498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:01:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967972072] [2025-03-04 04:01:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:01,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:01:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:01:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:01:01,782 INFO L87 Difference]: Start difference. First operand 1830 states and 2520 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 04:01:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:01,851 INFO L93 Difference]: Finished difference Result 3667 states and 5084 transitions. [2025-03-04 04:01:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:01:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2025-03-04 04:01:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:01,861 INFO L225 Difference]: With dead ends: 3667 [2025-03-04 04:01:01,861 INFO L226 Difference]: Without dead ends: 1868 [2025-03-04 04:01:01,866 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-04 04:01:01,867 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 0 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:01,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1323 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:01:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2025-03-04 04:01:01,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1862. [2025-03-04 04:01:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1531 states have (on average 1.372305682560418) internal successors, (2101), 1531 states have internal predecessors, (2101), 218 states have call successors, (218), 105 states have call predecessors, (218), 112 states have return successors, (241), 225 states have call predecessors, (241), 217 states have call successors, (241) [2025-03-04 04:01:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2560 transitions. [2025-03-04 04:01:01,929 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2560 transitions. Word has length 147 [2025-03-04 04:01:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:01,929 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2560 transitions. [2025-03-04 04:01:01,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 04:01:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2560 transitions. [2025-03-04 04:01:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 04:01:01,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:01,933 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:01:01,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:01,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1524985432, now seen corresponding path program 1 times [2025-03-04 04:01:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035470389] [2025-03-04 04:01:01,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:02,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 04:01:02,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 04:01:02,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:02,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 04:01:02,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:02,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035470389] [2025-03-04 04:01:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035470389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:02,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:02,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 04:01:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336689433] [2025-03-04 04:01:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:02,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 04:01:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:02,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 04:01:02,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:01:02,644 INFO L87 Difference]: Start difference. First operand 1862 states and 2560 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 04:01:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:02,821 INFO L93 Difference]: Finished difference Result 3749 states and 5169 transitions. [2025-03-04 04:01:02,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 04:01:02,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 154 [2025-03-04 04:01:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:02,830 INFO L225 Difference]: With dead ends: 3749 [2025-03-04 04:01:02,830 INFO L226 Difference]: Without dead ends: 1918 [2025-03-04 04:01:02,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 04:01:02,834 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 13 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3269 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:02,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3269 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-03-04 04:01:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1894. [2025-03-04 04:01:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1555 states have (on average 1.3665594855305465) internal successors, (2125), 1555 states have internal predecessors, (2125), 218 states have call successors, (218), 105 states have call predecessors, (218), 120 states have return successors, (249), 233 states have call predecessors, (249), 217 states have call successors, (249) [2025-03-04 04:01:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2592 transitions. [2025-03-04 04:01:02,893 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2592 transitions. Word has length 154 [2025-03-04 04:01:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:02,894 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2592 transitions. [2025-03-04 04:01:02,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 04:01:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2592 transitions. [2025-03-04 04:01:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 04:01:02,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:02,898 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:02,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:01:02,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:02,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash -583269352, now seen corresponding path program 1 times [2025-03-04 04:01:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:02,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664336067] [2025-03-04 04:01:02,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:03,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 04:01:03,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 04:01:03,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:03,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-04 04:01:03,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:03,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664336067] [2025-03-04 04:01:03,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664336067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:03,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:03,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:01:03,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861047326] [2025-03-04 04:01:03,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:03,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:01:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:03,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:01:03,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:01:03,532 INFO L87 Difference]: Start difference. First operand 1894 states and 2592 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:01:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:03,589 INFO L93 Difference]: Finished difference Result 3767 states and 5161 transitions. [2025-03-04 04:01:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:01:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 160 [2025-03-04 04:01:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:03,598 INFO L225 Difference]: With dead ends: 3767 [2025-03-04 04:01:03,598 INFO L226 Difference]: Without dead ends: 1895 [2025-03-04 04:01:03,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:01:03,602 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 0 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:03,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 994 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:01:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-03-04 04:01:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1895. [2025-03-04 04:01:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1556 states have (on average 1.3663239074550129) internal successors, (2126), 1556 states have internal predecessors, (2126), 218 states have call successors, (218), 105 states have call predecessors, (218), 120 states have return successors, (249), 233 states have call predecessors, (249), 217 states have call successors, (249) [2025-03-04 04:01:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2593 transitions. [2025-03-04 04:01:03,656 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2593 transitions. Word has length 160 [2025-03-04 04:01:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:03,657 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2593 transitions. [2025-03-04 04:01:03,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:01:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2593 transitions. [2025-03-04 04:01:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 04:01:03,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:03,681 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:03,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:01:03,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:03,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash -745819849, now seen corresponding path program 1 times [2025-03-04 04:01:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049505968] [2025-03-04 04:01:03,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:03,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 04:01:03,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 04:01:03,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:03,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-04 04:01:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049505968] [2025-03-04 04:01:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049505968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358096827] [2025-03-04 04:01:04,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:04,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:04,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:04,265 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-04 04:01:04,265 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-04 04:01:04,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 04:01:04,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 04:01:04,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:04,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:04,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 04:01:04,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 04:01:05,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:01:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 04:01:05,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358096827] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:05,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 04:01:05,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 10 [2025-03-04 04:01:05,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504407952] [2025-03-04 04:01:05,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:05,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:01:05,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:05,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:01:05,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:01:05,215 INFO L87 Difference]: Start difference. First operand 1895 states and 2593 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:01:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:05,271 INFO L93 Difference]: Finished difference Result 3762 states and 5155 transitions. [2025-03-04 04:01:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:01:05,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2025-03-04 04:01:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:05,281 INFO L225 Difference]: With dead ends: 3762 [2025-03-04 04:01:05,281 INFO L226 Difference]: Without dead ends: 1896 [2025-03-04 04:01:05,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:01:05,286 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 0 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:05,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 993 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:01:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2025-03-04 04:01:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2025-03-04 04:01:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1557 states have (on average 1.3660886319845857) internal successors, (2127), 1557 states have internal predecessors, (2127), 218 states have call successors, (218), 105 states have call predecessors, (218), 120 states have return successors, (249), 233 states have call predecessors, (249), 217 states have call successors, (249) [2025-03-04 04:01:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2594 transitions. [2025-03-04 04:01:05,366 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2594 transitions. Word has length 161 [2025-03-04 04:01:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:05,366 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2594 transitions. [2025-03-04 04:01:05,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:01:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2594 transitions. [2025-03-04 04:01:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 04:01:05,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:05,369 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:05,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:01:05,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:05,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:05,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash 295396847, now seen corresponding path program 1 times [2025-03-04 04:01:05,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:05,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984572637] [2025-03-04 04:01:05,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:05,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:05,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 04:01:05,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 04:01:05,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:05,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 04:01:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984572637] [2025-03-04 04:01:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984572637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344136425] [2025-03-04 04:01:06,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:06,203 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-04 04:01:06,204 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-04 04:01:06,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 04:01:06,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 04:01:06,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:06,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:06,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 04:01:06,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 04:01:07,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:01:07,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344136425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:07,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:01:07,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5] total 18 [2025-03-04 04:01:07,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995384404] [2025-03-04 04:01:07,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:07,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 04:01:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:07,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 04:01:07,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-03-04 04:01:07,257 INFO L87 Difference]: Start difference. First operand 1896 states and 2594 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 12 states have internal predecessors, (101), 4 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 04:01:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:07,491 INFO L93 Difference]: Finished difference Result 3845 states and 5298 transitions. [2025-03-04 04:01:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 04:01:07,492 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 12 states have internal predecessors, (101), 4 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) Word has length 162 [2025-03-04 04:01:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:07,500 INFO L225 Difference]: With dead ends: 3845 [2025-03-04 04:01:07,501 INFO L226 Difference]: Without dead ends: 1982 [2025-03-04 04:01:07,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-03-04 04:01:07,506 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 10 mSDsluCounter, 4068 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4411 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:07,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4411 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:01:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-03-04 04:01:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1936. [2025-03-04 04:01:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1589 states have (on average 1.3536815607300188) internal successors, (2151), 1589 states have internal predecessors, (2151), 226 states have call successors, (226), 105 states have call predecessors, (226), 120 states have return successors, (257), 241 states have call predecessors, (257), 225 states have call successors, (257) [2025-03-04 04:01:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2634 transitions. [2025-03-04 04:01:07,564 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2634 transitions. Word has length 162 [2025-03-04 04:01:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:07,564 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2634 transitions. [2025-03-04 04:01:07,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 12 states have internal predecessors, (101), 4 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 04:01:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2634 transitions. [2025-03-04 04:01:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 04:01:07,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:07,568 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:07,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 04:01:07,770 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,SelfDestructingSolverStorable8 [2025-03-04 04:01:07,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:07,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1572680686, now seen corresponding path program 1 times [2025-03-04 04:01:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:07,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122776945] [2025-03-04 04:01:07,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:07,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:07,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 04:01:08,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 04:01:08,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:08,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 04:01:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122776945] [2025-03-04 04:01:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122776945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183260159] [2025-03-04 04:01:08,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:08,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:08,332 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-04 04:01:08,334 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-04 04:01:08,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 04:01:09,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 04:01:09,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:09,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:09,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 1862 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 04:01:09,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 04:01:09,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:01:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 04:01:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183260159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:01:09,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:01:09,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 11 [2025-03-04 04:01:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879657298] [2025-03-04 04:01:09,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:01:09,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 04:01:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:09,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 04:01:09,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:01:09,551 INFO L87 Difference]: Start difference. First operand 1936 states and 2634 transitions. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 2 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:01:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:09,657 INFO L93 Difference]: Finished difference Result 3857 states and 5254 transitions. [2025-03-04 04:01:09,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 04:01:09,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 2 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 171 [2025-03-04 04:01:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:09,665 INFO L225 Difference]: With dead ends: 3857 [2025-03-04 04:01:09,665 INFO L226 Difference]: Without dead ends: 1940 [2025-03-04 04:01:09,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 04:01:09,669 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 0 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:09,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1648 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:01:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2025-03-04 04:01:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1940. [2025-03-04 04:01:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1593 states have (on average 1.3527934714375391) internal successors, (2155), 1593 states have internal predecessors, (2155), 226 states have call successors, (226), 105 states have call predecessors, (226), 120 states have return successors, (257), 241 states have call predecessors, (257), 225 states have call successors, (257) [2025-03-04 04:01:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2638 transitions. [2025-03-04 04:01:09,718 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2638 transitions. Word has length 171 [2025-03-04 04:01:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 2638 transitions. [2025-03-04 04:01:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 2 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:01:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2638 transitions. [2025-03-04 04:01:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 04:01:09,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:09,721 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:09,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 04:01:09,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:09,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:09,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1692782249, now seen corresponding path program 2 times [2025-03-04 04:01:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:09,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988108359] [2025-03-04 04:01:09,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:01:09,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:10,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-03-04 04:01:10,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 04:01:10,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 04:01:10,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-04 04:01:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988108359] [2025-03-04 04:01:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988108359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361165615] [2025-03-04 04:01:10,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:01:10,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:10,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:10,615 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-04 04:01:10,616 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-04 04:01:11,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes.