./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/uthash-2.0.2/uthash_OAT_test10-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:57:39,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:57:39,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:57:40,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:57:40,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:57:40,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:57:40,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:57:40,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:57:40,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:57:40,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:57:40,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:57:40,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:57:40,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:57:40,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:57:40,032 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:57:40,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:57:40,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:57:40,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:57:40,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:57:40,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:57:40,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:57:40,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:57:40,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:57:40,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:57:40,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:57:40,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:57:40,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:57:40,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:57:40,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:57:40,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:57:40,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:57:40,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:57:40,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:57:40,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:57:40,036 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e [2025-02-08 04:57:40,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:57:40,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:57:40,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:57:40,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:57:40,329 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:57:40,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2025-02-08 04:57:41,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c068fd937/98682f25fd614a8ea790f1d9b37ea221/FLAGd5ab15c1f [2025-02-08 04:57:42,019 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:57:42,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2025-02-08 04:57:42,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c068fd937/98682f25fd614a8ea790f1d9b37ea221/FLAGd5ab15c1f [2025-02-08 04:57:42,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c068fd937/98682f25fd614a8ea790f1d9b37ea221 [2025-02-08 04:57:42,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:57:42,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:57:42,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:57:42,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:57:42,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:57:42,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:42,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e38d36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42, skipping insertion in model container [2025-02-08 04:57:42,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:42,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:57:42,561 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/uthash-2.0.2/uthash_OAT_test10-3.i[33022,33035] [2025-02-08 04:57:42,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:57:42,786 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:57:42,833 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/uthash-2.0.2/uthash_OAT_test10-3.i[33022,33035] [2025-02-08 04:57:42,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:57:42,978 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:57:42,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42 WrapperNode [2025-02-08 04:57:42,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:57:42,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:57:42,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:57:42,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:57:42,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,136 INFO L138 Inliner]: procedures = 177, calls = 605, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3609 [2025-02-08 04:57:43,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:57:43,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:57:43,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:57:43,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:57:43,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,369 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [2, 106, 466]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 102 writes are split as follows [0, 4, 98]. [2025-02-08 04:57:43,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:57:43,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:57:43,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:57:43,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:57:43,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (1/1) ... [2025-02-08 04:57:43,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:57:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:57:43,530 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-02-08 04:57:43,536 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-02-08 04:57:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-08 04:57:43,558 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-08 04:57:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:57:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:57:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:57:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:57:43,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:57:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:57:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:57:43,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:57:43,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:57:43,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:57:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:57:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:57:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:57:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:57:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:57:43,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:57:43,902 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:57:43,904 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:57:46,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 04:57:46,935 INFO L? ?]: Removed 821 outVars from TransFormulas that were not future-live. [2025-02-08 04:57:46,935 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:57:47,050 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:57:47,050 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 04:57:47,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:57:47 BoogieIcfgContainer [2025-02-08 04:57:47,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:57:47,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:57:47,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:57:47,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:57:47,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:57:42" (1/3) ... [2025-02-08 04:57:47,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afc0452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:57:47, skipping insertion in model container [2025-02-08 04:57:47,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:57:42" (2/3) ... [2025-02-08 04:57:47,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afc0452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:57:47, skipping insertion in model container [2025-02-08 04:57:47,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:57:47" (3/3) ... [2025-02-08 04:57:47,063 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-3.i [2025-02-08 04:57:47,076 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:57:47,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test10-3.i that has 6 procedures, 1089 locations, 1 initial locations, 93 loop locations, and 1 error locations. [2025-02-08 04:57:47,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:57:47,174 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;@7d5a8728, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:57:47,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 04:57:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 1081 states, 1061 states have (on average 1.6239396795475967) internal successors, (1723), 1066 states have internal predecessors, (1723), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 04:57:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 04:57:47,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:47,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:57:47,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:47,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1455229260, now seen corresponding path program 1 times [2025-02-08 04:57:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398919210] [2025-02-08 04:57:47,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:47,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:47,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 04:57:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 04:57:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:57:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398919210] [2025-02-08 04:57:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398919210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:47,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:47,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:57:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020850453] [2025-02-08 04:57:47,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:47,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:57:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:47,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:57:47,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:57:47,411 INFO L87 Difference]: Start difference. First operand has 1081 states, 1061 states have (on average 1.6239396795475967) internal successors, (1723), 1066 states have internal predecessors, (1723), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:47,730 INFO L93 Difference]: Finished difference Result 2161 states and 3505 transitions. [2025-02-08 04:57:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:57:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 04:57:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:47,754 INFO L225 Difference]: With dead ends: 2161 [2025-02-08 04:57:47,755 INFO L226 Difference]: Without dead ends: 1014 [2025-02-08 04:57:47,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:57:47,767 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:47,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1466 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:57:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-02-08 04:57:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1014. [2025-02-08 04:57:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 997 states have (on average 1.4764292878635907) internal successors, (1472), 1001 states have internal predecessors, (1472), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:57:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1495 transitions. [2025-02-08 04:57:47,868 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1495 transitions. Word has length 12 [2025-02-08 04:57:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:47,868 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1495 transitions. [2025-02-08 04:57:47,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1495 transitions. [2025-02-08 04:57:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 04:57:47,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:47,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:57:47,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:57:47,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:47,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1464559770, now seen corresponding path program 1 times [2025-02-08 04:57:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152676611] [2025-02-08 04:57:47,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:47,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 04:57:47,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 04:57:47,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:47,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:57:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152676611] [2025-02-08 04:57:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152676611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:57:48,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656161018] [2025-02-08 04:57:48,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:48,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:57:48,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:48,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:57:48,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:57:48,409 INFO L87 Difference]: Start difference. First operand 1014 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:48,966 INFO L93 Difference]: Finished difference Result 2023 states and 2985 transitions. [2025-02-08 04:57:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:57:48,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-08 04:57:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:48,979 INFO L225 Difference]: With dead ends: 2023 [2025-02-08 04:57:48,979 INFO L226 Difference]: Without dead ends: 1396 [2025-02-08 04:57:48,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:57:48,981 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 544 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:48,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4125 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:57:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-02-08 04:57:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1016. [2025-02-08 04:57:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 999 states have (on average 1.4754754754754755) internal successors, (1474), 1003 states have internal predecessors, (1474), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:57:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1497 transitions. [2025-02-08 04:57:49,033 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1497 transitions. Word has length 66 [2025-02-08 04:57:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:49,035 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1497 transitions. [2025-02-08 04:57:49,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1497 transitions. [2025-02-08 04:57:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-08 04:57:49,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:49,042 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:57:49,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:57:49,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:49,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 19313469, now seen corresponding path program 1 times [2025-02-08 04:57:49,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:49,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144740213] [2025-02-08 04:57:49,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:49,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 04:57:49,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 04:57:49,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:49,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:57:49,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144740213] [2025-02-08 04:57:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144740213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:49,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:49,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:57:49,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781719357] [2025-02-08 04:57:49,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:49,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:57:49,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:49,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:57:49,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:57:49,661 INFO L87 Difference]: Start difference. First operand 1016 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:50,144 INFO L93 Difference]: Finished difference Result 2409 states and 3546 transitions. [2025-02-08 04:57:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:57:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-02-08 04:57:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:50,152 INFO L225 Difference]: With dead ends: 2409 [2025-02-08 04:57:50,153 INFO L226 Difference]: Without dead ends: 1396 [2025-02-08 04:57:50,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:57:50,159 INFO L435 NwaCegarLoop]: 1418 mSDtfsCounter, 540 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:50,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 4142 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:57:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-02-08 04:57:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1019. [2025-02-08 04:57:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1002 states have (on average 1.4740518962075848) internal successors, (1477), 1006 states have internal predecessors, (1477), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:57:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1500 transitions. [2025-02-08 04:57:50,202 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1500 transitions. Word has length 142 [2025-02-08 04:57:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:50,202 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1500 transitions. [2025-02-08 04:57:50,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1500 transitions. [2025-02-08 04:57:50,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 04:57:50,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:50,206 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:50,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:57:50,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:50,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1906917714, now seen corresponding path program 1 times [2025-02-08 04:57:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:50,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26153542] [2025-02-08 04:57:50,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:50,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 04:57:50,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 04:57:50,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:50,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:57:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26153542] [2025-02-08 04:57:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26153542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:50,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:50,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:57:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073690887] [2025-02-08 04:57:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:50,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:57:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:50,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:57:50,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:57:50,696 INFO L87 Difference]: Start difference. First operand 1019 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:51,032 INFO L93 Difference]: Finished difference Result 1990 states and 2928 transitions. [2025-02-08 04:57:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:57:51,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-02-08 04:57:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:51,037 INFO L225 Difference]: With dead ends: 1990 [2025-02-08 04:57:51,038 INFO L226 Difference]: Without dead ends: 977 [2025-02-08 04:57:51,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:57:51,041 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 30 mSDsluCounter, 2547 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:51,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3830 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:57:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-08 04:57:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-02-08 04:57:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 960 states have (on average 1.4583333333333333) internal successors, (1400), 964 states have internal predecessors, (1400), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:57:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1423 transitions. [2025-02-08 04:57:51,067 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1423 transitions. Word has length 212 [2025-02-08 04:57:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:51,068 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1423 transitions. [2025-02-08 04:57:51,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1423 transitions. [2025-02-08 04:57:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 04:57:51,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:51,071 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:51,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:57:51,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:51,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:51,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2081606329, now seen corresponding path program 1 times [2025-02-08 04:57:51,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:51,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436119741] [2025-02-08 04:57:51,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:51,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:51,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 04:57:51,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 04:57:51,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:57:51,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:51,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436119741] [2025-02-08 04:57:51,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436119741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:51,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:51,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:57:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319166977] [2025-02-08 04:57:51,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:51,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:57:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:51,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:57:51,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:57:51,365 INFO L87 Difference]: Start difference. First operand 977 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:51,708 INFO L93 Difference]: Finished difference Result 2475 states and 3619 transitions. [2025-02-08 04:57:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:57:51,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-02-08 04:57:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:51,717 INFO L225 Difference]: With dead ends: 2475 [2025-02-08 04:57:51,718 INFO L226 Difference]: Without dead ends: 1504 [2025-02-08 04:57:51,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 04:57:51,721 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 713 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:51,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2580 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:57:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-02-08 04:57:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1346. [2025-02-08 04:57:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1327 states have (on average 1.4611906556141674) internal successors, (1939), 1331 states have internal predecessors, (1939), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 04:57:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1966 transitions. [2025-02-08 04:57:51,770 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1966 transitions. Word has length 212 [2025-02-08 04:57:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:51,771 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1966 transitions. [2025-02-08 04:57:51,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:57:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1966 transitions. [2025-02-08 04:57:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-08 04:57:51,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:51,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:51,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:57:51,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:51,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash -625582692, now seen corresponding path program 1 times [2025-02-08 04:57:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677980130] [2025-02-08 04:57:51,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 04:57:51,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 04:57:51,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:51,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:57:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677980130] [2025-02-08 04:57:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677980130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:52,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:52,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:57:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344840258] [2025-02-08 04:57:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:52,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:57:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:52,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:57:52,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:57:52,264 INFO L87 Difference]: Start difference. First operand 1346 states and 1966 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:57:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:52,578 INFO L93 Difference]: Finished difference Result 2560 states and 3745 transitions. [2025-02-08 04:57:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:57:52,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227 [2025-02-08 04:57:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:52,585 INFO L225 Difference]: With dead ends: 2560 [2025-02-08 04:57:52,585 INFO L226 Difference]: Without dead ends: 1304 [2025-02-08 04:57:52,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:57:52,589 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 30 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:52,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3608 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:57:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-02-08 04:57:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-02-08 04:57:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1285 states have (on average 1.4490272373540856) internal successors, (1862), 1289 states have internal predecessors, (1862), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 04:57:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1889 transitions. [2025-02-08 04:57:52,645 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1889 transitions. Word has length 227 [2025-02-08 04:57:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:52,647 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1889 transitions. [2025-02-08 04:57:52,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:57:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1889 transitions. [2025-02-08 04:57:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-08 04:57:52,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:52,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:52,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:57:52,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash 398672629, now seen corresponding path program 1 times [2025-02-08 04:57:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:52,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622760915] [2025-02-08 04:57:52,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:52,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 04:57:52,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 04:57:52,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:52,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:57:53,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622760915] [2025-02-08 04:57:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622760915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:53,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:53,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:57:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452959825] [2025-02-08 04:57:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:53,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:57:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:53,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:57:53,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:57:53,010 INFO L87 Difference]: Start difference. First operand 1304 states and 1889 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:57:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:53,360 INFO L93 Difference]: Finished difference Result 3084 states and 4486 transitions. [2025-02-08 04:57:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:57:53,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227 [2025-02-08 04:57:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:53,371 INFO L225 Difference]: With dead ends: 3084 [2025-02-08 04:57:53,371 INFO L226 Difference]: Without dead ends: 1870 [2025-02-08 04:57:53,374 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-02-08 04:57:53,375 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 593 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 2608 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:53,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 2608 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:57:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2025-02-08 04:57:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1865. [2025-02-08 04:57:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1840 states have (on average 1.4521739130434783) internal successors, (2672), 1844 states have internal predecessors, (2672), 22 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 04:57:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2711 transitions. [2025-02-08 04:57:53,435 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2711 transitions. Word has length 227 [2025-02-08 04:57:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:53,435 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2711 transitions. [2025-02-08 04:57:53,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:57:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2711 transitions. [2025-02-08 04:57:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-08 04:57:53,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:53,439 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:53,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 04:57:53,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:53,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1057606916, now seen corresponding path program 1 times [2025-02-08 04:57:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:53,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84537620] [2025-02-08 04:57:53,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:53,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-08 04:57:53,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-08 04:57:53,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:53,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:57:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84537620] [2025-02-08 04:57:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84537620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:57:53,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021429026] [2025-02-08 04:57:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:53,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:57:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:53,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:57:53,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:57:53,819 INFO L87 Difference]: Start difference. First operand 1865 states and 2711 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:57:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:54,538 INFO L93 Difference]: Finished difference Result 3070 states and 4468 transitions. [2025-02-08 04:57:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:57:54,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 242 [2025-02-08 04:57:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:54,547 INFO L225 Difference]: With dead ends: 3070 [2025-02-08 04:57:54,547 INFO L226 Difference]: Without dead ends: 1439 [2025-02-08 04:57:54,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:57:54,550 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 2357 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:54,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 1422 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:57:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-02-08 04:57:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2025-02-08 04:57:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1419 states have (on average 1.437632135306554) internal successors, (2040), 1423 states have internal predecessors, (2040), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:57:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2069 transitions. [2025-02-08 04:57:54,601 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2069 transitions. Word has length 242 [2025-02-08 04:57:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:54,601 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2069 transitions. [2025-02-08 04:57:54,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:57:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2069 transitions. [2025-02-08 04:57:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-08 04:57:54,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:54,608 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:54,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 04:57:54,608 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:54,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1600492522, now seen corresponding path program 1 times [2025-02-08 04:57:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:54,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672209866] [2025-02-08 04:57:54,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:54,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:54,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:57:54,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:57:54,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:54,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 04:57:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672209866] [2025-02-08 04:57:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672209866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:55,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:55,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:57:55,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044381655] [2025-02-08 04:57:55,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:55,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:57:55,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:55,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:57:55,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:57:55,014 INFO L87 Difference]: Start difference. First operand 1439 states and 2069 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:57:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:55,298 INFO L93 Difference]: Finished difference Result 2315 states and 3370 transitions. [2025-02-08 04:57:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:57:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 252 [2025-02-08 04:57:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:55,306 INFO L225 Difference]: With dead ends: 2315 [2025-02-08 04:57:55,306 INFO L226 Difference]: Without dead ends: 1459 [2025-02-08 04:57:55,308 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-02-08 04:57:55,309 INFO L435 NwaCegarLoop]: 1205 mSDtfsCounter, 8 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:55,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2395 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:57:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-02-08 04:57:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1459. [2025-02-08 04:57:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1439 states have (on average 1.4315496872828353) internal successors, (2060), 1443 states have internal predecessors, (2060), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:57:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2089 transitions. [2025-02-08 04:57:55,360 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2089 transitions. Word has length 252 [2025-02-08 04:57:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:55,360 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2089 transitions. [2025-02-08 04:57:55,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:57:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2089 transitions. [2025-02-08 04:57:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-08 04:57:55,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:55,365 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:55,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 04:57:55,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:55,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash 330126583, now seen corresponding path program 1 times [2025-02-08 04:57:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:55,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119369690] [2025-02-08 04:57:55,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:55,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:57:55,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:57:55,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:55,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 04:57:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119369690] [2025-02-08 04:57:55,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119369690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:55,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:57:55,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:57:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000818667] [2025-02-08 04:57:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:55,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:57:55,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:55,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:57:55,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:57:55,852 INFO L87 Difference]: Start difference. First operand 1459 states and 2089 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:57:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:56,167 INFO L93 Difference]: Finished difference Result 2325 states and 3373 transitions. [2025-02-08 04:57:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:57:56,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 252 [2025-02-08 04:57:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:56,176 INFO L225 Difference]: With dead ends: 2325 [2025-02-08 04:57:56,176 INFO L226 Difference]: Without dead ends: 1397 [2025-02-08 04:57:56,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:57:56,178 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 32 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3376 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:56,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3376 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:57:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2025-02-08 04:57:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1397. [2025-02-08 04:57:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1377 states have (on average 1.4233841684822077) internal successors, (1960), 1381 states have internal predecessors, (1960), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:57:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1989 transitions. [2025-02-08 04:57:56,224 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1989 transitions. Word has length 252 [2025-02-08 04:57:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:56,225 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 1989 transitions. [2025-02-08 04:57:56,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:57:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1989 transitions. [2025-02-08 04:57:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-08 04:57:56,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:56,229 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:56,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 04:57:56,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1055817136, now seen corresponding path program 1 times [2025-02-08 04:57:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869423236] [2025-02-08 04:57:56,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:57:56,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:57:56,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:57:56,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:56,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:57:57,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:57:57,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869423236] [2025-02-08 04:57:57,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869423236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:57:57,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737873225] [2025-02-08 04:57:57,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:57,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:57:57,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:57:57,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:57:57,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 04:57:57,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:57:58,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:57:58,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:57:58,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:57:58,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 04:57:58,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:57:58,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:57:58,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:57:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:57:58,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:57:58,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737873225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:57:58,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:57:58,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-08 04:57:58,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607992540] [2025-02-08 04:57:58,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:57:58,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:57:58,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:57:58,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:57:58,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:57:58,653 INFO L87 Difference]: Start difference. First operand 1397 states and 1989 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:57:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:57:59,680 INFO L93 Difference]: Finished difference Result 2585 states and 3692 transitions. [2025-02-08 04:57:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:57:59,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 252 [2025-02-08 04:57:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:57:59,689 INFO L225 Difference]: With dead ends: 2585 [2025-02-08 04:57:59,690 INFO L226 Difference]: Without dead ends: 1715 [2025-02-08 04:57:59,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 241 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-08 04:57:59,693 INFO L435 NwaCegarLoop]: 1091 mSDtfsCounter, 1255 mSDsluCounter, 3601 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 4692 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 04:57:59,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 4692 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 04:57:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-02-08 04:57:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1557. [2025-02-08 04:57:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1532 states have (on average 1.4157963446475197) internal successors, (2169), 1536 states have internal predecessors, (2169), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 04:57:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2204 transitions. [2025-02-08 04:57:59,750 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2204 transitions. Word has length 252 [2025-02-08 04:57:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:57:59,751 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2204 transitions. [2025-02-08 04:57:59,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:57:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2204 transitions. [2025-02-08 04:57:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-08 04:57:59,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:57:59,756 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:57:59,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 04:57:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 04:57:59,957 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:57:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:57:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -519042996, now seen corresponding path program 1 times [2025-02-08 04:57:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:57:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432675363] [2025-02-08 04:57:59,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:57:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:58:00,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-08 04:58:00,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-08 04:58:00,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:00,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:58:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:58:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432675363] [2025-02-08 04:58:01,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432675363] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:58:01,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069226954] [2025-02-08 04:58:01,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:58:01,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:58:01,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:58:01,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:58:01,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 04:58:02,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-08 04:58:02,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-08 04:58:02,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:02,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:02,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 04:58:02,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:58:02,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 04:58:02,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:58:02,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:58:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:58:02,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:58:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:58:03,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069226954] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:58:03,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:58:03,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-02-08 04:58:03,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323054218] [2025-02-08 04:58:03,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:58:03,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 04:58:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:58:03,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 04:58:03,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:58:03,156 INFO L87 Difference]: Start difference. First operand 1557 states and 2204 transitions. Second operand has 12 states, 12 states have (on average 39.916666666666664) internal successors, (479), 12 states have internal predecessors, (479), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 04:58:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:58:04,326 INFO L93 Difference]: Finished difference Result 3812 states and 5350 transitions. [2025-02-08 04:58:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 04:58:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.916666666666664) internal successors, (479), 12 states have internal predecessors, (479), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 328 [2025-02-08 04:58:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:58:04,341 INFO L225 Difference]: With dead ends: 3812 [2025-02-08 04:58:04,341 INFO L226 Difference]: Without dead ends: 2489 [2025-02-08 04:58:04,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 645 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-02-08 04:58:04,346 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 1694 mSDsluCounter, 7116 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 8235 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:58:04,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 8235 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 04:58:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-02-08 04:58:04,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2205. [2025-02-08 04:58:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 2168 states have (on average 1.3916051660516606) internal successors, (3017), 2172 states have internal predecessors, (3017), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 04:58:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3074 transitions. [2025-02-08 04:58:04,426 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3074 transitions. Word has length 328 [2025-02-08 04:58:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:58:04,427 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 3074 transitions. [2025-02-08 04:58:04,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.916666666666664) internal successors, (479), 12 states have internal predecessors, (479), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 04:58:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3074 transitions. [2025-02-08 04:58:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2025-02-08 04:58:04,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:58:04,442 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:58:04,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 04:58:04,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:58:04,642 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:58:04,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:58:04,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1185734878, now seen corresponding path program 1 times [2025-02-08 04:58:04,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:58:04,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933733101] [2025-02-08 04:58:04,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:58:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:58:04,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 766 statements into 1 equivalence classes. [2025-02-08 04:58:05,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 766 of 766 statements. [2025-02-08 04:58:05,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:05,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:58:10,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:58:10,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933733101] [2025-02-08 04:58:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933733101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:58:10,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531582336] [2025-02-08 04:58:10,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:58:10,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:58:10,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:58:10,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:58:10,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 04:58:11,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 766 statements into 1 equivalence classes. [2025-02-08 04:58:12,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 766 of 766 statements. [2025-02-08 04:58:12,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:12,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:12,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 3764 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 04:58:12,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:58:12,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 04:58:12,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:58:13,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:58:13,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:58:13,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:58:13,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:58:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:58:13,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:58:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:58:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531582336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:58:14,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:58:14,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2025-02-08 04:58:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069988499] [2025-02-08 04:58:14,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:58:14,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 04:58:14,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:58:14,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 04:58:14,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-02-08 04:58:14,594 INFO L87 Difference]: Start difference. First operand 2205 states and 3074 transitions. Second operand has 21 states, 21 states have (on average 64.80952380952381) internal successors, (1361), 21 states have internal predecessors, (1361), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 04:58:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:58:16,239 INFO L93 Difference]: Finished difference Result 5546 states and 7693 transitions. [2025-02-08 04:58:16,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 04:58:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.80952380952381) internal successors, (1361), 21 states have internal predecessors, (1361), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 766 [2025-02-08 04:58:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:58:16,260 INFO L225 Difference]: With dead ends: 5546 [2025-02-08 04:58:16,261 INFO L226 Difference]: Without dead ends: 4223 [2025-02-08 04:58:16,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1555 GetRequests, 1519 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-02-08 04:58:16,267 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 5118 mSDsluCounter, 10021 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5160 SdHoareTripleChecker+Valid, 11140 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:58:16,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5160 Valid, 11140 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 04:58:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2025-02-08 04:58:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 3939. [2025-02-08 04:58:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3878 states have (on average 1.3690046415678185) internal successors, (5309), 3882 states have internal predecessors, (5309), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:58:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 5414 transitions. [2025-02-08 04:58:16,393 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 5414 transitions. Word has length 766 [2025-02-08 04:58:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:58:16,394 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 5414 transitions. [2025-02-08 04:58:16,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.80952380952381) internal successors, (1361), 21 states have internal predecessors, (1361), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 04:58:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 5414 transitions. [2025-02-08 04:58:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1643 [2025-02-08 04:58:16,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:58:16,483 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:58:16,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 04:58:16,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:58:16,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:58:16,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:58:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1850315390, now seen corresponding path program 2 times [2025-02-08 04:58:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:58:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561302526] [2025-02-08 04:58:16,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:58:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:58:17,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1642 statements into 2 equivalence classes. [2025-02-08 04:58:17,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1642 statements. [2025-02-08 04:58:17,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:58:17,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:58:17,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:58:17,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561302526] [2025-02-08 04:58:17,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561302526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:58:17,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:58:17,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 04:58:17,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646959281] [2025-02-08 04:58:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:58:17,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:58:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:58:17,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:58:17,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:58:17,602 INFO L87 Difference]: Start difference. First operand 3939 states and 5414 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:58:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:58:18,333 INFO L93 Difference]: Finished difference Result 4789 states and 6676 transitions. [2025-02-08 04:58:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:58:18,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1642 [2025-02-08 04:58:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:58:18,354 INFO L225 Difference]: With dead ends: 4789 [2025-02-08 04:58:18,358 INFO L226 Difference]: Without dead ends: 3950 [2025-02-08 04:58:18,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:58:18,362 INFO L435 NwaCegarLoop]: 1136 mSDtfsCounter, 53 mSDsluCounter, 4309 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 5445 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:58:18,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 5445 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:58:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2025-02-08 04:58:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3946. [2025-02-08 04:58:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 3885 states have (on average 1.3683397683397684) internal successors, (5316), 3889 states have internal predecessors, (5316), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:58:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5421 transitions. [2025-02-08 04:58:18,471 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5421 transitions. Word has length 1642 [2025-02-08 04:58:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:58:18,474 INFO L471 AbstractCegarLoop]: Abstraction has 3946 states and 5421 transitions. [2025-02-08 04:58:18,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:58:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5421 transitions. [2025-02-08 04:58:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1644 [2025-02-08 04:58:18,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:58:18,496 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:58:18,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 04:58:18,497 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:58:18,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:58:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1019974516, now seen corresponding path program 1 times [2025-02-08 04:58:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:58:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504864888] [2025-02-08 04:58:18,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:58:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:58:19,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1643 statements into 1 equivalence classes. [2025-02-08 04:58:20,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1643 of 1643 statements. [2025-02-08 04:58:20,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:20,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:58:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:58:23,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504864888] [2025-02-08 04:58:23,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504864888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:58:23,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:58:23,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 04:58:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154915595] [2025-02-08 04:58:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:58:23,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:58:23,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:58:23,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:58:23,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:58:23,519 INFO L87 Difference]: Start difference. First operand 3946 states and 5421 transitions. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:58:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:58:24,169 INFO L93 Difference]: Finished difference Result 4783 states and 6662 transitions. [2025-02-08 04:58:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:58:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1643 [2025-02-08 04:58:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:58:24,185 INFO L225 Difference]: With dead ends: 4783 [2025-02-08 04:58:24,185 INFO L226 Difference]: Without dead ends: 3954 [2025-02-08 04:58:24,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:58:24,189 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 25 mSDsluCounter, 5390 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6531 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:58:24,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6531 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:58:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2025-02-08 04:58:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3946. [2025-02-08 04:58:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 3885 states have (on average 1.3683397683397684) internal successors, (5316), 3889 states have internal predecessors, (5316), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:58:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5421 transitions. [2025-02-08 04:58:24,328 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5421 transitions. Word has length 1643 [2025-02-08 04:58:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:58:24,331 INFO L471 AbstractCegarLoop]: Abstraction has 3946 states and 5421 transitions. [2025-02-08 04:58:24,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:58:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5421 transitions. [2025-02-08 04:58:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1644 [2025-02-08 04:58:24,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:58:24,370 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:58:24,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 04:58:24,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:58:24,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:58:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1559442885, now seen corresponding path program 1 times [2025-02-08 04:58:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:58:24,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300109624] [2025-02-08 04:58:24,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:58:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:58:24,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1643 statements into 1 equivalence classes. [2025-02-08 04:58:25,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1643 of 1643 statements. [2025-02-08 04:58:25,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:25,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:58:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:58:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300109624] [2025-02-08 04:58:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300109624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:58:29,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:58:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:58:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671002963] [2025-02-08 04:58:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:58:29,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:58:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:58:29,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:58:29,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:58:29,506 INFO L87 Difference]: Start difference. First operand 3946 states and 5421 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:58:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:58:30,107 INFO L93 Difference]: Finished difference Result 4789 states and 6671 transitions. [2025-02-08 04:58:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:58:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1643 [2025-02-08 04:58:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:58:30,121 INFO L225 Difference]: With dead ends: 4789 [2025-02-08 04:58:30,121 INFO L226 Difference]: Without dead ends: 3951 [2025-02-08 04:58:30,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:58:30,124 INFO L435 NwaCegarLoop]: 1142 mSDtfsCounter, 21 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5436 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:58:30,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5436 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:58:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-02-08 04:58:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3950. [2025-02-08 04:58:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 3889 states have (on average 1.368218050912831) internal successors, (5321), 3893 states have internal predecessors, (5321), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:58:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5426 transitions. [2025-02-08 04:58:30,247 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5426 transitions. Word has length 1643 [2025-02-08 04:58:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:58:30,249 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 5426 transitions. [2025-02-08 04:58:30,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:58:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5426 transitions. [2025-02-08 04:58:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-02-08 04:58:30,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:58:30,287 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:58:30,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 04:58:30,288 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:58:30,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:58:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1520198281, now seen corresponding path program 1 times [2025-02-08 04:58:30,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:58:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500601934] [2025-02-08 04:58:30,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:58:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:58:30,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-02-08 04:58:31,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-02-08 04:58:31,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:31,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:58:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:58:34,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500601934] [2025-02-08 04:58:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500601934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:58:34,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:58:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 04:58:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517454547] [2025-02-08 04:58:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:58:34,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:58:34,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:58:34,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:58:34,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:58:34,819 INFO L87 Difference]: Start difference. First operand 3950 states and 5426 transitions. Second operand has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:58:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:58:35,536 INFO L93 Difference]: Finished difference Result 4795 states and 6678 transitions. [2025-02-08 04:58:35,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:58:35,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1644 [2025-02-08 04:58:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:58:35,548 INFO L225 Difference]: With dead ends: 4795 [2025-02-08 04:58:35,548 INFO L226 Difference]: Without dead ends: 3961 [2025-02-08 04:58:35,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:58:35,551 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 31 mSDsluCounter, 7603 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8742 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:58:35,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8742 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:58:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2025-02-08 04:58:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3958. [2025-02-08 04:58:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3897 states have (on average 1.3679753656658968) internal successors, (5331), 3901 states have internal predecessors, (5331), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:58:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 5436 transitions. [2025-02-08 04:58:35,701 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 5436 transitions. Word has length 1644 [2025-02-08 04:58:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:58:35,703 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 5436 transitions. [2025-02-08 04:58:35,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:58:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 5436 transitions. [2025-02-08 04:58:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-08 04:58:35,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:58:35,725 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:58:35,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 04:58:35,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:58:35,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:58:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2135571311, now seen corresponding path program 1 times [2025-02-08 04:58:35,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:58:35,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905912501] [2025-02-08 04:58:35,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:58:35,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:58:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-08 04:58:36,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-08 04:58:36,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 1988 proven. 75 refuted. 0 times theorem prover too weak. 5275 trivial. 0 not checked. [2025-02-08 04:58:41,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:58:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905912501] [2025-02-08 04:58:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905912501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:58:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057862385] [2025-02-08 04:58:41,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:58:41,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:58:41,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:58:41,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:58:41,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 04:58:43,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-08 04:58:44,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-08 04:58:44,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:58:44,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:58:44,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 8006 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 04:58:44,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:58:44,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13