./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a5b351dc48b78577594847e2589a2433da4c3422ed74f69290b3f52d3ba2c2d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:21:33,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:21:33,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:21:33,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:21:33,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:21:33,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:21:33,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:21:33,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:21:33,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:21:33,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:21:33,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:21:33,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:21:33,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:21:33,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:21:33,274 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:21:33,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:21:33,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:21:33,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:21:33,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:21:33,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:21:33,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:21:33,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:21:33,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:21:33,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:21:33,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:21:33,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:21:33,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:21:33,277 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5b351dc48b78577594847e2589a2433da4c3422ed74f69290b3f52d3ba2c2d2 [2025-01-09 18:21:33,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:21:33,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:21:33,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:21:33,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:21:33,534 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:21:33,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i [2025-01-09 18:21:34,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/065bfab4e/341bd87f6a9048a88ef6084d830cbf94/FLAG68f14e35b [2025-01-09 18:21:35,130 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:21:35,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i [2025-01-09 18:21:35,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/065bfab4e/341bd87f6a9048a88ef6084d830cbf94/FLAG68f14e35b [2025-01-09 18:21:35,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/065bfab4e/341bd87f6a9048a88ef6084d830cbf94 [2025-01-09 18:21:35,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:21:35,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:21:35,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:21:35,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:21:35,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:21:35,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:21:35" (1/1) ... [2025-01-09 18:21:35,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778909ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:35, skipping insertion in model container [2025-01-09 18:21:35,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:21:35" (1/1) ... [2025-01-09 18:21:35,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:21:36,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i[106459,106472] [2025-01-09 18:21:36,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:21:36,102 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:21:36,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i[106459,106472] [2025-01-09 18:21:36,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:21:36,341 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:21:36,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36 WrapperNode [2025-01-09 18:21:36,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:21:36,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:21:36,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:21:36,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:21:36,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,477 INFO L138 Inliner]: procedures = 129, calls = 755, calls flagged for inlining = 53, calls inlined = 47, statements flattened = 2485 [2025-01-09 18:21:36,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:21:36,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:21:36,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:21:36,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:21:36,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,601 INFO L175 MemorySlicer]: Split 360 memory accesses to 17 slices as follows [2, 1, 42, 2, 1, 1, 8, 49, 24, 6, 16, 2, 121, 7, 19, 51, 8]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 6]. The 228 writes are split as follows [0, 1, 42, 0, 0, 1, 3, 42, 24, 0, 16, 1, 30, 6, 19, 43, 0]. [2025-01-09 18:21:36,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:21:36,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:21:36,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:21:36,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:21:36,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (1/1) ... [2025-01-09 18:21:36,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:21:36,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:21:36,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:21:36,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:21:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-01-09 18:21:36,824 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-01-09 18:21:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:21:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:21:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:21:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:21:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 18:21:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 18:21:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure pch_phub_remove [2025-01-09 18:21:36,826 INFO L138 BoogieDeclarations]: Found implementation of procedure pch_phub_remove [2025-01-09 18:21:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:21:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:21:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:21:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:21:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:21:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2025-01-09 18:21:36,827 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure sysfs_create_bin_file [2025-01-09 18:21:36,827 INFO L138 BoogieDeclarations]: Found implementation of procedure sysfs_create_bin_file [2025-01-09 18:21:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure pch_phub_read_modify_write_reg [2025-01-09 18:21:36,827 INFO L138 BoogieDeclarations]: Found implementation of procedure pch_phub_read_modify_write_reg [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pch_phub_mutex [2025-01-09 18:21:36,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pch_phub_mutex [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:21:36,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:21:36,828 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:21:36,828 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2025-01-09 18:21:36,828 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:21:36,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:21:36,828 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-01-09 18:21:36,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-01-09 18:21:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:21:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2025-01-09 18:21:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure sysfs_remove_file [2025-01-09 18:21:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure sysfs_remove_file [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_device [2025-01-09 18:21:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_device [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_rom [2025-01-09 18:21:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_rom [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:21:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure ioread8 [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread8 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_wake [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_wake [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pch_phub_mutex [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pch_phub_mutex [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iounmap [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iounmap [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_power_state [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_power_state [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure pch_phub_write_serial_rom [2025-01-09 18:21:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure pch_phub_write_serial_rom [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:21:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:21:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:21:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:21:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:21:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:21:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:21:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:21:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:21:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:21:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 18:21:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 18:21:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 18:21:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:21:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:21:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure sysfs_create_file [2025-01-09 18:21:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure sysfs_create_file [2025-01-09 18:21:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure pch_phub_read_serial_rom [2025-01-09 18:21:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure pch_phub_read_serial_rom [2025-01-09 18:21:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_rom [2025-01-09 18:21:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_rom [2025-01-09 18:21:37,155 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:21:37,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:21:48,424 INFO L? ?]: Removed 845 outVars from TransFormulas that were not future-live. [2025-01-09 18:21:48,425 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:21:48,454 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:21:48,454 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:21:48,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:21:48 BoogieIcfgContainer [2025-01-09 18:21:48,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:21:48,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:21:48,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:21:48,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:21:48,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:21:35" (1/3) ... [2025-01-09 18:21:48,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80a066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:21:48, skipping insertion in model container [2025-01-09 18:21:48,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:21:36" (2/3) ... [2025-01-09 18:21:48,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80a066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:21:48, skipping insertion in model container [2025-01-09 18:21:48,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:21:48" (3/3) ... [2025-01-09 18:21:48,468 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i [2025-01-09 18:21:48,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:21:48,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--misc--pch_phub.ko-main.cil.out.i that has 31 procedures, 851 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 18:21:48,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:21:48,541 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;@7f0bff0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:21:48,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:21:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 632 states have (on average 1.3465189873417722) internal successors, (851), 645 states have internal predecessors, (851), 187 states have call successors, (187), 30 states have call predecessors, (187), 30 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) [2025-01-09 18:21:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 18:21:48,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:21:48,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:21:48,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:21:48,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:21:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1713331787, now seen corresponding path program 1 times [2025-01-09 18:21:48,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:21:48,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720150950] [2025-01-09 18:21:48,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:21:48,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:21:49,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 18:21:49,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 18:21:49,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:21:49,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:21:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:21:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:21:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720150950] [2025-01-09 18:21:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720150950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:21:50,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:21:50,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:21:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417438443] [2025-01-09 18:21:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:21:50,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:21:50,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:21:50,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:21:50,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:21:50,287 INFO L87 Difference]: Start difference. First operand has 851 states, 632 states have (on average 1.3465189873417722) internal successors, (851), 645 states have internal predecessors, (851), 187 states have call successors, (187), 30 states have call predecessors, (187), 30 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:21:54,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:21:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:21:54,595 INFO L93 Difference]: Finished difference Result 2527 states and 3695 transitions. [2025-01-09 18:21:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:21:54,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 18:21:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:21:54,616 INFO L225 Difference]: With dead ends: 2527 [2025-01-09 18:21:54,616 INFO L226 Difference]: Without dead ends: 1675 [2025-01-09 18:21:54,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:21:54,626 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 1188 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:21:54,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2418 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:21:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2025-01-09 18:21:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1671. [2025-01-09 18:21:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1243 states have (on average 1.341110217216412) internal successors, (1667), 1261 states have internal predecessors, (1667), 369 states have call successors, (369), 59 states have call predecessors, (369), 58 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-01-09 18:21:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2400 transitions. [2025-01-09 18:21:54,743 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2400 transitions. Word has length 15 [2025-01-09 18:21:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:21:54,743 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2400 transitions. [2025-01-09 18:21:54,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:21:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2400 transitions. [2025-01-09 18:21:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 18:21:54,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:21:54,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:21:54,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:21:54,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:21:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:21:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1851949622, now seen corresponding path program 1 times [2025-01-09 18:21:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:21:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062736728] [2025-01-09 18:21:54,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:21:54,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:21:55,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 18:21:55,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 18:21:55,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:21:55,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:21:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:21:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:21:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062736728] [2025-01-09 18:21:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062736728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:21:55,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:21:55,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:21:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442698707] [2025-01-09 18:21:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:21:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:21:55,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:21:55,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:21:55,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:21:55,785 INFO L87 Difference]: Start difference. First operand 1671 states and 2400 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:21:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:21:55,883 INFO L93 Difference]: Finished difference Result 1689 states and 2420 transitions. [2025-01-09 18:21:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:21:55,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 18:21:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:21:55,891 INFO L225 Difference]: With dead ends: 1689 [2025-01-09 18:21:55,891 INFO L226 Difference]: Without dead ends: 1680 [2025-01-09 18:21:55,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:21:55,892 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 1207 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:21:55,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 1231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:21:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2025-01-09 18:21:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1671. [2025-01-09 18:21:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1243 states have (on average 1.340305711987128) internal successors, (1666), 1261 states have internal predecessors, (1666), 369 states have call successors, (369), 59 states have call predecessors, (369), 58 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-01-09 18:21:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2399 transitions. [2025-01-09 18:21:55,949 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2399 transitions. Word has length 18 [2025-01-09 18:21:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:21:55,949 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2399 transitions. [2025-01-09 18:21:55,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:21:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2399 transitions. [2025-01-09 18:21:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 18:21:55,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:21:55,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:21:55,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:21:55,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:21:55,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:21:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1909207924, now seen corresponding path program 1 times [2025-01-09 18:21:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:21:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74058670] [2025-01-09 18:21:55,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:21:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:21:57,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 18:21:57,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 18:21:57,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:21:57,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:21:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:21:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:21:57,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74058670] [2025-01-09 18:21:57,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74058670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:21:57,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:21:57,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:21:57,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872480575] [2025-01-09 18:21:57,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:21:57,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:21:57,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:21:57,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:21:57,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:21:57,195 INFO L87 Difference]: Start difference. First operand 1671 states and 2399 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:22:01,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:22:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:01,356 INFO L93 Difference]: Finished difference Result 1673 states and 2400 transitions. [2025-01-09 18:22:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:22:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 18:22:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:01,363 INFO L225 Difference]: With dead ends: 1673 [2025-01-09 18:22:01,363 INFO L226 Difference]: Without dead ends: 1670 [2025-01-09 18:22:01,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:01,364 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 1195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:01,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1209 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:22:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-01-09 18:22:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2025-01-09 18:22:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1243 states have (on average 1.339501206757844) internal successors, (1665), 1260 states have internal predecessors, (1665), 368 states have call successors, (368), 59 states have call predecessors, (368), 58 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-01-09 18:22:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2397 transitions. [2025-01-09 18:22:01,423 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2397 transitions. Word has length 18 [2025-01-09 18:22:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:01,423 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2397 transitions. [2025-01-09 18:22:01,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:22:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2397 transitions. [2025-01-09 18:22:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 18:22:01,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:01,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:22:01,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:22:01,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:01,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -944462807, now seen corresponding path program 1 times [2025-01-09 18:22:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:01,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485875225] [2025-01-09 18:22:01,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:02,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 18:22:02,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 18:22:02,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:02,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:22:02,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485875225] [2025-01-09 18:22:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485875225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:02,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:22:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421682799] [2025-01-09 18:22:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:02,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:22:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:02,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:22:02,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:02,446 INFO L87 Difference]: Start difference. First operand 1670 states and 2397 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:22:06,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:22:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:06,606 INFO L93 Difference]: Finished difference Result 1672 states and 2398 transitions. [2025-01-09 18:22:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:22:06,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 18:22:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:06,615 INFO L225 Difference]: With dead ends: 1672 [2025-01-09 18:22:06,615 INFO L226 Difference]: Without dead ends: 1669 [2025-01-09 18:22:06,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:06,616 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 1192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:06,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1207 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:22:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-01-09 18:22:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2025-01-09 18:22:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1243 states have (on average 1.33869670152856) internal successors, (1664), 1259 states have internal predecessors, (1664), 367 states have call successors, (367), 59 states have call predecessors, (367), 58 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-01-09 18:22:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2395 transitions. [2025-01-09 18:22:06,692 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2395 transitions. Word has length 19 [2025-01-09 18:22:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:06,692 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2395 transitions. [2025-01-09 18:22:06,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:22:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2395 transitions. [2025-01-09 18:22:06,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 18:22:06,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:06,694 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] [2025-01-09 18:22:06,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:22:06,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash 786062615, now seen corresponding path program 1 times [2025-01-09 18:22:06,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940611715] [2025-01-09 18:22:06,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:07,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 18:22:07,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 18:22:07,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:07,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:22:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940611715] [2025-01-09 18:22:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940611715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:22:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590707376] [2025-01-09 18:22:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:07,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:22:07,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:07,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:22:07,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:07,748 INFO L87 Difference]: Start difference. First operand 1669 states and 2395 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:22:11,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:22:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:11,995 INFO L93 Difference]: Finished difference Result 4967 states and 7147 transitions. [2025-01-09 18:22:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:22:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 18:22:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:12,011 INFO L225 Difference]: With dead ends: 4967 [2025-01-09 18:22:12,011 INFO L226 Difference]: Without dead ends: 3295 [2025-01-09 18:22:12,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:12,020 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 1186 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:12,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 2465 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:22:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2025-01-09 18:22:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3282. [2025-01-09 18:22:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 2450 states have (on average 1.3404081632653062) internal successors, (3284), 2485 states have internal predecessors, (3284), 719 states have call successors, (719), 114 states have call predecessors, (719), 112 states have return successors, (720), 708 states have call predecessors, (720), 712 states have call successors, (720) [2025-01-09 18:22:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4723 transitions. [2025-01-09 18:22:12,198 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4723 transitions. Word has length 20 [2025-01-09 18:22:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:12,198 INFO L471 AbstractCegarLoop]: Abstraction has 3282 states and 4723 transitions. [2025-01-09 18:22:12,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:22:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4723 transitions. [2025-01-09 18:22:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 18:22:12,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:12,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:22:12,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:22:12,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash -180828044, now seen corresponding path program 1 times [2025-01-09 18:22:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468099303] [2025-01-09 18:22:12,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:13,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 18:22:13,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 18:22:13,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:13,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:22:13,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:13,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468099303] [2025-01-09 18:22:13,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468099303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:13,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:22:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760434820] [2025-01-09 18:22:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:13,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:22:13,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:13,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:22:13,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:13,404 INFO L87 Difference]: Start difference. First operand 3282 states and 4723 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 18:22:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:13,717 INFO L93 Difference]: Finished difference Result 9470 states and 13611 transitions. [2025-01-09 18:22:13,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:22:13,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-01-09 18:22:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:13,748 INFO L225 Difference]: With dead ends: 9470 [2025-01-09 18:22:13,748 INFO L226 Difference]: Without dead ends: 6191 [2025-01-09 18:22:13,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:13,763 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 1047 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:13,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2422 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 18:22:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2025-01-09 18:22:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 6182. [2025-01-09 18:22:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 4622 states have (on average 1.3379489398528774) internal successors, (6184), 4677 states have internal predecessors, (6184), 1347 states have call successors, (1347), 214 states have call predecessors, (1347), 212 states have return successors, (1348), 1336 states have call predecessors, (1348), 1340 states have call successors, (1348) [2025-01-09 18:22:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 8879 transitions. [2025-01-09 18:22:14,017 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 8879 transitions. Word has length 49 [2025-01-09 18:22:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:14,017 INFO L471 AbstractCegarLoop]: Abstraction has 6182 states and 8879 transitions. [2025-01-09 18:22:14,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 18:22:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 8879 transitions. [2025-01-09 18:22:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 18:22:14,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:14,025 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:22:14,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:22:14,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2057658114, now seen corresponding path program 1 times [2025-01-09 18:22:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:14,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337152838] [2025-01-09 18:22:14,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:14,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:14,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 18:22:14,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 18:22:14,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:14,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:22:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337152838] [2025-01-09 18:22:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337152838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:22:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101232535] [2025-01-09 18:22:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:15,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:22:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:15,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:22:15,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:15,114 INFO L87 Difference]: Start difference. First operand 6182 states and 8879 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 18:22:19,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:22:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:19,589 INFO L93 Difference]: Finished difference Result 15310 states and 21999 transitions. [2025-01-09 18:22:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:22:19,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-01-09 18:22:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:19,652 INFO L225 Difference]: With dead ends: 15310 [2025-01-09 18:22:19,652 INFO L226 Difference]: Without dead ends: 9131 [2025-01-09 18:22:19,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:19,680 INFO L435 NwaCegarLoop]: 2251 mSDtfsCounter, 1058 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:19,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 3442 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 18:22:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9131 states. [2025-01-09 18:22:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9131 to 9122. [2025-01-09 18:22:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9122 states, 6834 states have (on average 1.33801580333626) internal successors, (9144), 6909 states have internal predecessors, (9144), 1975 states have call successors, (1975), 314 states have call predecessors, (1975), 312 states have return successors, (1976), 1964 states have call predecessors, (1976), 1968 states have call successors, (1976) [2025-01-09 18:22:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9122 states to 9122 states and 13095 transitions. [2025-01-09 18:22:20,000 INFO L78 Accepts]: Start accepts. Automaton has 9122 states and 13095 transitions. Word has length 60 [2025-01-09 18:22:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:20,002 INFO L471 AbstractCegarLoop]: Abstraction has 9122 states and 13095 transitions. [2025-01-09 18:22:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 18:22:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 9122 states and 13095 transitions. [2025-01-09 18:22:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 18:22:20,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:20,010 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 18:22:20,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:22:20,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:20,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2127128416, now seen corresponding path program 1 times [2025-01-09 18:22:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369979369] [2025-01-09 18:22:20,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:20,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 18:22:20,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 18:22:20,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:20,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 18:22:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369979369] [2025-01-09 18:22:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369979369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:21,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:21,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:22:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968079783] [2025-01-09 18:22:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:21,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:22:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:21,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:22:21,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:22:21,345 INFO L87 Difference]: Start difference. First operand 9122 states and 13095 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 18:22:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:21,814 INFO L93 Difference]: Finished difference Result 18261 states and 26215 transitions. [2025-01-09 18:22:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:22:21,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 72 [2025-01-09 18:22:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:21,852 INFO L225 Difference]: With dead ends: 18261 [2025-01-09 18:22:21,853 INFO L226 Difference]: Without dead ends: 9142 [2025-01-09 18:22:21,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:22:21,881 INFO L435 NwaCegarLoop]: 1192 mSDtfsCounter, 1200 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:21,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 2367 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 18:22:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9142 states. [2025-01-09 18:22:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9142 to 9122. [2025-01-09 18:22:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9122 states, 6834 states have (on average 1.3374304945858941) internal successors, (9140), 6909 states have internal predecessors, (9140), 1975 states have call successors, (1975), 314 states have call predecessors, (1975), 312 states have return successors, (1976), 1964 states have call predecessors, (1976), 1968 states have call successors, (1976) [2025-01-09 18:22:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9122 states to 9122 states and 13091 transitions. [2025-01-09 18:22:22,166 INFO L78 Accepts]: Start accepts. Automaton has 9122 states and 13091 transitions. Word has length 72 [2025-01-09 18:22:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:22,167 INFO L471 AbstractCegarLoop]: Abstraction has 9122 states and 13091 transitions. [2025-01-09 18:22:22,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 18:22:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9122 states and 13091 transitions. [2025-01-09 18:22:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 18:22:22,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:22,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 18:22:22,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:22:22,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1200228407, now seen corresponding path program 1 times [2025-01-09 18:22:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600985266] [2025-01-09 18:22:22,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:23,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 18:22:23,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 18:22:23,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:23,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 18:22:23,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:23,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600985266] [2025-01-09 18:22:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600985266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:23,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:23,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:22:23,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679520862] [2025-01-09 18:22:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:23,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:22:23,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:23,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:22:23,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:23,617 INFO L87 Difference]: Start difference. First operand 9122 states and 13091 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 18:22:27,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:22:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:28,057 INFO L93 Difference]: Finished difference Result 18243 states and 26180 transitions. [2025-01-09 18:22:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:22:28,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-01-09 18:22:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:28,094 INFO L225 Difference]: With dead ends: 18243 [2025-01-09 18:22:28,094 INFO L226 Difference]: Without dead ends: 9124 [2025-01-09 18:22:28,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:22:28,120 INFO L435 NwaCegarLoop]: 2292 mSDtfsCounter, 1166 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:28,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 3481 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:22:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9124 states. [2025-01-09 18:22:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9124 to 9109. [2025-01-09 18:22:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9109 states, 6826 states have (on average 1.3372399648403164) internal successors, (9128), 6902 states have internal predecessors, (9128), 1971 states have call successors, (1971), 312 states have call predecessors, (1971), 311 states have return successors, (1966), 1960 states have call predecessors, (1966), 1962 states have call successors, (1966) [2025-01-09 18:22:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9109 states to 9109 states and 13065 transitions. [2025-01-09 18:22:28,410 INFO L78 Accepts]: Start accepts. Automaton has 9109 states and 13065 transitions. Word has length 73 [2025-01-09 18:22:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:28,411 INFO L471 AbstractCegarLoop]: Abstraction has 9109 states and 13065 transitions. [2025-01-09 18:22:28,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 18:22:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 9109 states and 13065 transitions. [2025-01-09 18:22:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 18:22:28,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:28,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 18:22:28,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:22:28,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:28,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2044700278, now seen corresponding path program 1 times [2025-01-09 18:22:28,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:28,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871598518] [2025-01-09 18:22:28,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:29,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 18:22:29,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 18:22:29,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:29,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 18:22:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:29,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871598518] [2025-01-09 18:22:29,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871598518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:29,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:22:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105897645] [2025-01-09 18:22:29,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:29,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:22:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:29,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:22:29,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:22:29,827 INFO L87 Difference]: Start difference. First operand 9109 states and 13065 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 18:22:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:30,252 INFO L93 Difference]: Finished difference Result 9230 states and 13205 transitions. [2025-01-09 18:22:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:22:30,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-01-09 18:22:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:30,282 INFO L225 Difference]: With dead ends: 9230 [2025-01-09 18:22:30,282 INFO L226 Difference]: Without dead ends: 9077 [2025-01-09 18:22:30,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:22:30,287 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 0 mSDsluCounter, 4822 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6032 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:30,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6032 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:22:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9077 states. [2025-01-09 18:22:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9077 to 9077. [2025-01-09 18:22:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9077 states, 6804 states have (on average 1.3365667254556144) internal successors, (9094), 6875 states have internal predecessors, (9094), 1961 states have call successors, (1961), 312 states have call predecessors, (1961), 311 states have return successors, (1958), 1954 states have call predecessors, (1958), 1954 states have call successors, (1958) [2025-01-09 18:22:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9077 states to 9077 states and 13013 transitions. [2025-01-09 18:22:30,603 INFO L78 Accepts]: Start accepts. Automaton has 9077 states and 13013 transitions. Word has length 73 [2025-01-09 18:22:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:30,604 INFO L471 AbstractCegarLoop]: Abstraction has 9077 states and 13013 transitions. [2025-01-09 18:22:30,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 18:22:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 9077 states and 13013 transitions. [2025-01-09 18:22:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 18:22:30,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:30,609 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 18:22:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:22:30,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:30,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1012206684, now seen corresponding path program 1 times [2025-01-09 18:22:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854870405] [2025-01-09 18:22:30,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:31,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 18:22:31,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 18:22:31,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:31,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 18:22:31,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:31,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854870405] [2025-01-09 18:22:31,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854870405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:31,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:31,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:22:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230667610] [2025-01-09 18:22:31,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:31,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:22:31,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:31,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:22:31,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:22:31,976 INFO L87 Difference]: Start difference. First operand 9077 states and 13013 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 18:22:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:32,372 INFO L93 Difference]: Finished difference Result 9125 states and 13056 transitions. [2025-01-09 18:22:32,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:22:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 79 [2025-01-09 18:22:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:32,406 INFO L225 Difference]: With dead ends: 9125 [2025-01-09 18:22:32,406 INFO L226 Difference]: Without dead ends: 9022 [2025-01-09 18:22:32,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:22:32,412 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 0 mSDsluCounter, 4817 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6025 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:32,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6025 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:22:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9022 states. [2025-01-09 18:22:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9022 to 9022. [2025-01-09 18:22:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9022 states, 6766 states have (on average 1.3360922258350576) internal successors, (9040), 6832 states have internal predecessors, (9040), 1944 states have call successors, (1944), 311 states have call predecessors, (1944), 311 states have return successors, (1944), 1942 states have call predecessors, (1944), 1940 states have call successors, (1944) [2025-01-09 18:22:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9022 states to 9022 states and 12928 transitions. [2025-01-09 18:22:32,656 INFO L78 Accepts]: Start accepts. Automaton has 9022 states and 12928 transitions. Word has length 79 [2025-01-09 18:22:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:32,657 INFO L471 AbstractCegarLoop]: Abstraction has 9022 states and 12928 transitions. [2025-01-09 18:22:32,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 18:22:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 9022 states and 12928 transitions. [2025-01-09 18:22:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 18:22:32,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:32,664 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-01-09 18:22:32,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:22:32,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:32,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -414157320, now seen corresponding path program 1 times [2025-01-09 18:22:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:32,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088332902] [2025-01-09 18:22:32,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:33,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 18:22:33,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 18:22:33,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:33,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 18:22:34,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088332902] [2025-01-09 18:22:34,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088332902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:34,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:34,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:22:34,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529459659] [2025-01-09 18:22:34,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:34,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:22:34,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:34,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:22:34,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:22:34,424 INFO L87 Difference]: Start difference. First operand 9022 states and 12928 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 18:22:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:35,123 INFO L93 Difference]: Finished difference Result 13444 states and 19271 transitions. [2025-01-09 18:22:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:22:35,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2025-01-09 18:22:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:35,157 INFO L225 Difference]: With dead ends: 13444 [2025-01-09 18:22:35,157 INFO L226 Difference]: Without dead ends: 9020 [2025-01-09 18:22:35,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:22:35,174 INFO L435 NwaCegarLoop]: 1202 mSDtfsCounter, 0 mSDsluCounter, 4798 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6000 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:35,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6000 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 18:22:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9020 states. [2025-01-09 18:22:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9020 to 9020. [2025-01-09 18:22:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9020 states, 6764 states have (on average 1.3358959195742164) internal successors, (9036), 6830 states have internal predecessors, (9036), 1944 states have call successors, (1944), 311 states have call predecessors, (1944), 311 states have return successors, (1944), 1942 states have call predecessors, (1944), 1940 states have call successors, (1944) [2025-01-09 18:22:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 12924 transitions. [2025-01-09 18:22:35,558 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 12924 transitions. Word has length 75 [2025-01-09 18:22:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:35,558 INFO L471 AbstractCegarLoop]: Abstraction has 9020 states and 12924 transitions. [2025-01-09 18:22:35,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 18:22:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 12924 transitions. [2025-01-09 18:22:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 18:22:35,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:22:35,563 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-01-09 18:22:35,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:22:35,564 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:22:35,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:22:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash -349727322, now seen corresponding path program 1 times [2025-01-09 18:22:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:22:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604094709] [2025-01-09 18:22:35,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:22:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:22:36,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 18:22:36,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 18:22:36,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:22:36,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:22:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 18:22:37,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:22:37,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604094709] [2025-01-09 18:22:37,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604094709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:22:37,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:22:37,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:22:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986412082] [2025-01-09 18:22:37,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:22:37,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:22:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:22:37,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:22:37,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:22:37,284 INFO L87 Difference]: Start difference. First operand 9020 states and 12924 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 18:22:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:22:37,778 INFO L93 Difference]: Finished difference Result 9146 states and 13070 transitions. [2025-01-09 18:22:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:22:37,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2025-01-09 18:22:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:22:37,785 INFO L225 Difference]: With dead ends: 9146 [2025-01-09 18:22:37,785 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 18:22:37,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:22:37,801 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 0 mSDsluCounter, 4753 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5943 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:22:37,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5943 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:22:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 18:22:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 18:22:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:22:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 18:22:37,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2025-01-09 18:22:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:22:37,806 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 18:22:37,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 18:22:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 18:22:37,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 18:22:37,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 18:22:37,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:22:37,811 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:22:37,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.