./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 18:29:53,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:29:53,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:29:53,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:29:53,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:29:53,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:29:53,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:29:53,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:29:53,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:29:53,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:29:53,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:29:53,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:29:53,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:29:53,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:29:53,359 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:29:53,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:29:53,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:29:53,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:29:53,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:29:53,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:29:53,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:29:53,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:29:53,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:29:53,360 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:29:53,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:29:53,360 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:29:53,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:29:53,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:29:53,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:29:53,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:53,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:29:53,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:29:53,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:29:53,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:29:53,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:53,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:29:53,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:29:53,362 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:29:53,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:29:53,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:29:53,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:29:53,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:29:53,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:29:53,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:29:53,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:29:53,363 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-jdk21/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-01-09 18:29:53,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:29:53,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:29:53,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:29:53,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:29:53,656 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:29:53,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-01-09 18:29:55,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed1259a8/fa993f8a49cb46c096c97fc998760634/FLAG9c25eaae4 [2025-01-09 18:29:55,603 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:29:55,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-01-09 18:29:55,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed1259a8/fa993f8a49cb46c096c97fc998760634/FLAG9c25eaae4 [2025-01-09 18:29:55,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed1259a8/fa993f8a49cb46c096c97fc998760634 [2025-01-09 18:29:55,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:29:55,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:29:55,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:29:55,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:29:55,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:29:55,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:29:55" (1/1) ... [2025-01-09 18:29:55,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40414e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:55, skipping insertion in model container [2025-01-09 18:29:55,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:29:55" (1/1) ... [2025-01-09 18:29:55,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:29:56,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 18:29:56,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:29:56,560 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:29:56,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 18:29:56,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:29:56,816 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:29:56,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56 WrapperNode [2025-01-09 18:29:56,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:29:56,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:29:56,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:29:56,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:29:56,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:56,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:56,912 INFO L138 Inliner]: procedures = 101, calls = 399, calls flagged for inlining = 41, calls inlined = 38, statements flattened = 1032 [2025-01-09 18:29:56,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:29:56,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:29:56,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:29:56,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:29:56,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:56,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:56,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,020 INFO L175 MemorySlicer]: Split 259 memory accesses to 11 slices as follows [2, 21, 7, 19, 90, 44, 21, 3, 2, 17, 33]. 35 percent of accesses are in the largest equivalence class. The 78 initializations are split as follows [2, 21, 7, 0, 0, 0, 0, 0, 0, 15, 33]. The 113 writes are split as follows [0, 0, 0, 19, 29, 44, 18, 1, 1, 1, 0]. [2025-01-09 18:29:57,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:29:57,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:29:57,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:29:57,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:29:57,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (1/1) ... [2025-01-09 18:29:57,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:57,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:29:57,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:29:57,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:29:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:29:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:29:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:29:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:29:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:29:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:29:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:29:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:29:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:29:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:29:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:29:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:29:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:29:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:29:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:29:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:29:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:29:57,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:29:57,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:29:57,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2025-01-09 18:29:57,233 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 18:29:57,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:29:57,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-01-09 18:29:57,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-01-09 18:29:57,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:29:57,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:29:57,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:29:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:29:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:29:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:29:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:29:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:29:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:29:57,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2025-01-09 18:29:57,237 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:29:57,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 18:29:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2025-01-09 18:29:57,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:29:57,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure genelink_tx_fixup [2025-01-09 18:29:57,239 INFO L138 BoogieDeclarations]: Found implementation of procedure genelink_tx_fixup [2025-01-09 18:29:57,239 INFO L130 BoogieDeclarations]: Found specification of procedure genelink_rx_fixup [2025-01-09 18:29:57,239 INFO L138 BoogieDeclarations]: Found implementation of procedure genelink_rx_fixup [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-01-09 18:29:57,243 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:29:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 18:29:57,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 18:29:57,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:29:57,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:29:57,667 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:29:57,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:29:57,691 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:30:02,854 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-01-09 18:30:02,855 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:30:02,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:30:02,872 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:30:02,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:30:02 BoogieIcfgContainer [2025-01-09 18:30:02,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:30:02,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:30:02,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:30:02,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:30:02,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:29:55" (1/3) ... [2025-01-09 18:30:02,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f25ae45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:30:02, skipping insertion in model container [2025-01-09 18:30:02,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:56" (2/3) ... [2025-01-09 18:30:02,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f25ae45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:30:02, skipping insertion in model container [2025-01-09 18:30:02,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:30:02" (3/3) ... [2025-01-09 18:30:02,885 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-01-09 18:30:02,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:30:02,899 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, 296 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-01-09 18:30:02,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:30:02,964 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;@36b4f27b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:30:02,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:30:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 203 states have (on average 1.3891625615763548) internal successors, (282), 209 states have internal predecessors, (282), 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-01-09 18:30:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 18:30:02,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:02,977 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-01-09 18:30:02,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1611608514, now seen corresponding path program 1 times [2025-01-09 18:30:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688066705] [2025-01-09 18:30:02,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:03,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 18:30:03,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 18:30:03,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:03,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 18:30:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:04,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688066705] [2025-01-09 18:30:04,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688066705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:04,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:04,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:04,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132564987] [2025-01-09 18:30:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:04,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:04,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:04,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:04,065 INFO L87 Difference]: Start difference. First operand has 259 states, 203 states have (on average 1.3891625615763548) internal successors, (282), 209 states have internal predecessors, (282), 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-01-09 18:30:08,097 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-01-09 18:30:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:08,236 INFO L93 Difference]: Finished difference Result 725 states and 1043 transitions. [2025-01-09 18:30:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:08,240 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-01-09 18:30:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:08,253 INFO L225 Difference]: With dead ends: 725 [2025-01-09 18:30:08,253 INFO L226 Difference]: Without dead ends: 455 [2025-01-09 18:30:08,262 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-01-09 18:30:08,264 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 297 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:08,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:30:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-01-09 18:30:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-01-09 18:30:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 366 states have (on average 1.366120218579235) internal successors, (500), 366 states have internal predecessors, (500), 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-01-09 18:30:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 623 transitions. [2025-01-09 18:30:08,374 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 623 transitions. Word has length 42 [2025-01-09 18:30:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:08,374 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 623 transitions. [2025-01-09 18:30:08,374 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-01-09 18:30:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 623 transitions. [2025-01-09 18:30:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 18:30:08,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:08,378 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-01-09 18:30:08,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:30:08,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:08,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash 220244656, now seen corresponding path program 1 times [2025-01-09 18:30:08,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539724505] [2025-01-09 18:30:08,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:08,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:08,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 18:30:08,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 18:30:08,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:08,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:30:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539724505] [2025-01-09 18:30:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539724505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:30:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086653255] [2025-01-09 18:30:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:09,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:30:09,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:09,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:30:09,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:09,157 INFO L87 Difference]: Start difference. First operand 455 states and 623 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-01-09 18:30:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:09,328 INFO L93 Difference]: Finished difference Result 1322 states and 1831 transitions. [2025-01-09 18:30:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:30:09,328 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-01-09 18:30:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:09,337 INFO L225 Difference]: With dead ends: 1322 [2025-01-09 18:30:09,337 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 18:30:09,340 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-01-09 18:30:09,340 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 309 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:09,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1343 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:30:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 18:30:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 18:30:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 711 states have (on average 1.3670886075949367) internal successors, (972), 711 states have internal predecessors, (972), 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-01-09 18:30:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1215 transitions. [2025-01-09 18:30:09,444 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1215 transitions. Word has length 52 [2025-01-09 18:30:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:09,446 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1215 transitions. [2025-01-09 18:30:09,446 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-01-09 18:30:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1215 transitions. [2025-01-09 18:30:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 18:30:09,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:09,461 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-01-09 18:30:09,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:30:09,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:09,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1775907118, now seen corresponding path program 1 times [2025-01-09 18:30:09,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:09,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257877923] [2025-01-09 18:30:09,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:09,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 18:30:09,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 18:30:09,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:09,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 18:30:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257877923] [2025-01-09 18:30:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257877923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:10,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985044831] [2025-01-09 18:30:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:10,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:10,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:10,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:10,091 INFO L87 Difference]: Start difference. First operand 881 states and 1215 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-01-09 18:30:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:10,206 INFO L93 Difference]: Finished difference Result 1972 states and 2737 transitions. [2025-01-09 18:30:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:10,207 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-01-09 18:30:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:10,217 INFO L225 Difference]: With dead ends: 1972 [2025-01-09 18:30:10,218 INFO L226 Difference]: Without dead ends: 1111 [2025-01-09 18:30:10,223 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-01-09 18:30:10,225 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 115 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:10,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 640 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:30:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-01-09 18:30:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1102. [2025-01-09 18:30:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 909 states have (on average 1.3916391639163916) internal successors, (1265), 909 states have internal predecessors, (1265), 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-01-09 18:30:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1534 transitions. [2025-01-09 18:30:10,315 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1534 transitions. Word has length 125 [2025-01-09 18:30:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:10,316 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1534 transitions. [2025-01-09 18:30:10,317 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-01-09 18:30:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1534 transitions. [2025-01-09 18:30:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 18:30:10,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:10,321 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-01-09 18:30:10,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:30:10,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -623646862, now seen corresponding path program 1 times [2025-01-09 18:30:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343014885] [2025-01-09 18:30:10,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:10,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 18:30:10,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 18:30:10,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:10,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 18:30:10,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:10,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343014885] [2025-01-09 18:30:10,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343014885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:10,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:10,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:10,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601176934] [2025-01-09 18:30:10,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:10,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:10,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:10,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:10,825 INFO L87 Difference]: Start difference. First operand 1102 states and 1534 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-01-09 18:30:14,843 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-01-09 18:30:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:14,983 INFO L93 Difference]: Finished difference Result 2918 states and 4063 transitions. [2025-01-09 18:30:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:14,983 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-01-09 18:30:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:14,994 INFO L225 Difference]: With dead ends: 2918 [2025-01-09 18:30:14,994 INFO L226 Difference]: Without dead ends: 1847 [2025-01-09 18:30:14,997 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-01-09 18:30:14,998 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 283 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:14,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 697 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:30:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-01-09 18:30:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1838. [2025-01-09 18:30:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1515 states have (on average 1.3762376237623761) internal successors, (2085), 1515 states have internal predecessors, (2085), 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-01-09 18:30:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2528 transitions. [2025-01-09 18:30:15,097 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2528 transitions. Word has length 147 [2025-01-09 18:30:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:15,097 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2528 transitions. [2025-01-09 18:30:15,097 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-01-09 18:30:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2528 transitions. [2025-01-09 18:30:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 18:30:15,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:15,104 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-01-09 18:30:15,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:30:15,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:15,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash -902520974, now seen corresponding path program 1 times [2025-01-09 18:30:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:15,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020877887] [2025-01-09 18:30:15,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:15,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 18:30:15,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 18:30:15,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:15,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 18:30:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020877887] [2025-01-09 18:30:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020877887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:15,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:15,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:30:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092146446] [2025-01-09 18:30:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:30:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:15,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:30:15,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:15,992 INFO L87 Difference]: Start difference. First operand 1838 states and 2528 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-01-09 18:30:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:16,118 INFO L93 Difference]: Finished difference Result 3683 states and 5100 transitions. [2025-01-09 18:30:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:30:16,120 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-01-09 18:30:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:16,134 INFO L225 Difference]: With dead ends: 3683 [2025-01-09 18:30:16,135 INFO L226 Difference]: Without dead ends: 1876 [2025-01-09 18:30:16,140 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-01-09 18:30:16,142 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 0 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:16,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1335 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:30:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2025-01-09 18:30:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1870. [2025-01-09 18:30:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1539 states have (on average 1.3703703703703705) internal successors, (2109), 1539 states have internal predecessors, (2109), 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-01-09 18:30:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2568 transitions. [2025-01-09 18:30:16,235 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2568 transitions. Word has length 147 [2025-01-09 18:30:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:16,236 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2568 transitions. [2025-01-09 18:30:16,237 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-01-09 18:30:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2568 transitions. [2025-01-09 18:30:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 18:30:16,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:16,244 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-01-09 18:30:16,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:30:16,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:16,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1760356189, now seen corresponding path program 1 times [2025-01-09 18:30:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441580307] [2025-01-09 18:30:16,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:16,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:16,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 18:30:16,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 18:30:16,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:16,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 18:30:17,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:17,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441580307] [2025-01-09 18:30:17,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441580307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:17,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:17,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 18:30:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670912939] [2025-01-09 18:30:17,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 18:30:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:17,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 18:30:17,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 18:30:17,160 INFO L87 Difference]: Start difference. First operand 1870 states and 2568 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-01-09 18:30:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:17,380 INFO L93 Difference]: Finished difference Result 3765 states and 5185 transitions. [2025-01-09 18:30:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 18:30:17,381 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-01-09 18:30:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:17,396 INFO L225 Difference]: With dead ends: 3765 [2025-01-09 18:30:17,396 INFO L226 Difference]: Without dead ends: 1926 [2025-01-09 18:30:17,403 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-01-09 18:30:17,404 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 15 mSDsluCounter, 2964 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:17,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3297 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:30:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-01-09 18:30:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1902. [2025-01-09 18:30:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1563 states have (on average 1.36468330134357) internal successors, (2133), 1563 states have internal predecessors, (2133), 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-01-09 18:30:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2600 transitions. [2025-01-09 18:30:17,510 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2600 transitions. Word has length 154 [2025-01-09 18:30:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:17,511 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2600 transitions. [2025-01-09 18:30:17,511 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-01-09 18:30:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2600 transitions. [2025-01-09 18:30:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 18:30:17,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:17,518 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-01-09 18:30:17,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:30:17,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:17,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash 256296666, now seen corresponding path program 1 times [2025-01-09 18:30:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:17,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367842105] [2025-01-09 18:30:17,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:17,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 18:30:17,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 18:30:17,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:17,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-09 18:30:18,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367842105] [2025-01-09 18:30:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367842105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:18,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:18,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:30:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720370773] [2025-01-09 18:30:18,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:18,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:30:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:18,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:30:18,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:30:18,280 INFO L87 Difference]: Start difference. First operand 1902 states and 2600 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-01-09 18:30:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:18,368 INFO L93 Difference]: Finished difference Result 3783 states and 5177 transitions. [2025-01-09 18:30:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:30:18,369 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-01-09 18:30:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:18,382 INFO L225 Difference]: With dead ends: 3783 [2025-01-09 18:30:18,382 INFO L226 Difference]: Without dead ends: 1903 [2025-01-09 18:30:18,387 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-01-09 18:30:18,389 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 0 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:18,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1003 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:30:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2025-01-09 18:30:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2025-01-09 18:30:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1564 states have (on average 1.3644501278772379) internal successors, (2134), 1564 states have internal predecessors, (2134), 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-01-09 18:30:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2601 transitions. [2025-01-09 18:30:18,477 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2601 transitions. Word has length 160 [2025-01-09 18:30:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:18,477 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2601 transitions. [2025-01-09 18:30:18,477 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-01-09 18:30:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2601 transitions. [2025-01-09 18:30:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 18:30:18,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:18,484 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-01-09 18:30:18,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:30:18,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:18,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1792713767, now seen corresponding path program 1 times [2025-01-09 18:30:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004340798] [2025-01-09 18:30:18,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:18,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 18:30:18,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 18:30:18,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-09 18:30:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004340798] [2025-01-09 18:30:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004340798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80162634] [2025-01-09 18:30:19,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:19,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:19,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:19,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:30:19,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:30:20,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 18:30:20,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 18:30:20,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:20,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:20,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 18:30:20,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 18:30:20,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:30:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 18:30:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80162634] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 18:30:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 10 [2025-01-09 18:30:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861507346] [2025-01-09 18:30:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:20,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:30:20,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:20,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:30:20,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:30:20,908 INFO L87 Difference]: Start difference. First operand 1903 states and 2601 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-01-09 18:30:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:20,981 INFO L93 Difference]: Finished difference Result 3778 states and 5171 transitions. [2025-01-09 18:30:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:30:20,982 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-01-09 18:30:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:20,995 INFO L225 Difference]: With dead ends: 3778 [2025-01-09 18:30:20,995 INFO L226 Difference]: Without dead ends: 1904 [2025-01-09 18:30:21,000 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-01-09 18:30:21,000 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 0 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:21,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 669 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:30:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2025-01-09 18:30:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1904. [2025-01-09 18:30:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1565 states have (on average 1.3642172523961662) internal successors, (2135), 1565 states have internal predecessors, (2135), 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-01-09 18:30:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2602 transitions. [2025-01-09 18:30:21,104 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2602 transitions. Word has length 161 [2025-01-09 18:30:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:21,105 INFO L471 AbstractCegarLoop]: Abstraction has 1904 states and 2602 transitions. [2025-01-09 18:30:21,105 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-01-09 18:30:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2602 transitions. [2025-01-09 18:30:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 18:30:21,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:21,111 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-01-09 18:30:21,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 18:30:21,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:21,316 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:21,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:21,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2068670455, now seen corresponding path program 1 times [2025-01-09 18:30:21,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:21,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384105444] [2025-01-09 18:30:21,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:21,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 18:30:21,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 18:30:21,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:21,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 18:30:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384105444] [2025-01-09 18:30:22,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384105444] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75931342] [2025-01-09 18:30:22,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:22,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:22,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:30:22,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:30:22,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 18:30:23,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 18:30:23,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:23,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:23,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 18:30:23,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 18:30:23,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:30:23,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75931342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:23,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:30:23,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5] total 18 [2025-01-09 18:30:23,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988351101] [2025-01-09 18:30:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:23,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 18:30:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:23,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 18:30:23,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-01-09 18:30:23,686 INFO L87 Difference]: Start difference. First operand 1904 states and 2602 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-01-09 18:30:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:24,081 INFO L93 Difference]: Finished difference Result 3861 states and 5314 transitions. [2025-01-09 18:30:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 18:30:24,081 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-01-09 18:30:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:24,095 INFO L225 Difference]: With dead ends: 3861 [2025-01-09 18:30:24,096 INFO L226 Difference]: Without dead ends: 1990 [2025-01-09 18:30:24,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-01-09 18:30:24,103 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 11 mSDsluCounter, 4103 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4449 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:24,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4449 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:30:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2025-01-09 18:30:24,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1944. [2025-01-09 18:30:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1597 states have (on average 1.3519098309329993) internal successors, (2159), 1597 states have internal predecessors, (2159), 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-01-09 18:30:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2642 transitions. [2025-01-09 18:30:24,210 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2642 transitions. Word has length 162 [2025-01-09 18:30:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:24,210 INFO L471 AbstractCegarLoop]: Abstraction has 1944 states and 2642 transitions. [2025-01-09 18:30:24,210 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-01-09 18:30:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2642 transitions. [2025-01-09 18:30:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 18:30:24,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:24,217 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-01-09 18:30:24,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 18:30:24,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:24,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:24,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:24,422 INFO L85 PathProgramCache]: Analyzing trace with hash -901219806, now seen corresponding path program 1 times [2025-01-09 18:30:24,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:24,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717231928] [2025-01-09 18:30:24,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:24,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:24,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 18:30:24,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 18:30:24,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:24,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 18:30:25,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717231928] [2025-01-09 18:30:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717231928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142925482] [2025-01-09 18:30:25,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:25,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:25,215 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:30:25,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 18:30:25,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 18:30:26,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 18:30:26,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:26,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:26,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 1862 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 18:30:26,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 18:30:26,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:30:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 18:30:26,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142925482] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:30:26,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:30:26,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 11 [2025-01-09 18:30:26,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028648573] [2025-01-09 18:30:26,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:30:26,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 18:30:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:26,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 18:30:26,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 18:30:26,630 INFO L87 Difference]: Start difference. First operand 1944 states and 2642 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-01-09 18:30:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:26,824 INFO L93 Difference]: Finished difference Result 3873 states and 5270 transitions. [2025-01-09 18:30:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 18:30:26,824 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-01-09 18:30:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:26,836 INFO L225 Difference]: With dead ends: 3873 [2025-01-09 18:30:26,836 INFO L226 Difference]: Without dead ends: 1948 [2025-01-09 18:30:26,841 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-01-09 18:30:26,842 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:26,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1332 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:30:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-01-09 18:30:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1948. [2025-01-09 18:30:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1601 states have (on average 1.3510306058713304) internal successors, (2163), 1601 states have internal predecessors, (2163), 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-01-09 18:30:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2646 transitions. [2025-01-09 18:30:26,919 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2646 transitions. Word has length 171 [2025-01-09 18:30:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:26,919 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2646 transitions. [2025-01-09 18:30:26,920 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-01-09 18:30:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2646 transitions. [2025-01-09 18:30:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 18:30:26,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:26,925 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-01-09 18:30:26,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 18:30:27,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:27,126 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:27,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash -440921473, now seen corresponding path program 2 times [2025-01-09 18:30:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:27,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188000260] [2025-01-09 18:30:27,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:30:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:27,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-01-09 18:30:27,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 18:30:27,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 18:30:27,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-01-09 18:30:28,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:28,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188000260] [2025-01-09 18:30:28,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188000260] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:28,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683323726] [2025-01-09 18:30:28,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:30:28,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:28,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:28,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:30:28,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 18:30:28,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes.