./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--cx82310_eth.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--cx82310_eth.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 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:29:47,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:29:48,055 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:48,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:29:48,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:29:48,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:29:48,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:29:48,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:29:48,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:29:48,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:29:48,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:29:48,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:29:48,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:29:48,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:29:48,093 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:29:48,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:29:48,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:29:48,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:29:48,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:29:48,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:29:48,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:29:48,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:29:48,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:29:48,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:29:48,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:29:48,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:29:48,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:29:48,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:29:48,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:29:48,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:48,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:29:48,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:29:48,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:29:48,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:29:48,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:48,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:29:48,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:29:48,097 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 -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2025-01-09 18:29:48,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:29:48,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:29:48,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:29:48,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:29:48,396 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:29:48,398 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--cx82310_eth.ko-entry_point.cil.out.i [2025-01-09 18:29:49,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7f7a4217/29e9f3cc6b574255b2efcd63e54d2ea9/FLAGcaa9efe19 [2025-01-09 18:29:50,106 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:29:50,106 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--cx82310_eth.ko-entry_point.cil.out.i [2025-01-09 18:29:50,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7f7a4217/29e9f3cc6b574255b2efcd63e54d2ea9/FLAGcaa9efe19 [2025-01-09 18:29:50,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7f7a4217/29e9f3cc6b574255b2efcd63e54d2ea9 [2025-01-09 18:29:50,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:29:50,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:29:50,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:29:50,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:29:50,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:29:50,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:29:50" (1/1) ... [2025-01-09 18:29:50,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f80d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:50, skipping insertion in model container [2025-01-09 18:29:50,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:29:50" (1/1) ... [2025-01-09 18:29:50,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:29:51,001 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--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2025-01-09 18:29:51,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:29:51,344 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:29:51,498 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--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2025-01-09 18:29:51,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:29:51,609 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:29:51,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:51 WrapperNode [2025-01-09 18:29:51,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:29:51,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:29:51,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:29:51,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:29:51,619 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:51" (1/1) ... [2025-01-09 18:29:51,661 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:51" (1/1) ... [2025-01-09 18:29:51,722 INFO L138 Inliner]: procedures = 102, calls = 350, calls flagged for inlining = 36, calls inlined = 33, statements flattened = 1060 [2025-01-09 18:29:51,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:29:51,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:29:51,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:29:51,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:29:51,736 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:51" (1/1) ... [2025-01-09 18:29:51,737 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:51" (1/1) ... [2025-01-09 18:29:51,747 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:51" (1/1) ... [2025-01-09 18:29:51,827 INFO L175 MemorySlicer]: Split 195 memory accesses to 10 slices as follows [2, 19, 44, 2, 79, 2, 3, 17, 26, 1]. 41 percent of accesses are in the largest equivalence class. The 45 initializations are split as follows [2, 0, 0, 0, 2, 0, 0, 15, 26, 0]. The 86 writes are split as follows [0, 19, 44, 0, 19, 1, 1, 1, 0, 1]. [2025-01-09 18:29:51,828 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:51" (1/1) ... [2025-01-09 18:29:51,830 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:51" (1/1) ... [2025-01-09 18:29:51,892 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:51" (1/1) ... [2025-01-09 18:29:51,898 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:51" (1/1) ... [2025-01-09 18:29:51,911 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:51" (1/1) ... [2025-01-09 18:29:51,931 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:51" (1/1) ... [2025-01-09 18:29:51,981 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:51" (1/1) ... [2025-01-09 18:29:52,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:29:52,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:29:52,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:29:52,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:29:52,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:51" (1/1) ... [2025-01-09 18:29:52,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:52,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:29:52,052 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:52,056 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:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:29:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:29:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:29:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:29:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:29:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:29:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:29:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:29:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:29:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:29:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:29:52,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:29:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:29:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:29:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:29:52,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:29:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:29:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:29:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:29:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:29:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-01-09 18:29:52,084 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-01-09 18:29:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:29:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:29:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:29:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:29:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:29:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:29:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:29:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:29:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:29:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:29:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2025-01-09 18:29:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2025-01-09 18:29:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:29:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:29:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:29:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:29:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 18:29:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:29:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2025-01-09 18:29:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2025-01-09 18:29:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-01-09 18:29:52,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-01-09 18:29:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:29:52,090 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:29:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:29:52,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2025-01-09 18:29:52,091 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 18:29:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 18:29:52,091 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:29:52,091 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:29:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:29:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:29:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:29:52,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:29:52,099 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-01-09 18:29:52,099 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-01-09 18:29:52,099 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 18:29:52,099 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 18:29:52,099 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 18:29:52,099 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2025-01-09 18:29:52,100 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:29:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:29:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:29:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:29:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:29:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:29:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 18:29:52,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 18:29:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:29:52,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:29:52,508 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:29:52,511 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:29:52,554 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:29:58,182 INFO L? ?]: Removed 588 outVars from TransFormulas that were not future-live. [2025-01-09 18:29:58,182 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:29:58,209 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:29:58,212 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:29:58,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:29:58 BoogieIcfgContainer [2025-01-09 18:29:58,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:29:58,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:29:58,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:29:58,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:29:58,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:29:50" (1/3) ... [2025-01-09 18:29:58,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e94f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:29:58, skipping insertion in model container [2025-01-09 18:29:58,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:51" (2/3) ... [2025-01-09 18:29:58,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e94f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:29:58, skipping insertion in model container [2025-01-09 18:29:58,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:29:58" (3/3) ... [2025-01-09 18:29:58,223 INFO L128 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2025-01-09 18:29:58,239 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:29:58,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i that has 40 procedures, 412 locations, 1 initial locations, 31 loop locations, and 1 error locations. [2025-01-09 18:29:58,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:29:58,340 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;@325dc074, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:29:58,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:29:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 339 states, 252 states have (on average 1.380952380952381) internal successors, (348), 258 states have internal predecessors, (348), 63 states have call successors, (63), 23 states have call predecessors, (63), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 18:29:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 18:29:58,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:58,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:29:58,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:58,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -182410573, now seen corresponding path program 1 times [2025-01-09 18:29:58,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:58,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379491906] [2025-01-09 18:29:58,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:58,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:58,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 18:29:59,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 18:29:59,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:59,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:29:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379491906] [2025-01-09 18:29:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379491906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:59,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:59,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:29:59,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852222272] [2025-01-09 18:29:59,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:59,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:29:59,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:59,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:29:59,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:59,458 INFO L87 Difference]: Start difference. First operand has 339 states, 252 states have (on average 1.380952380952381) internal successors, (348), 258 states have internal predecessors, (348), 63 states have call successors, (63), 23 states have call predecessors, (63), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 18:30:03,487 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:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:03,681 INFO L93 Difference]: Finished difference Result 965 states and 1403 transitions. [2025-01-09 18:30:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:03,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-01-09 18:30:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:03,706 INFO L225 Difference]: With dead ends: 965 [2025-01-09 18:30:03,707 INFO L226 Difference]: Without dead ends: 615 [2025-01-09 18:30:03,716 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:03,718 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 410 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 915 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:03,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 915 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:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-09 18:30:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-01-09 18:30:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 464 states have (on average 1.3577586206896552) internal successors, (630), 464 states have internal predecessors, (630), 110 states have call successors, (110), 41 states have call predecessors, (110), 40 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 18:30:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 849 transitions. [2025-01-09 18:30:03,855 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 849 transitions. Word has length 36 [2025-01-09 18:30:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:03,855 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 849 transitions. [2025-01-09 18:30:03,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 18:30:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 849 transitions. [2025-01-09 18:30:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 18:30:03,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:03,862 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, 1, 1, 1, 1] [2025-01-09 18:30:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:30:03,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:03,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1967513447, now seen corresponding path program 1 times [2025-01-09 18:30:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:03,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709382455] [2025-01-09 18:30:03,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:03,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:04,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 18:30:04,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 18:30:04,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:04,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:04,640 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,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:04,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709382455] [2025-01-09 18:30:04,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709382455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:04,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:04,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:30:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725808450] [2025-01-09 18:30:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:04,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:30:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:04,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:30:04,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:04,644 INFO L87 Difference]: Start difference. First operand 615 states and 849 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 18:30:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:04,827 INFO L93 Difference]: Finished difference Result 1806 states and 2523 transitions. [2025-01-09 18:30:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:30:04,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-01-09 18:30:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:04,838 INFO L225 Difference]: With dead ends: 1806 [2025-01-09 18:30:04,838 INFO L226 Difference]: Without dead ends: 1203 [2025-01-09 18:30:04,845 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:04,846 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 422 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1881 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:04,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1881 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:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-01-09 18:30:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2025-01-09 18:30:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 908 states have (on average 1.3579295154185023) internal successors, (1233), 908 states have internal predecessors, (1233), 216 states have call successors, (216), 79 states have call predecessors, (216), 78 states have return successors, (225), 215 states have call predecessors, (225), 215 states have call successors, (225) [2025-01-09 18:30:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1674 transitions. [2025-01-09 18:30:04,937 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1674 transitions. Word has length 46 [2025-01-09 18:30:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:04,938 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1674 transitions. [2025-01-09 18:30:04,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 18:30:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1674 transitions. [2025-01-09 18:30:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 18:30:04,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:04,946 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:30:04,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:30:04,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:04,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash -89256111, now seen corresponding path program 1 times [2025-01-09 18:30:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676926952] [2025-01-09 18:30:04,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:04,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:05,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 18:30:05,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 18:30:05,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:05,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:30:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:05,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676926952] [2025-01-09 18:30:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676926952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:05,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:05,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430370159] [2025-01-09 18:30:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:05,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:05,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:05,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:05,457 INFO L87 Difference]: Start difference. First operand 1203 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:30:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:05,597 INFO L93 Difference]: Finished difference Result 2618 states and 3658 transitions. [2025-01-09 18:30:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:05,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2025-01-09 18:30:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:05,610 INFO L225 Difference]: With dead ends: 2618 [2025-01-09 18:30:05,610 INFO L226 Difference]: Without dead ends: 1433 [2025-01-09 18:30:05,616 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:05,617 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 112 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 869 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:05,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 869 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:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-01-09 18:30:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1424. [2025-01-09 18:30:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1106 states have (on average 1.379746835443038) internal successors, (1526), 1106 states have internal predecessors, (1526), 229 states have call successors, (229), 89 states have call predecessors, (229), 88 states have return successors, (238), 228 states have call predecessors, (238), 228 states have call successors, (238) [2025-01-09 18:30:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1993 transitions. [2025-01-09 18:30:05,729 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1993 transitions. Word has length 83 [2025-01-09 18:30:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:05,730 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 1993 transitions. [2025-01-09 18:30:05,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:30:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1993 transitions. [2025-01-09 18:30:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 18:30:05,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:05,735 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-01-09 18:30:05,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:30:05,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:05,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -681968612, now seen corresponding path program 1 times [2025-01-09 18:30:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811542181] [2025-01-09 18:30:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:06,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 18:30:06,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 18:30:06,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:06,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 18:30:06,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:06,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811542181] [2025-01-09 18:30:06,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811542181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:06,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:06,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:06,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036906146] [2025-01-09 18:30:06,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:06,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:06,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:06,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:06,182 INFO L87 Difference]: Start difference. First operand 1424 states and 1993 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 18:30:10,199 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:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:10,351 INFO L93 Difference]: Finished difference Result 3576 states and 4988 transitions. [2025-01-09 18:30:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:10,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 111 [2025-01-09 18:30:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:10,365 INFO L225 Difference]: With dead ends: 3576 [2025-01-09 18:30:10,365 INFO L226 Difference]: Without dead ends: 2181 [2025-01-09 18:30:10,371 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,372 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 394 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 876 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:10,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 876 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:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-01-09 18:30:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2172. [2025-01-09 18:30:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 1692 states have (on average 1.367612293144208) internal successors, (2314), 1692 states have internal predecessors, (2314), 331 states have call successors, (331), 149 states have call predecessors, (331), 148 states have return successors, (346), 330 states have call predecessors, (346), 330 states have call successors, (346) [2025-01-09 18:30:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2991 transitions. [2025-01-09 18:30:10,493 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2991 transitions. Word has length 111 [2025-01-09 18:30:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:10,494 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 2991 transitions. [2025-01-09 18:30:10,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 18:30:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2991 transitions. [2025-01-09 18:30:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 18:30:10,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:10,499 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-01-09 18:30:10,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:30:10,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:10,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1153736770, now seen corresponding path program 1 times [2025-01-09 18:30:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409157883] [2025-01-09 18:30:10,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:10,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 18:30:10,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 18:30:10,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:10,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 18:30:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409157883] [2025-01-09 18:30:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409157883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:30:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271933160] [2025-01-09 18:30:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:30:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:11,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:30:11,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:11,332 INFO L87 Difference]: Start difference. First operand 2172 states and 2991 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 18:30:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:11,445 INFO L93 Difference]: Finished difference Result 4353 states and 6054 transitions. [2025-01-09 18:30:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:30:11,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-01-09 18:30:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:11,486 INFO L225 Difference]: With dead ends: 4353 [2025-01-09 18:30:11,486 INFO L226 Difference]: Without dead ends: 2210 [2025-01-09 18:30:11,492 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:11,493 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1787 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:11,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1787 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:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2025-01-09 18:30:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2204. [2025-01-09 18:30:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 1716 states have (on average 1.3624708624708626) internal successors, (2338), 1716 states have internal predecessors, (2338), 331 states have call successors, (331), 149 states have call predecessors, (331), 156 states have return successors, (364), 338 states have call predecessors, (364), 330 states have call successors, (364) [2025-01-09 18:30:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 3033 transitions. [2025-01-09 18:30:11,593 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 3033 transitions. Word has length 111 [2025-01-09 18:30:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:11,594 INFO L471 AbstractCegarLoop]: Abstraction has 2204 states and 3033 transitions. [2025-01-09 18:30:11,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 18:30:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 3033 transitions. [2025-01-09 18:30:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 18:30:11,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:11,599 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 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] [2025-01-09 18:30:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:30:11,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:11,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -379957482, now seen corresponding path program 1 times [2025-01-09 18:30:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229010504] [2025-01-09 18:30:11,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:11,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 18:30:11,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 18:30:11,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:11,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 18:30:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229010504] [2025-01-09 18:30:12,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229010504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:12,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:12,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 18:30:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985567929] [2025-01-09 18:30:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 18:30:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:12,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 18:30:12,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 18:30:12,428 INFO L87 Difference]: Start difference. First operand 2204 states and 3033 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 9 states have internal predecessors, (78), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 18:30:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:12,672 INFO L93 Difference]: Finished difference Result 4435 states and 6142 transitions. [2025-01-09 18:30:12,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 18:30:12,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 9 states have internal predecessors, (78), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 18:30:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:12,691 INFO L225 Difference]: With dead ends: 4435 [2025-01-09 18:30:12,692 INFO L226 Difference]: Without dead ends: 2260 [2025-01-09 18:30:12,701 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:12,702 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 15 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:12,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4430 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:30:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2025-01-09 18:30:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2236. [2025-01-09 18:30:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 1740 states have (on average 1.3574712643678162) internal successors, (2362), 1740 states have internal predecessors, (2362), 331 states have call successors, (331), 149 states have call predecessors, (331), 164 states have return successors, (372), 346 states have call predecessors, (372), 330 states have call successors, (372) [2025-01-09 18:30:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 3065 transitions. [2025-01-09 18:30:12,813 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 3065 transitions. Word has length 118 [2025-01-09 18:30:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:12,814 INFO L471 AbstractCegarLoop]: Abstraction has 2236 states and 3065 transitions. [2025-01-09 18:30:12,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 9 states have internal predecessors, (78), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 18:30:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 3065 transitions. [2025-01-09 18:30:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 18:30:12,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:12,822 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:30:12,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 141087052, now seen corresponding path program 1 times [2025-01-09 18:30:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:12,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679745795] [2025-01-09 18:30:12,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:13,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 18:30:13,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 18:30:13,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:13,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 18:30:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679745795] [2025-01-09 18:30:13,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679745795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346642055] [2025-01-09 18:30:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:13,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:13,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:13,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:13,263 INFO L87 Difference]: Start difference. First operand 2236 states and 3065 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:30:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:13,343 INFO L93 Difference]: Finished difference Result 4451 states and 6126 transitions. [2025-01-09 18:30:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2025-01-09 18:30:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:13,357 INFO L225 Difference]: With dead ends: 4451 [2025-01-09 18:30:13,358 INFO L226 Difference]: Without dead ends: 2244 [2025-01-09 18:30:13,365 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:13,365 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 894 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:13,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 894 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:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2025-01-09 18:30:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2244. [2025-01-09 18:30:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 1748 states have (on average 1.3558352402745995) internal successors, (2370), 1748 states have internal predecessors, (2370), 331 states have call successors, (331), 149 states have call predecessors, (331), 164 states have return successors, (372), 346 states have call predecessors, (372), 330 states have call successors, (372) [2025-01-09 18:30:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3073 transitions. [2025-01-09 18:30:13,469 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3073 transitions. Word has length 144 [2025-01-09 18:30:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:13,469 INFO L471 AbstractCegarLoop]: Abstraction has 2244 states and 3073 transitions. [2025-01-09 18:30:13,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:30:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3073 transitions. [2025-01-09 18:30:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 18:30:13,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:13,474 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:30:13,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:13,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 574816138, now seen corresponding path program 1 times [2025-01-09 18:30:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:13,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069115488] [2025-01-09 18:30:13,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:13,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 18:30:13,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 18:30:13,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:13,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 18:30:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069115488] [2025-01-09 18:30:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069115488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:14,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:30:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034852271] [2025-01-09 18:30:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:14,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:30:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:14,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:30:14,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:30:14,255 INFO L87 Difference]: Start difference. First operand 2244 states and 3073 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:30:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:14,344 INFO L93 Difference]: Finished difference Result 4469 states and 6126 transitions. [2025-01-09 18:30:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:30:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2025-01-09 18:30:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:14,360 INFO L225 Difference]: With dead ends: 4469 [2025-01-09 18:30:14,360 INFO L226 Difference]: Without dead ends: 2245 [2025-01-09 18:30:14,367 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:14,367 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1342 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:14,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1342 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:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2025-01-09 18:30:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2025-01-09 18:30:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1749 states have (on average 1.3556317895940537) internal successors, (2371), 1749 states have internal predecessors, (2371), 331 states have call successors, (331), 149 states have call predecessors, (331), 164 states have return successors, (372), 346 states have call predecessors, (372), 330 states have call successors, (372) [2025-01-09 18:30:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3074 transitions. [2025-01-09 18:30:14,477 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3074 transitions. Word has length 144 [2025-01-09 18:30:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:14,477 INFO L471 AbstractCegarLoop]: Abstraction has 2245 states and 3074 transitions. [2025-01-09 18:30:14,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:30:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3074 transitions. [2025-01-09 18:30:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 18:30:14,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:14,509 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:30:14,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:14,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 706306191, now seen corresponding path program 1 times [2025-01-09 18:30:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895896449] [2025-01-09 18:30:14,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:14,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 18:30:14,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 18:30:14,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:14,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 18:30:15,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:15,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895896449] [2025-01-09 18:30:15,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895896449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:15,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001790975] [2025-01-09 18:30:15,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:15,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:15,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:15,357 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:15,389 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:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 18:30:16,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 18:30:16,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:16,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:16,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 18:30:16,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 18:30:16,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:30:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 18:30:16,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001790975] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 18:30:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 10 [2025-01-09 18:30:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759015476] [2025-01-09 18:30:16,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:16,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:30:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:16,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:30:16,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:30:16,817 INFO L87 Difference]: Start difference. First operand 2245 states and 3074 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:30:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:16,904 INFO L93 Difference]: Finished difference Result 4464 states and 6120 transitions. [2025-01-09 18:30:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:30:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 145 [2025-01-09 18:30:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:16,923 INFO L225 Difference]: With dead ends: 4464 [2025-01-09 18:30:16,923 INFO L226 Difference]: Without dead ends: 2246 [2025-01-09 18:30:16,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 285 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:16,933 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 895 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:16,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 895 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:16,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-01-09 18:30:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2025-01-09 18:30:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1750 states have (on average 1.3554285714285714) internal successors, (2372), 1750 states have internal predecessors, (2372), 331 states have call successors, (331), 149 states have call predecessors, (331), 164 states have return successors, (372), 346 states have call predecessors, (372), 330 states have call successors, (372) [2025-01-09 18:30:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3075 transitions. [2025-01-09 18:30:17,039 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3075 transitions. Word has length 145 [2025-01-09 18:30:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:17,040 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3075 transitions. [2025-01-09 18:30:17,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:30:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3075 transitions. [2025-01-09 18:30:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 18:30:17,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:17,047 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 18:30:17,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:17,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:17,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash 4173703, now seen corresponding path program 1 times [2025-01-09 18:30:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:17,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838812575] [2025-01-09 18:30:17,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:17,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 18:30:17,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 18:30:17,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:17,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 18:30:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:18,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838812575] [2025-01-09 18:30:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838812575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:18,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287412974] [2025-01-09 18:30:18,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:18,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:18,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:18,084 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:18,086 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:18,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 18:30:19,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 18:30:19,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:19,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:19,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 18:30:19,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 18:30:19,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:30:19,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287412974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:19,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:30:19,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5] total 19 [2025-01-09 18:30:19,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436137426] [2025-01-09 18:30:19,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:19,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 18:30:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:19,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 18:30:19,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-01-09 18:30:19,653 INFO L87 Difference]: Start difference. First operand 2246 states and 3075 transitions. Second operand has 16 states, 15 states have (on average 6.466666666666667) internal successors, (97), 12 states have internal predecessors, (97), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 18:30:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:20,091 INFO L93 Difference]: Finished difference Result 4795 states and 6662 transitions. [2025-01-09 18:30:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 18:30:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.466666666666667) internal successors, (97), 12 states have internal predecessors, (97), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) Word has length 146 [2025-01-09 18:30:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:20,108 INFO L225 Difference]: With dead ends: 4795 [2025-01-09 18:30:20,108 INFO L226 Difference]: Without dead ends: 2580 [2025-01-09 18:30:20,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-01-09 18:30:20,116 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 34 mSDsluCounter, 6877 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 7374 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:20,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 7374 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:30:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2025-01-09 18:30:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2302. [2025-01-09 18:30:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 1790 states have (on average 1.3430167597765363) internal successors, (2404), 1790 states have internal predecessors, (2404), 339 states have call successors, (339), 149 states have call predecessors, (339), 172 states have return successors, (396), 362 states have call predecessors, (396), 338 states have call successors, (396) [2025-01-09 18:30:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3139 transitions. [2025-01-09 18:30:20,227 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3139 transitions. Word has length 146 [2025-01-09 18:30:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:20,227 INFO L471 AbstractCegarLoop]: Abstraction has 2302 states and 3139 transitions. [2025-01-09 18:30:20,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.466666666666667) internal successors, (97), 12 states have internal predecessors, (97), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 18:30:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3139 transitions. [2025-01-09 18:30:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 18:30:20,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:20,237 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 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] [2025-01-09 18:30:20,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 18:30:20,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:20,442 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:20,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:20,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1675086674, now seen corresponding path program 1 times [2025-01-09 18:30:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785687385] [2025-01-09 18:30:20,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:20,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:20,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 18:30:20,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 18:30:20,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:20,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 18:30:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785687385] [2025-01-09 18:30:21,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785687385] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997926946] [2025-01-09 18:30:21,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:21,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:21,286 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:21,288 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:22,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 18:30:22,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 18:30:22,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:22,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:22,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 18:30:22,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 18:30:22,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:30:22,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997926946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:22,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:30:22,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5] total 19 [2025-01-09 18:30:22,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848478868] [2025-01-09 18:30:22,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:22,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 18:30:22,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:22,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 18:30:22,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-01-09 18:30:22,885 INFO L87 Difference]: Start difference. First operand 2302 states and 3139 transitions. Second operand has 16 states, 15 states have (on average 5.6) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 18:30:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:23,339 INFO L93 Difference]: Finished difference Result 4899 states and 6750 transitions. [2025-01-09 18:30:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 18:30:23,340 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.6) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) Word has length 126 [2025-01-09 18:30:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:23,358 INFO L225 Difference]: With dead ends: 4899 [2025-01-09 18:30:23,359 INFO L226 Difference]: Without dead ends: 2628 [2025-01-09 18:30:23,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-01-09 18:30:23,368 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 38 mSDsluCounter, 6468 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6972 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:23,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6972 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:30:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2025-01-09 18:30:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2318. [2025-01-09 18:30:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 1806 states have (on average 1.3399778516057586) internal successors, (2420), 1798 states have internal predecessors, (2420), 339 states have call successors, (339), 149 states have call predecessors, (339), 172 states have return successors, (396), 370 states have call predecessors, (396), 338 states have call successors, (396) [2025-01-09 18:30:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3155 transitions. [2025-01-09 18:30:23,474 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3155 transitions. Word has length 126 [2025-01-09 18:30:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:23,475 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 3155 transitions. [2025-01-09 18:30:23,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.6) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 18:30:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3155 transitions. [2025-01-09 18:30:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 18:30:23,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:23,483 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,495 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:23,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:23,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:23,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2057386350, now seen corresponding path program 1 times [2025-01-09 18:30:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:23,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054838575] [2025-01-09 18:30:23,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:23,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 18:30:24,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 18:30:24,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:24,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 18:30:24,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:24,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054838575] [2025-01-09 18:30:24,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054838575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:24,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734251170] [2025-01-09 18:30:24,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:24,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:24,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:24,417 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:24,419 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:25,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 18:30:25,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 18:30:25,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:25,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:25,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 18:30:25,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-09 18:30:25,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:30:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 18:30:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734251170] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:30:25,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:30:25,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 18:30:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017841900] [2025-01-09 18:30:25,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:30:25,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 18:30:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:25,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 18:30:25,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:30:25,933 INFO L87 Difference]: Start difference. First operand 2318 states and 3155 transitions. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 18:30:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:26,060 INFO L93 Difference]: Finished difference Result 4620 states and 6295 transitions. [2025-01-09 18:30:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 18:30:26,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 176 [2025-01-09 18:30:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:26,076 INFO L225 Difference]: With dead ends: 4620 [2025-01-09 18:30:26,077 INFO L226 Difference]: Without dead ends: 2321 [2025-01-09 18:30:26,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:30:26,085 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:26,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2236 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:30:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-01-09 18:30:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2025-01-09 18:30:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 1809 states have (on average 1.3394140409065782) internal successors, (2423), 1801 states have internal predecessors, (2423), 339 states have call successors, (339), 149 states have call predecessors, (339), 172 states have return successors, (396), 370 states have call predecessors, (396), 338 states have call successors, (396) [2025-01-09 18:30:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3158 transitions. [2025-01-09 18:30:26,242 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3158 transitions. Word has length 176 [2025-01-09 18:30:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:26,244 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 3158 transitions. [2025-01-09 18:30:26,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 18:30:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3158 transitions. [2025-01-09 18:30:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 18:30:26,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:26,252 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 18:30:26,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 18:30:26,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:26,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1728267821, now seen corresponding path program 2 times [2025-01-09 18:30:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357904874] [2025-01-09 18:30:26,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:30:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:26,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 179 statements into 2 equivalence classes. [2025-01-09 18:30:26,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 18:30:26,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 18:30:26,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 18:30:27,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:27,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357904874] [2025-01-09 18:30:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357904874] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:27,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521541507] [2025-01-09 18:30:27,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:30:27,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:27,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:27,322 INFO L229 MonitoredProcess]: Starting monitored process 6 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:27,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 18:30:28,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 179 statements into 2 equivalence classes.