./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:00:39,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:00:39,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:00:39,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:00:39,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:00:39,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:00:39,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:00:39,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:00:39,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:00:39,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:00:39,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:00:39,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:00:39,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:00:39,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:39,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:00:39,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2025-03-04 04:00:39,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:00:39,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:00:39,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:00:39,743 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:00:39,744 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:00:39,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2025-03-04 04:00:40,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221e3b21c/9200a1a910044358ba5f0277c986c599/FLAG84c80b0b0 [2025-03-04 04:00:41,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:00:41,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2025-03-04 04:00:41,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221e3b21c/9200a1a910044358ba5f0277c986c599/FLAG84c80b0b0 [2025-03-04 04:00:41,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221e3b21c/9200a1a910044358ba5f0277c986c599 [2025-03-04 04:00:41,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:00:41,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:00:41,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:41,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:00:41,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:00:41,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:41" (1/1) ... [2025-03-04 04:00:41,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733a6b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:41, skipping insertion in model container [2025-03-04 04:00:41,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:41" (1/1) ... [2025-03-04 04:00:41,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:00:41,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2025-03-04 04:00:42,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:42,028 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:00:42,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2025-03-04 04:00:42,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:42,230 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:00:42,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42 WrapperNode [2025-03-04 04:00:42,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:42,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:42,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:00:42,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:00:42,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,291 INFO L138 Inliner]: procedures = 102, calls = 350, calls flagged for inlining = 36, calls inlined = 33, statements flattened = 1060 [2025-03-04 04:00:42,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:42,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:00:42,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:00:42,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:00:42,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,357 INFO L175 MemorySlicer]: Split 195 memory accesses to 10 slices as follows [19, 2, 44, 3, 2, 79, 2, 17, 26, 1]. 41 percent of accesses are in the largest equivalence class. The 45 initializations are split as follows [0, 2, 0, 0, 0, 2, 0, 15, 26, 0]. The 86 writes are split as follows [19, 0, 44, 1, 0, 19, 1, 1, 0, 1]. [2025-03-04 04:00:42,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:00:42,481 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:00:42,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:00:42,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:00:42,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:42,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:00:42,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:00:42,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:00:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:00:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:00:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:00:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:00:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:00:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:00:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-03-04 04:00:42,530 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:00:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:00:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:00:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:00:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:00:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:00:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:00:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:00:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:00:42,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:00:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 04:00:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:00:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2025-03-04 04:00:42,533 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2025-03-04 04:00:42,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-04 04:00:42,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:00:42,533 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:00:42,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2025-03-04 04:00:42,533 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 04:00:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 04:00:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 04:00:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 04:00:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 04:00:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 04:00:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 04:00:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 04:00:42,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 04:00:42,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 04:00:42,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 04:00:42,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2025-03-04 04:00:42,537 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:00:42,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:00:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-03-04 04:00:42,538 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 04:00:42,538 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 04:00:42,538 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2025-03-04 04:00:42,538 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:00:42,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:00:42,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:00:42,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 04:00:42,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 04:00:42,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 04:00:42,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:00:42,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:00:42,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:00:42,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:00:42,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6480: havoc #t~nondet214; [2025-03-04 04:00:42,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:00:42,926 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6462: havoc skb_copy_expand_#t~ret208#1.base, skb_copy_expand_#t~ret208#1.offset; [2025-03-04 04:00:42,926 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5501: havoc skb_headroom_#t~mem26#1.base, skb_headroom_#t~mem26#1.offset;havoc skb_headroom_#t~mem27#1.base, skb_headroom_#t~mem27#1.offset; [2025-03-04 04:00:42,926 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6468: havoc skb_push_#t~ret210#1.base, skb_push_#t~ret210#1.offset; [2025-03-04 04:00:42,940 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5623: havoc #t~mem53;havoc #t~bitwise54; [2025-03-04 04:00:43,156 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6465: havoc #t~ret209.base, #t~ret209.offset; [2025-03-04 04:00:43,486 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6455: havoc #t~nondet206; [2025-03-04 04:00:43,490 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5465: havoc __kmalloc_#t~ret8#1.base, __kmalloc_#t~ret8#1.offset; [2025-03-04 04:00:43,545 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5636: call ULTIMATE.dealloc(~#actual_len~0#1.base, ~#actual_len~0#1.offset);havoc ~#actual_len~0#1.base, ~#actual_len~0#1.offset; [2025-03-04 04:00:47,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6502: havoc usbnet_probe_#t~nondet218#1; [2025-03-04 04:00:47,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5975: call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-04 04:00:47,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6487: havoc usb_register_driver_#t~nondet215#1; [2025-03-04 04:00:47,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6513: havoc usbnet_suspend_#t~nondet220#1; [2025-03-04 04:00:47,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6506: havoc usbnet_resume_#t~nondet219#1; [2025-03-04 04:00:47,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5738: call ULTIMATE.dealloc(cx82310_bind_~#buf~1#1.base, cx82310_bind_~#buf~1#1.offset);havoc cx82310_bind_~#buf~1#1.base, cx82310_bind_~#buf~1#1.offset; [2025-03-04 04:00:47,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6498: havoc usbnet_get_endpoints_#t~nondet217#1; [2025-03-04 04:00:47,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6491: havoc usb_string_#t~nondet216#1; [2025-03-04 04:00:47,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6459: havoc ldv_reset_resume_1_#t~nondet207#1; [2025-03-04 04:00:47,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6451: havoc _dev_info_#t~nondet205#1; [2025-03-04 04:00:47,965 INFO L? ?]: Removed 588 outVars from TransFormulas that were not future-live. [2025-03-04 04:00:47,965 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:00:47,993 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:00:47,994 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:00:47,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:47 BoogieIcfgContainer [2025-03-04 04:00:47,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:00:47,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:00:47,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:00:47,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:00:47,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:00:41" (1/3) ... [2025-03-04 04:00:48,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aeea78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:00:48, skipping insertion in model container [2025-03-04 04:00:48,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (2/3) ... [2025-03-04 04:00:48,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aeea78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:00:48, skipping insertion in model container [2025-03-04 04:00:48,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:47" (3/3) ... [2025-03-04 04:00:48,002 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-03-04 04:00:48,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:00:48,014 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, 411 locations, 1 initial locations, 31 loop locations, and 1 error locations. [2025-03-04 04:00:48,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:00:48,072 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;@7a9ba1d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:00:48,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:00:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 338 states, 251 states have (on average 1.3824701195219125) internal successors, (347), 257 states have internal predecessors, (347), 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-03-04 04:00:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 04:00:48,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:48,086 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-03-04 04:00:48,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:48,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1694108663, now seen corresponding path program 1 times [2025-03-04 04:00:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:48,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003966376] [2025-03-04 04:00:48,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:48,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 04:00:48,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 04:00:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 04:00:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003966376] [2025-03-04 04:00:48,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003966376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:48,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193959129] [2025-03-04 04:00:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:48,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:48,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:48,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:48,927 INFO L87 Difference]: Start difference. First operand has 338 states, 251 states have (on average 1.3824701195219125) internal successors, (347), 257 states have internal predecessors, (347), 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-03-04 04:00:52,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:00:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:53,071 INFO L93 Difference]: Finished difference Result 962 states and 1400 transitions. [2025-03-04 04:00:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:53,072 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-03-04 04:00:53,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:53,081 INFO L225 Difference]: With dead ends: 962 [2025-03-04 04:00:53,081 INFO L226 Difference]: Without dead ends: 613 [2025-03-04 04:00:53,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:53,089 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 409 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:53,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 905 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:00:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-04 04:00:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2025-03-04 04:00:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 462 states have (on average 1.3593073593073592) internal successors, (628), 462 states have internal predecessors, (628), 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-03-04 04:00:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 847 transitions. [2025-03-04 04:00:53,168 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 847 transitions. Word has length 36 [2025-03-04 04:00:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:53,169 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 847 transitions. [2025-03-04 04:00:53,169 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-03-04 04:00:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 847 transitions. [2025-03-04 04:00:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 04:00:53,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:53,173 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-03-04 04:00:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:00:53,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:53,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash -927074266, now seen corresponding path program 1 times [2025-03-04 04:00:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:53,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583320233] [2025-03-04 04:00:53,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:53,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:53,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 04:00:53,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 04:00:53,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:53,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 04:00:53,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:53,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583320233] [2025-03-04 04:00:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583320233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:53,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:00:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849999717] [2025-03-04 04:00:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:53,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:00:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:53,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:00:53,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:00:53,768 INFO L87 Difference]: Start difference. First operand 613 states and 847 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-03-04 04:00:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:53,925 INFO L93 Difference]: Finished difference Result 1800 states and 2517 transitions. [2025-03-04 04:00:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:00:53,925 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-03-04 04:00:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:53,936 INFO L225 Difference]: With dead ends: 1800 [2025-03-04 04:00:53,936 INFO L226 Difference]: Without dead ends: 1199 [2025-03-04 04:00:53,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:00:53,940 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 421 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:53,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1861 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:00:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-03-04 04:00:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2025-03-04 04:00:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 904 states have (on average 1.3595132743362832) internal successors, (1229), 904 states have internal predecessors, (1229), 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-03-04 04:00:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1670 transitions. [2025-03-04 04:00:54,021 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1670 transitions. Word has length 46 [2025-03-04 04:00:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:54,022 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1670 transitions. [2025-03-04 04:00:54,022 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-03-04 04:00:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1670 transitions. [2025-03-04 04:00:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 04:00:54,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:54,030 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-03-04 04:00:54,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:00:54,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:54,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:54,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1894037584, now seen corresponding path program 1 times [2025-03-04 04:00:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:54,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150658184] [2025-03-04 04:00:54,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:54,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 04:00:54,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 04:00:54,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:54,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 04:00:54,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:54,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150658184] [2025-03-04 04:00:54,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150658184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:54,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:54,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006776304] [2025-03-04 04:00:54,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:54,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:54,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:54,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:54,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:54,395 INFO L87 Difference]: Start difference. First operand 1199 states and 1670 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-03-04 04:00:54,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:54,497 INFO L93 Difference]: Finished difference Result 2610 states and 3650 transitions. [2025-03-04 04:00:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:54,498 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-03-04 04:00:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:54,506 INFO L225 Difference]: With dead ends: 2610 [2025-03-04 04:00:54,508 INFO L226 Difference]: Without dead ends: 1429 [2025-03-04 04:00:54,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:54,512 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 112 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:54,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 859 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:00:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-04 04:00:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1420. [2025-03-04 04:00:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1102 states have (on average 1.381125226860254) internal successors, (1522), 1102 states have internal predecessors, (1522), 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-03-04 04:00:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1989 transitions. [2025-03-04 04:00:54,562 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1989 transitions. Word has length 83 [2025-03-04 04:00:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 1989 transitions. [2025-03-04 04:00:54,563 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-03-04 04:00:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1989 transitions. [2025-03-04 04:00:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 04:00:54,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:54,566 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-03-04 04:00:54,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:00:54,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash 753133792, now seen corresponding path program 1 times [2025-03-04 04:00:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13673822] [2025-03-04 04:00:54,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:54,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 04:00:54,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 04:00:54,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:54,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 04:00:55,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:55,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13673822] [2025-03-04 04:00:55,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13673822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:55,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:55,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:55,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417426626] [2025-03-04 04:00:55,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:55,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:55,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:55,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:55,015 INFO L87 Difference]: Start difference. First operand 1420 states and 1989 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-03-04 04:00:59,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:00:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:59,184 INFO L93 Difference]: Finished difference Result 3564 states and 4976 transitions. [2025-03-04 04:00:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:59,184 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-03-04 04:00:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:59,197 INFO L225 Difference]: With dead ends: 3564 [2025-03-04 04:00:59,197 INFO L226 Difference]: Without dead ends: 2173 [2025-03-04 04:00:59,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:59,203 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 393 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:59,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 869 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:00:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2025-03-04 04:00:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2164. [2025-03-04 04:00:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 1684 states have (on average 1.3693586698337292) internal successors, (2306), 1684 states have internal predecessors, (2306), 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-03-04 04:00:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 2983 transitions. [2025-03-04 04:00:59,317 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 2983 transitions. Word has length 111 [2025-03-04 04:00:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:59,319 INFO L471 AbstractCegarLoop]: Abstraction has 2164 states and 2983 transitions. [2025-03-04 04:00:59,319 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-03-04 04:00:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2983 transitions. [2025-03-04 04:00:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 04:00:59,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:59,328 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-03-04 04:00:59,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:00:59,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash 220736324, now seen corresponding path program 1 times [2025-03-04 04:00:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364855893] [2025-03-04 04:00:59,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:59,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 04:00:59,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 04:00:59,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:59,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-04 04:00:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364855893] [2025-03-04 04:00:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364855893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:00:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578326495] [2025-03-04 04:00:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:00:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:59,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:00:59,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:00:59,828 INFO L87 Difference]: Start difference. First operand 2164 states and 2983 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-03-04 04:00:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:59,936 INFO L93 Difference]: Finished difference Result 4337 states and 6038 transitions. [2025-03-04 04:00:59,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:00:59,937 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-03-04 04:00:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:59,948 INFO L225 Difference]: With dead ends: 4337 [2025-03-04 04:00:59,948 INFO L226 Difference]: Without dead ends: 2202 [2025-03-04 04:00:59,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:00:59,954 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:59,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1767 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:00:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2025-03-04 04:01:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2196. [2025-03-04 04:01:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 1708 states have (on average 1.364168618266979) internal successors, (2330), 1708 states have internal predecessors, (2330), 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-03-04 04:01:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3025 transitions. [2025-03-04 04:01:00,035 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3025 transitions. Word has length 111 [2025-03-04 04:01:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:00,036 INFO L471 AbstractCegarLoop]: Abstraction has 2196 states and 3025 transitions. [2025-03-04 04:01:00,036 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-03-04 04:01:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3025 transitions. [2025-03-04 04:01:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 04:01:00,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:00,040 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-03-04 04:01:00,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:01:00,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -330117515, now seen corresponding path program 1 times [2025-03-04 04:01:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910320259] [2025-03-04 04:01:00,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:00,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 04:01:00,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 04:01:00,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:00,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-04 04:01:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:00,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910320259] [2025-03-04 04:01:00,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910320259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:00,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 04:01:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770183598] [2025-03-04 04:01:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:00,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 04:01:00,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:00,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 04:01:00,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:01:00,597 INFO L87 Difference]: Start difference. First operand 2196 states and 3025 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-03-04 04:01:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:00,768 INFO L93 Difference]: Finished difference Result 4419 states and 6126 transitions. [2025-03-04 04:01:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 04:01:00,768 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-03-04 04:01:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:00,779 INFO L225 Difference]: With dead ends: 4419 [2025-03-04 04:01:00,779 INFO L226 Difference]: Without dead ends: 2252 [2025-03-04 04:01:00,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 04:01:00,785 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 13 mSDsluCounter, 3941 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4382 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:00,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4382 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2025-03-04 04:01:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2228. [2025-03-04 04:01:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1732 states have (on average 1.3591224018475752) internal successors, (2354), 1732 states have internal predecessors, (2354), 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-03-04 04:01:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3057 transitions. [2025-03-04 04:01:00,857 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3057 transitions. Word has length 118 [2025-03-04 04:01:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:00,857 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 3057 transitions. [2025-03-04 04:01:00,857 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-03-04 04:01:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3057 transitions. [2025-03-04 04:01:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 04:01:00,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:00,861 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-03-04 04:01:00,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:01:00,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:00,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 939006528, now seen corresponding path program 1 times [2025-03-04 04:01:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:00,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219326240] [2025-03-04 04:01:00,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:01,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 04:01:01,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 04:01:01,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:01,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 04:01:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219326240] [2025-03-04 04:01:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219326240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:01,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:01:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128327026] [2025-03-04 04:01:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:01:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:01,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:01:01,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:01:01,404 INFO L87 Difference]: Start difference. First operand 2228 states and 3057 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-03-04 04:01:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:01,508 INFO L93 Difference]: Finished difference Result 4437 states and 6094 transitions. [2025-03-04 04:01:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:01:01,509 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-03-04 04:01:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:01,517 INFO L225 Difference]: With dead ends: 4437 [2025-03-04 04:01:01,518 INFO L226 Difference]: Without dead ends: 2229 [2025-03-04 04:01:01,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:01:01,522 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:01,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1327 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2025-03-04 04:01:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2229. [2025-03-04 04:01:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 1733 states have (on average 1.3589151759953837) internal successors, (2355), 1733 states have internal predecessors, (2355), 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-03-04 04:01:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 3058 transitions. [2025-03-04 04:01:01,610 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 3058 transitions. Word has length 144 [2025-03-04 04:01:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:01,611 INFO L471 AbstractCegarLoop]: Abstraction has 2229 states and 3058 transitions. [2025-03-04 04:01:01,611 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-03-04 04:01:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 3058 transitions. [2025-03-04 04:01:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 04:01:01,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:01,614 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-03-04 04:01:01,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:01:01,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:01,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:01,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1120126357, now seen corresponding path program 1 times [2025-03-04 04:01:01,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:01,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791641484] [2025-03-04 04:01:01,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:01,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 04:01:01,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 04:01:01,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 04:01:02,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:02,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791641484] [2025-03-04 04:01:02,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791641484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:02,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713928863] [2025-03-04 04:01:02,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:02,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:02,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:02,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:01:02,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:01:02,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 04:01:03,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 04:01:03,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:03,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:03,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 04:01:03,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 04:01:03,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:01:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 04:01:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713928863] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:03,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 04:01:03,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 10 [2025-03-04 04:01:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682290429] [2025-03-04 04:01:03,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:03,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:01:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:03,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:01:03,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:01:03,317 INFO L87 Difference]: Start difference. First operand 2229 states and 3058 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-03-04 04:01:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:03,408 INFO L93 Difference]: Finished difference Result 4432 states and 6088 transitions. [2025-03-04 04:01:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:01:03,408 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-03-04 04:01:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:03,418 INFO L225 Difference]: With dead ends: 4432 [2025-03-04 04:01:03,418 INFO L226 Difference]: Without dead ends: 2230 [2025-03-04 04:01:03,424 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-03-04 04:01:03,424 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:03,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1326 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:01:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2025-03-04 04:01:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2230. [2025-03-04 04:01:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 1734 states have (on average 1.3587081891580162) internal successors, (2356), 1734 states have internal predecessors, (2356), 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-03-04 04:01:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 3059 transitions. [2025-03-04 04:01:03,501 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 3059 transitions. Word has length 145 [2025-03-04 04:01:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:03,501 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 3059 transitions. [2025-03-04 04:01:03,502 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-03-04 04:01:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3059 transitions. [2025-03-04 04:01:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 04:01:03,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:03,505 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-03-04 04:01:03,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:01:03,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:03,709 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:03,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1050843411, now seen corresponding path program 1 times [2025-03-04 04:01:03,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:03,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523674268] [2025-03-04 04:01:03,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:03,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 04:01:03,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 04:01:03,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:03,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 04:01:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:04,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523674268] [2025-03-04 04:01:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523674268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101324742] [2025-03-04 04:01:04,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:04,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:04,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:01:04,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:01:04,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 04:01:04,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 04:01:04,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:04,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:04,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 04:01:04,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 04:01:05,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:01:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101324742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:05,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:01:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5] total 19 [2025-03-04 04:01:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023504059] [2025-03-04 04:01:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:05,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 04:01:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:05,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 04:01:05,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-03-04 04:01:05,295 INFO L87 Difference]: Start difference. First operand 2230 states and 3059 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-03-04 04:01:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:05,671 INFO L93 Difference]: Finished difference Result 4755 states and 6622 transitions. [2025-03-04 04:01:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 04:01:05,671 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-03-04 04:01:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:05,684 INFO L225 Difference]: With dead ends: 4755 [2025-03-04 04:01:05,684 INFO L226 Difference]: Without dead ends: 2556 [2025-03-04 04:01:05,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-03-04 04:01:05,692 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 33 mSDsluCounter, 6729 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7215 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:05,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 7215 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:01:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-03-04 04:01:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2286. [2025-03-04 04:01:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 1774 states have (on average 1.346110484780158) internal successors, (2388), 1774 states have internal predecessors, (2388), 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-03-04 04:01:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3123 transitions. [2025-03-04 04:01:05,778 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3123 transitions. Word has length 146 [2025-03-04 04:01:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:05,778 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 3123 transitions. [2025-03-04 04:01:05,779 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-03-04 04:01:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3123 transitions. [2025-03-04 04:01:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 04:01:05,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:05,782 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-03-04 04:01:05,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 04:01:05,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 04:01:05,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:05,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1168093533, now seen corresponding path program 1 times [2025-03-04 04:01:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724144639] [2025-03-04 04:01:05,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:06,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 04:01:06,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 04:01:06,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:06,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 04:01:06,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724144639] [2025-03-04 04:01:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724144639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379516432] [2025-03-04 04:01:06,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:06,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:06,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:06,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:01:06,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:01:07,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 04:01:07,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 04:01:07,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:07,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:07,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 04:01:07,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 04:01:07,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:01:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379516432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:07,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:01:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5] total 19 [2025-03-04 04:01:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959120019] [2025-03-04 04:01:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 04:01:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:07,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 04:01:07,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-03-04 04:01:07,742 INFO L87 Difference]: Start difference. First operand 2286 states and 3123 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-03-04 04:01:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:08,062 INFO L93 Difference]: Finished difference Result 4859 states and 6710 transitions. [2025-03-04 04:01:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 04:01:08,062 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-03-04 04:01:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:08,073 INFO L225 Difference]: With dead ends: 4859 [2025-03-04 04:01:08,073 INFO L226 Difference]: Without dead ends: 2604 [2025-03-04 04:01:08,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-03-04 04:01:08,079 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 37 mSDsluCounter, 6889 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 7387 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:08,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 7387 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:01:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2025-03-04 04:01:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2302. [2025-03-04 04:01:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 1790 states have (on average 1.3430167597765363) internal successors, (2404), 1782 states have internal predecessors, (2404), 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-03-04 04:01:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3139 transitions. [2025-03-04 04:01:08,154 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3139 transitions. Word has length 126 [2025-03-04 04:01:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:08,154 INFO L471 AbstractCegarLoop]: Abstraction has 2302 states and 3139 transitions. [2025-03-04 04:01:08,154 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-03-04 04:01:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3139 transitions. [2025-03-04 04:01:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 04:01:08,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:08,162 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-03-04 04:01:08,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 04:01:08,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:08,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:08,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:08,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2123901737, now seen corresponding path program 1 times [2025-03-04 04:01:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:08,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211701715] [2025-03-04 04:01:08,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:08,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:08,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 04:01:08,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 04:01:08,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:08,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 04:01:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211701715] [2025-03-04 04:01:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211701715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798500334] [2025-03-04 04:01:08,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:08,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:08,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:01:08,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 04:01:09,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 04:01:10,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 04:01:10,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:10,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:11,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-04 04:01:11,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 04:01:11,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:01:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 04:01:11,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798500334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:01:11,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:01:11,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 04:01:11,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426615853] [2025-03-04 04:01:11,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:01:11,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 04:01:11,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:11,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 04:01:11,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:01:11,628 INFO L87 Difference]: Start difference. First operand 2302 states and 3139 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-03-04 04:01:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:11,721 INFO L93 Difference]: Finished difference Result 4588 states and 6263 transitions. [2025-03-04 04:01:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 04:01:11,721 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-03-04 04:01:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:11,731 INFO L225 Difference]: With dead ends: 4588 [2025-03-04 04:01:11,731 INFO L226 Difference]: Without dead ends: 2305 [2025-03-04 04:01:11,736 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-03-04 04:01:11,737 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:11,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1771 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:01:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-03-04 04:01:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2025-03-04 04:01:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1793 states have (on average 1.3424428332403793) internal successors, (2407), 1785 states have internal predecessors, (2407), 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-03-04 04:01:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3142 transitions. [2025-03-04 04:01:11,798 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3142 transitions. Word has length 176 [2025-03-04 04:01:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:11,798 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 3142 transitions. [2025-03-04 04:01:11,799 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-03-04 04:01:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3142 transitions. [2025-03-04 04:01:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 04:01:11,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:11,803 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-03-04 04:01:11,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 04:01:12,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:12,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:12,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:12,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1154722782, now seen corresponding path program 2 times [2025-03-04 04:01:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:12,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333633778] [2025-03-04 04:01:12,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:01:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:12,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 179 statements into 2 equivalence classes. [2025-03-04 04:01:12,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 04:01:12,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 04:01:12,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 04:01:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333633778] [2025-03-04 04:01:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333633778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714094398] [2025-03-04 04:01:12,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:01:12,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:12,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:12,624 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:01:12,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 04:01:13,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 179 statements into 2 equivalence classes.