./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.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 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:46:22,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:46:22,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:46:22,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:46:22,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:46:22,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:46:22,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:46:22,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:46:22,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:46:22,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:46:22,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:46:22,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:46:22,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:46:22,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:46:22,385 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:46:22,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:46:22,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:46:22,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:46:22,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:46:22,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:46:22,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:46:22,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:46:22,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:46:22,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:46:22,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:46:22,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:46:22,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:46:22,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:46:22,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:46:22,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:46:22,389 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 -> 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e [2025-01-09 20:46:22,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:46:22,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:46:22,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:46:22,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:46:22,610 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:46:22,611 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_JEN_test10-2.i [2025-01-09 20:46:23,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf93adbcf/08b1736e53664a36b07172de4d46981f/FLAG36f9d0b2c [2025-01-09 20:46:24,140 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:46:24,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-01-09 20:46:24,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf93adbcf/08b1736e53664a36b07172de4d46981f/FLAG36f9d0b2c [2025-01-09 20:46:24,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf93adbcf/08b1736e53664a36b07172de4d46981f [2025-01-09 20:46:24,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:46:24,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:46:24,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:46:24,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:46:24,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:46:24,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:24,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791212dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24, skipping insertion in model container [2025-01-09 20:46:24,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:24,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:46:24,582 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_JEN_test10-2.i[33022,33035] [2025-01-09 20:46:24,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:46:24,733 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:46:24,757 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_JEN_test10-2.i[33022,33035] [2025-01-09 20:46:24,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:46:24,888 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:46:24,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24 WrapperNode [2025-01-09 20:46:24,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:46:24,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:46:24,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:46:24,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:46:24,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:24,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:24,992 INFO L138 Inliner]: procedures = 177, calls = 557, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3464 [2025-01-09 20:46:24,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:46:24,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:46:24,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:46:24,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:46:25,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,160 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 420, 106]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 90, 4]. [2025-01-09 20:46:25,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:46:25,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:46:25,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:46:25,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:46:25,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (1/1) ... [2025-01-09 20:46:25,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:46:25,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:46:25,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:46:25,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-01-09 20:46:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:46:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:46:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:46:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:46:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:46:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:46:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:46:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:46:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:46:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:46:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:46:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:46:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:46:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:46:25,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:46:25,611 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:46:25,612 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:46:27,719 INFO L? ?]: Removed 806 outVars from TransFormulas that were not future-live. [2025-01-09 20:46:27,719 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:46:27,741 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:46:27,741 INFO L312 CfgBuilder]: Removed 77 assume(true) statements. [2025-01-09 20:46:27,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:27 BoogieIcfgContainer [2025-01-09 20:46:27,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:46:27,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:46:27,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:46:27,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:46:27,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:46:24" (1/3) ... [2025-01-09 20:46:27,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d504825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:46:27, skipping insertion in model container [2025-01-09 20:46:27,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:24" (2/3) ... [2025-01-09 20:46:27,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d504825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:46:27, skipping insertion in model container [2025-01-09 20:46:27,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:27" (3/3) ... [2025-01-09 20:46:27,749 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-2.i [2025-01-09 20:46:27,760 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:46:27,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test10-2.i that has 6 procedures, 1066 locations, 1 initial locations, 89 loop locations, and 1 error locations. [2025-01-09 20:46:27,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:46:27,849 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;@42148b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:46:27,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:46:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 1058 states, 1039 states have (on average 1.6198267564966313) internal successors, (1683), 1044 states have internal predecessors, (1683), 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-01-09 20:46:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 20:46:27,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:27,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:27,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:27,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash 497311879, now seen corresponding path program 1 times [2025-01-09 20:46:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839455266] [2025-01-09 20:46:27,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:27,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 20:46:27,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 20:46:27,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:27,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839455266] [2025-01-09 20:46:28,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839455266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:28,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:28,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:46:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241278130] [2025-01-09 20:46:28,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:28,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:46:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:46:28,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:46:28,037 INFO L87 Difference]: Start difference. First operand has 1058 states, 1039 states have (on average 1.6198267564966313) internal successors, (1683), 1044 states have internal predecessors, (1683), 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.5) internal successors, (11), 2 states have internal predecessors, (11), 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-01-09 20:46:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:28,110 INFO L93 Difference]: Finished difference Result 2114 states and 3428 transitions. [2025-01-09 20:46:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:46:28,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2025-01-09 20:46:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:28,124 INFO L225 Difference]: With dead ends: 2114 [2025-01-09 20:46:28,124 INFO L226 Difference]: Without dead ends: 1021 [2025-01-09 20:46:28,132 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-01-09 20:46:28,134 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:28,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-01-09 20:46:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2025-01-09 20:46:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1003 states have (on average 1.4745762711864407) internal successors, (1479), 1008 states have internal predecessors, (1479), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:46:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1506 transitions. [2025-01-09 20:46:28,199 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1506 transitions. Word has length 13 [2025-01-09 20:46:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:28,199 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1506 transitions. [2025-01-09 20:46:28,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-01-09 20:46:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1506 transitions. [2025-01-09 20:46:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:46:28,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:28,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:28,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:46:28,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:28,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1564019447, now seen corresponding path program 1 times [2025-01-09 20:46:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094327966] [2025-01-09 20:46:28,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:28,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:46:28,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:46:28,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:28,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:28,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:28,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094327966] [2025-01-09 20:46:28,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094327966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:28,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:28,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:46:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946689354] [2025-01-09 20:46:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:28,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:46:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:28,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:46:28,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:46:28,557 INFO L87 Difference]: Start difference. First operand 1021 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 20:46:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:28,734 INFO L93 Difference]: Finished difference Result 2036 states and 3006 transitions. [2025-01-09 20:46:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:46:28,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67 [2025-01-09 20:46:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:28,743 INFO L225 Difference]: With dead ends: 2036 [2025-01-09 20:46:28,744 INFO L226 Difference]: Without dead ends: 1406 [2025-01-09 20:46:28,745 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-01-09 20:46:28,745 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 547 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:28,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 4440 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:46:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-01-09 20:46:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1023. [2025-01-09 20:46:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1005 states have (on average 1.4736318407960198) internal successors, (1481), 1010 states have internal predecessors, (1481), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:46:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2025-01-09 20:46:28,780 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 67 [2025-01-09 20:46:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:28,781 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2025-01-09 20:46:28,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 20:46:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2025-01-09 20:46:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 20:46:28,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:28,786 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] [2025-01-09 20:46:28,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:46:28,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:28,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash 440587507, now seen corresponding path program 1 times [2025-01-09 20:46:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:28,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709333330] [2025-01-09 20:46:28,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:28,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 20:46:28,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 20:46:28,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:28,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:29,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709333330] [2025-01-09 20:46:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709333330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:29,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:46:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204562252] [2025-01-09 20:46:29,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:29,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:46:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:29,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:46:29,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:46:29,213 INFO L87 Difference]: Start difference. First operand 1023 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-01-09 20:46:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:29,339 INFO L93 Difference]: Finished difference Result 2425 states and 3570 transitions. [2025-01-09 20:46:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:46:29,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 144 [2025-01-09 20:46:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:29,345 INFO L225 Difference]: With dead ends: 2425 [2025-01-09 20:46:29,345 INFO L226 Difference]: Without dead ends: 1406 [2025-01-09 20:46:29,347 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-01-09 20:46:29,348 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 542 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4535 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:29,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4535 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:46:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-01-09 20:46:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1027. [2025-01-09 20:46:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1009 states have (on average 1.4717542120911793) internal successors, (1485), 1014 states have internal predecessors, (1485), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:46:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1512 transitions. [2025-01-09 20:46:29,375 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1512 transitions. Word has length 144 [2025-01-09 20:46:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:29,375 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1512 transitions. [2025-01-09 20:46:29,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-01-09 20:46:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1512 transitions. [2025-01-09 20:46:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:46:29,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:29,378 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, 1, 1] [2025-01-09 20:46:29,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:46:29,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:29,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash 68284982, now seen corresponding path program 1 times [2025-01-09 20:46:29,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:29,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322403668] [2025-01-09 20:46:29,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:29,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:29,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:46:29,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:46:29,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:29,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:29,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:29,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322403668] [2025-01-09 20:46:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322403668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:29,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:46:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505379034] [2025-01-09 20:46:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:29,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:46:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:29,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:46:29,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:46:29,759 INFO L87 Difference]: Start difference. First operand 1027 states and 1512 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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-01-09 20:46:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:29,854 INFO L93 Difference]: Finished difference Result 2004 states and 2950 transitions. [2025-01-09 20:46:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:46:29,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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 214 [2025-01-09 20:46:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:29,858 INFO L225 Difference]: With dead ends: 2004 [2025-01-09 20:46:29,858 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 20:46:29,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:46:29,861 INFO L435 NwaCegarLoop]: 1404 mSDtfsCounter, 33 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4194 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:29,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4194 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:46:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 20:46:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-01-09 20:46:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 967 states have (on average 1.4560496380558428) internal successors, (1408), 972 states have internal predecessors, (1408), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:46:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1435 transitions. [2025-01-09 20:46:29,880 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1435 transitions. Word has length 214 [2025-01-09 20:46:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:29,881 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1435 transitions. [2025-01-09 20:46:29,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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-01-09 20:46:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1435 transitions. [2025-01-09 20:46:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:46:29,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:29,883 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, 1, 1] [2025-01-09 20:46:29,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:46:29,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:29,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash -756815256, now seen corresponding path program 1 times [2025-01-09 20:46:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:29,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649390218] [2025-01-09 20:46:29,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:29,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:46:29,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:46:29,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:29,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:30,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:30,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649390218] [2025-01-09 20:46:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649390218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:46:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17608639] [2025-01-09 20:46:30,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:30,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:46:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:30,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:46:30,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:30,122 INFO L87 Difference]: Start difference. First operand 985 states and 1435 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-09 20:46:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:30,173 INFO L93 Difference]: Finished difference Result 1962 states and 2862 transitions. [2025-01-09 20:46:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:46:30,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 214 [2025-01-09 20:46:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:30,180 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 20:46:30,180 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 20:46:30,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:30,182 INFO L435 NwaCegarLoop]: 1417 mSDtfsCounter, 1 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:30,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2812 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 20:46:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-01-09 20:46:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 967 states have (on average 1.452947259565667) internal successors, (1405), 972 states have internal predecessors, (1405), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:46:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1432 transitions. [2025-01-09 20:46:30,200 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1432 transitions. Word has length 214 [2025-01-09 20:46:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:30,200 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1432 transitions. [2025-01-09 20:46:30,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-09 20:46:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1432 transitions. [2025-01-09 20:46:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:46:30,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:30,203 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, 1, 1] [2025-01-09 20:46:30,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:46:30,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:30,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -932444308, now seen corresponding path program 1 times [2025-01-09 20:46:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:30,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818120809] [2025-01-09 20:46:30,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:30,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:46:30,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:46:30,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:30,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:30,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:30,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818120809] [2025-01-09 20:46:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818120809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:46:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415909859] [2025-01-09 20:46:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:30,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:46:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:46:30,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:30,393 INFO L87 Difference]: Start difference. First operand 985 states and 1432 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-09 20:46:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:30,496 INFO L93 Difference]: Finished difference Result 2489 states and 3632 transitions. [2025-01-09 20:46:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:46:30,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 214 [2025-01-09 20:46:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:30,502 INFO L225 Difference]: With dead ends: 2489 [2025-01-09 20:46:30,502 INFO L226 Difference]: Without dead ends: 1512 [2025-01-09 20:46:30,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:30,504 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 713 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:30,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2824 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:46:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-01-09 20:46:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1354. [2025-01-09 20:46:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1334 states have (on average 1.4550224887556222) internal successors, (1941), 1339 states have internal predecessors, (1941), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:46:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1972 transitions. [2025-01-09 20:46:30,529 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1972 transitions. Word has length 214 [2025-01-09 20:46:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1972 transitions. [2025-01-09 20:46:30,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-09 20:46:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1972 transitions. [2025-01-09 20:46:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:46:30,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:30,531 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, 1, 1] [2025-01-09 20:46:30,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:46:30,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:30,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:30,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1848434490, now seen corresponding path program 1 times [2025-01-09 20:46:30,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:30,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234184779] [2025-01-09 20:46:30,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:30,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:46:30,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:46:30,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:30,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:30,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:30,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234184779] [2025-01-09 20:46:30,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234184779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:46:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650132508] [2025-01-09 20:46:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:30,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:46:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:30,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:46:30,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:46:30,798 INFO L87 Difference]: Start difference. First operand 1354 states and 1972 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-01-09 20:46:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:30,875 INFO L93 Difference]: Finished difference Result 2619 states and 3827 transitions. [2025-01-09 20:46:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:46:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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 229 [2025-01-09 20:46:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:30,880 INFO L225 Difference]: With dead ends: 2619 [2025-01-09 20:46:30,880 INFO L226 Difference]: Without dead ends: 1357 [2025-01-09 20:46:30,882 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-01-09 20:46:30,882 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 105 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:30,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 4095 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-01-09 20:46:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1354. [2025-01-09 20:46:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1334 states have (on average 1.449775112443778) internal successors, (1934), 1339 states have internal predecessors, (1934), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:46:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1965 transitions. [2025-01-09 20:46:30,908 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1965 transitions. Word has length 229 [2025-01-09 20:46:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:30,908 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1965 transitions. [2025-01-09 20:46:30,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-01-09 20:46:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1965 transitions. [2025-01-09 20:46:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:46:30,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:30,911 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, 1, 1] [2025-01-09 20:46:30,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:46:30,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:30,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1073182290, now seen corresponding path program 1 times [2025-01-09 20:46:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556368298] [2025-01-09 20:46:30,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:46:31,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:46:31,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:31,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556368298] [2025-01-09 20:46:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556368298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:31,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:46:31,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642456932] [2025-01-09 20:46:31,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:31,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:46:31,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:31,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:46:31,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:31,165 INFO L87 Difference]: Start difference. First operand 1354 states and 1965 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-09 20:46:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:31,221 INFO L93 Difference]: Finished difference Result 2622 states and 3819 transitions. [2025-01-09 20:46:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:46:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 229 [2025-01-09 20:46:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:31,228 INFO L225 Difference]: With dead ends: 2622 [2025-01-09 20:46:31,228 INFO L226 Difference]: Without dead ends: 1360 [2025-01-09 20:46:31,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:31,230 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 1 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:31,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2798 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-01-09 20:46:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2025-01-09 20:46:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1340 states have (on average 1.4477611940298507) internal successors, (1940), 1345 states have internal predecessors, (1940), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:46:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1971 transitions. [2025-01-09 20:46:31,260 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1971 transitions. Word has length 229 [2025-01-09 20:46:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:31,261 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1971 transitions. [2025-01-09 20:46:31,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-09 20:46:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1971 transitions. [2025-01-09 20:46:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:46:31,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:31,264 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, 1, 1] [2025-01-09 20:46:31,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:46:31,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:31,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1544538640, now seen corresponding path program 1 times [2025-01-09 20:46:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:31,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146691146] [2025-01-09 20:46:31,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:31,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:46:31,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:46:31,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:31,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146691146] [2025-01-09 20:46:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146691146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:31,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:46:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387466356] [2025-01-09 20:46:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:31,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:46:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:31,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:46:31,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:31,501 INFO L87 Difference]: Start difference. First operand 1360 states and 1971 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-09 20:46:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:31,578 INFO L93 Difference]: Finished difference Result 3243 states and 4728 transitions. [2025-01-09 20:46:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:46:31,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 229 [2025-01-09 20:46:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:31,584 INFO L225 Difference]: With dead ends: 3243 [2025-01-09 20:46:31,584 INFO L226 Difference]: Without dead ends: 1975 [2025-01-09 20:46:31,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:31,586 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 670 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:31,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 3034 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-01-09 20:46:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1970. [2025-01-09 20:46:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1944 states have (on average 1.4542181069958848) internal successors, (2827), 1949 states have internal predecessors, (2827), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:46:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2870 transitions. [2025-01-09 20:46:31,620 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2870 transitions. Word has length 229 [2025-01-09 20:46:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:31,620 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2870 transitions. [2025-01-09 20:46:31,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-09 20:46:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2870 transitions. [2025-01-09 20:46:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-09 20:46:31,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:31,622 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] [2025-01-09 20:46:31,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:46:31,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:31,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 424510615, now seen corresponding path program 1 times [2025-01-09 20:46:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779083475] [2025-01-09 20:46:31,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:31,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 20:46:31,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 20:46:31,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:31,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:46:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779083475] [2025-01-09 20:46:31,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779083475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:31,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:31,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:46:31,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769466156] [2025-01-09 20:46:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:31,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:46:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:31,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:46:31,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:46:31,931 INFO L87 Difference]: Start difference. First operand 1970 states and 2870 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-01-09 20:46:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:32,412 INFO L93 Difference]: Finished difference Result 4191 states and 6139 transitions. [2025-01-09 20:46:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:46:32,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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 244 [2025-01-09 20:46:32,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:32,421 INFO L225 Difference]: With dead ends: 4191 [2025-01-09 20:46:32,421 INFO L226 Difference]: Without dead ends: 2506 [2025-01-09 20:46:32,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:46:32,424 INFO L435 NwaCegarLoop]: 1485 mSDtfsCounter, 4867 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:32,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 3080 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:46:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2025-01-09 20:46:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1544. [2025-01-09 20:46:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1523 states have (on average 1.4412344057780695) internal successors, (2195), 1528 states have internal predecessors, (2195), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:46:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2228 transitions. [2025-01-09 20:46:32,472 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2228 transitions. Word has length 244 [2025-01-09 20:46:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:32,472 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2228 transitions. [2025-01-09 20:46:32,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-01-09 20:46:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2228 transitions. [2025-01-09 20:46:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 20:46:32,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:32,475 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, 1, 1] [2025-01-09 20:46:32,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:46:32,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:32,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1619050630, now seen corresponding path program 1 times [2025-01-09 20:46:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:32,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912921671] [2025-01-09 20:46:32,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:32,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:46:32,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:46:32,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:32,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 20:46:32,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912921671] [2025-01-09 20:46:32,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912921671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:32,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:32,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:46:32,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811342626] [2025-01-09 20:46:32,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:32,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:46:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:32,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:46:32,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:46:32,771 INFO L87 Difference]: Start difference. First operand 1544 states and 2228 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-01-09 20:46:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:32,864 INFO L93 Difference]: Finished difference Result 2413 states and 3522 transitions. [2025-01-09 20:46:32,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:46:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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 254 [2025-01-09 20:46:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:32,877 INFO L225 Difference]: With dead ends: 2413 [2025-01-09 20:46:32,877 INFO L226 Difference]: Without dead ends: 1502 [2025-01-09 20:46:32,879 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-01-09 20:46:32,880 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 30 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:32,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3920 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-01-09 20:46:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2025-01-09 20:46:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1481 states have (on average 1.4301147873058744) internal successors, (2118), 1486 states have internal predecessors, (2118), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:46:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2151 transitions. [2025-01-09 20:46:32,913 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2151 transitions. Word has length 254 [2025-01-09 20:46:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:32,913 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2151 transitions. [2025-01-09 20:46:32,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-01-09 20:46:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2151 transitions. [2025-01-09 20:46:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 20:46:32,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:32,916 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, 1, 1] [2025-01-09 20:46:32,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:46:32,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:32,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1193511558, now seen corresponding path program 1 times [2025-01-09 20:46:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:32,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384984724] [2025-01-09 20:46:32,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:32,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:46:33,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:46:33,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:33,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:46:33,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:33,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384984724] [2025-01-09 20:46:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384984724] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:46:33,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246871846] [2025-01-09 20:46:33,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:33,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:33,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:46:33,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:46:33,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:46:33,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:46:34,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:46:34,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:34,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:34,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:46:34,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:46:34,145 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 11 treesize of output 7 [2025-01-09 20:46:34,486 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 19 treesize of output 11 [2025-01-09 20:46:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:46:34,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:46:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:46:34,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246871846] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:46:34,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:46:34,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-01-09 20:46:34,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409424007] [2025-01-09 20:46:34,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:46:34,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 20:46:34,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:34,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 20:46:34,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:46:34,733 INFO L87 Difference]: Start difference. First operand 1502 states and 2151 transitions. Second operand has 12 states, 12 states have (on average 46.333333333333336) internal successors, (556), 12 states have internal predecessors, (556), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:46:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:35,175 INFO L93 Difference]: Finished difference Result 3461 states and 4928 transitions. [2025-01-09 20:46:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:46:35,176 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 46.333333333333336) internal successors, (556), 12 states have internal predecessors, (556), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 254 [2025-01-09 20:46:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:35,184 INFO L225 Difference]: With dead ends: 3461 [2025-01-09 20:46:35,184 INFO L226 Difference]: Without dead ends: 2588 [2025-01-09 20:46:35,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 496 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:46:35,186 INFO L435 NwaCegarLoop]: 1719 mSDtfsCounter, 2608 mSDsluCounter, 9454 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2623 SdHoareTripleChecker+Valid, 11173 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:35,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2623 Valid, 11173 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:46:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2025-01-09 20:46:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2250. [2025-01-09 20:46:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2217 states have (on average 1.406405051871899) internal successors, (3118), 2222 states have internal predecessors, (3118), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 20:46:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 3173 transitions. [2025-01-09 20:46:35,230 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 3173 transitions. Word has length 254 [2025-01-09 20:46:35,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:35,230 INFO L471 AbstractCegarLoop]: Abstraction has 2250 states and 3173 transitions. [2025-01-09 20:46:35,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 46.333333333333336) internal successors, (556), 12 states have internal predecessors, (556), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:46:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 3173 transitions. [2025-01-09 20:46:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 20:46:35,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:35,236 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:35,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:46:35,438 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,SelfDestructingSolverStorable11 [2025-01-09 20:46:35,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:35,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1210224578, now seen corresponding path program 1 times [2025-01-09 20:46:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625135396] [2025-01-09 20:46:35,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:35,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 20:46:35,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 20:46:35,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:35,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 235 proven. 6 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-09 20:46:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625135396] [2025-01-09 20:46:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625135396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:46:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898917564] [2025-01-09 20:46:36,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:46:36,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:46:36,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:46:37,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 20:46:37,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 20:46:37,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:37,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:37,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:46:37,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:46:37,614 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 11 treesize of output 7 [2025-01-09 20:46:37,859 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 19 treesize of output 11 [2025-01-09 20:46:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 235 proven. 6 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-09 20:46:37,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:46:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 235 proven. 6 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-09 20:46:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898917564] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:46:38,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:46:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 13 [2025-01-09 20:46:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375139156] [2025-01-09 20:46:38,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:46:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 20:46:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:38,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 20:46:38,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:46:38,114 INFO L87 Difference]: Start difference. First operand 2250 states and 3173 transitions. Second operand has 13 states, 13 states have (on average 49.69230769230769) internal successors, (646), 13 states have internal predecessors, (646), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:46:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:38,557 INFO L93 Difference]: Finished difference Result 4343 states and 6142 transitions. [2025-01-09 20:46:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 20:46:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 49.69230769230769) internal successors, (646), 13 states have internal predecessors, (646), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 485 [2025-01-09 20:46:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:38,565 INFO L225 Difference]: With dead ends: 4343 [2025-01-09 20:46:38,565 INFO L226 Difference]: Without dead ends: 2588 [2025-01-09 20:46:38,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 959 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-01-09 20:46:38,568 INFO L435 NwaCegarLoop]: 1745 mSDtfsCounter, 2736 mSDsluCounter, 11785 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2750 SdHoareTripleChecker+Valid, 13530 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:38,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2750 Valid, 13530 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:46:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2025-01-09 20:46:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2254. [2025-01-09 20:46:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2221 states have (on average 1.4047726249437191) internal successors, (3120), 2226 states have internal predecessors, (3120), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 20:46:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3175 transitions. [2025-01-09 20:46:38,622 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3175 transitions. Word has length 485 [2025-01-09 20:46:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:38,623 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3175 transitions. [2025-01-09 20:46:38,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 49.69230769230769) internal successors, (646), 13 states have internal predecessors, (646), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:46:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3175 transitions. [2025-01-09 20:46:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-01-09 20:46:38,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:38,655 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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-01-09 20:46:38,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:46:38,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:38,856 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:38,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1403299735, now seen corresponding path program 1 times [2025-01-09 20:46:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:38,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438204469] [2025-01-09 20:46:38,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:39,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 20:46:39,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 20:46:39,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:39,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 878 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:46:42,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438204469] [2025-01-09 20:46:42,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438204469] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:46:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602344305] [2025-01-09 20:46:42,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:42,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:46:42,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:46:42,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:46:42,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 20:46:43,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 20:46:43,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:43,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:43,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 3384 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 20:46:43,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:46:43,122 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 11 treesize of output 7 [2025-01-09 20:46:43,373 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 19 treesize of output 11 [2025-01-09 20:46:43,529 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 19 treesize of output 11 [2025-01-09 20:46:43,761 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 19 treesize of output 11 [2025-01-09 20:46:44,019 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 19 treesize of output 11 [2025-01-09 20:46:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 878 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:46:44,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:46:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 878 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:46:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602344305] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:46:44,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:46:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2025-01-09 20:46:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911946926] [2025-01-09 20:46:44,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:46:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 20:46:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:44,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 20:46:44,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-01-09 20:46:44,786 INFO L87 Difference]: Start difference. First operand 2254 states and 3175 transitions. Second operand has 24 states, 24 states have (on average 78.29166666666667) internal successors, (1879), 24 states have internal predecessors, (1879), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:46:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:45,633 INFO L93 Difference]: Finished difference Result 5501 states and 7730 transitions. [2025-01-09 20:46:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:46:45,635 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 78.29166666666667) internal successors, (1879), 24 states have internal predecessors, (1879), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 695 [2025-01-09 20:46:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:45,656 INFO L225 Difference]: With dead ends: 5501 [2025-01-09 20:46:45,659 INFO L226 Difference]: Without dead ends: 4628 [2025-01-09 20:46:45,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1413 GetRequests, 1375 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 20:46:45,663 INFO L435 NwaCegarLoop]: 3078 mSDtfsCounter, 7097 mSDsluCounter, 21041 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7136 SdHoareTripleChecker+Valid, 24119 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:45,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7136 Valid, 24119 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:46:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2025-01-09 20:46:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 4290. [2025-01-09 20:46:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 4233 states have (on average 1.3864871249704702) internal successors, (5869), 4238 states have internal predecessors, (5869), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 20:46:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 5972 transitions. [2025-01-09 20:46:45,759 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 5972 transitions. Word has length 695 [2025-01-09 20:46:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:45,760 INFO L471 AbstractCegarLoop]: Abstraction has 4290 states and 5972 transitions. [2025-01-09 20:46:45,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 78.29166666666667) internal successors, (1879), 24 states have internal predecessors, (1879), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:46:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 5972 transitions. [2025-01-09 20:46:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1158 [2025-01-09 20:46:45,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:45,788 INFO L218 NwaCegarLoop]: trace histogram [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, 10, 9, 9, 9, 6, 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-01-09 20:46:45,807 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-01-09 20:46:45,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:45,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:45,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:45,991 INFO L85 PathProgramCache]: Analyzing trace with hash 259646551, now seen corresponding path program 1 times [2025-01-09 20:46:45,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:45,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498376528] [2025-01-09 20:46:45,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:45,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:46,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes. [2025-01-09 20:46:46,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements. [2025-01-09 20:46:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1852 proven. 894 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2025-01-09 20:46:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498376528] [2025-01-09 20:46:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498376528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:46:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087067764] [2025-01-09 20:46:52,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:52,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:46:52,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:46:52,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:46:53,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes. [2025-01-09 20:46:54,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements. [2025-01-09 20:46:54,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:54,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:54,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 5664 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 20:46:54,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:46:54,426 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 11 treesize of output 7 [2025-01-09 20:46:54,668 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 19 treesize of output 11 [2025-01-09 20:46:54,824 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 19 treesize of output 11 [2025-01-09 20:46:54,977 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 19 treesize of output 11 [2025-01-09 20:46:55,121 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 19 treesize of output 11 [2025-01-09 20:46:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1852 proven. 894 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2025-01-09 20:46:55,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:46:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1852 proven. 894 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2025-01-09 20:46:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087067764] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:46:55,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:46:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 25 [2025-01-09 20:46:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763630151] [2025-01-09 20:46:55,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:46:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 20:46:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:55,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 20:46:55,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-01-09 20:46:55,759 INFO L87 Difference]: Start difference. First operand 4290 states and 5972 transitions. Second operand has 25 states, 25 states have (on average 78.76) internal successors, (1969), 25 states have internal predecessors, (1969), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:46:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:56,774 INFO L93 Difference]: Finished difference Result 7403 states and 10342 transitions. [2025-01-09 20:46:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 20:46:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 78.76) internal successors, (1969), 25 states have internal predecessors, (1969), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1157 [2025-01-09 20:46:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:56,791 INFO L225 Difference]: With dead ends: 7403 [2025-01-09 20:46:56,791 INFO L226 Difference]: Without dead ends: 4628 [2025-01-09 20:46:56,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2344 GetRequests, 2300 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 20:46:56,797 INFO L435 NwaCegarLoop]: 3101 mSDtfsCounter, 9753 mSDsluCounter, 28144 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9791 SdHoareTripleChecker+Valid, 31245 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:56,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9791 Valid, 31245 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:46:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2025-01-09 20:46:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 4294. [2025-01-09 20:46:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 4237 states have (on average 1.3849421760679725) internal successors, (5868), 4242 states have internal predecessors, (5868), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 20:46:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 5971 transitions. [2025-01-09 20:46:56,881 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 5971 transitions. Word has length 1157 [2025-01-09 20:46:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:56,882 INFO L471 AbstractCegarLoop]: Abstraction has 4294 states and 5971 transitions. [2025-01-09 20:46:56,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 78.76) internal successors, (1969), 25 states have internal predecessors, (1969), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:46:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 5971 transitions. [2025-01-09 20:46:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2025-01-09 20:46:56,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:56,898 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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-01-09 20:46:56,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 20:46:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 20:46:57,099 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:57,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash -532771593, now seen corresponding path program 2 times [2025-01-09 20:46:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13196956] [2025-01-09 20:46:57,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:46:57,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:57,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1577 statements into 2 equivalence classes. [2025-01-09 20:46:57,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 1577 statements. [2025-01-09 20:46:57,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:46:57,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6623 trivial. 0 not checked. [2025-01-09 20:46:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13196956] [2025-01-09 20:46:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13196956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:57,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:46:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437975232] [2025-01-09 20:46:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:57,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:46:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:57,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:46:57,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:46:57,753 INFO L87 Difference]: Start difference. First operand 4294 states and 5971 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-01-09 20:46:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:58,736 INFO L93 Difference]: Finished difference Result 5141 states and 7228 transitions. [2025-01-09 20:46:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:46:58,736 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 1577 [2025-01-09 20:46:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:58,749 INFO L225 Difference]: With dead ends: 5141 [2025-01-09 20:46:58,749 INFO L226 Difference]: Without dead ends: 4306 [2025-01-09 20:46:58,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:46:58,752 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 414 mSDsluCounter, 5783 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 7094 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:58,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 7094 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 20:46:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2025-01-09 20:46:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 4301. [2025-01-09 20:46:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4301 states, 4244 states have (on average 1.3843072573044297) internal successors, (5875), 4249 states have internal predecessors, (5875), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 20:46:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4301 states to 4301 states and 5978 transitions. [2025-01-09 20:46:58,832 INFO L78 Accepts]: Start accepts. Automaton has 4301 states and 5978 transitions. Word has length 1577 [2025-01-09 20:46:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:58,833 INFO L471 AbstractCegarLoop]: Abstraction has 4301 states and 5978 transitions. [2025-01-09 20:46:58,833 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-01-09 20:46:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4301 states and 5978 transitions. [2025-01-09 20:46:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2025-01-09 20:46:58,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:58,849 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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-01-09 20:46:58,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:46:58,849 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:58,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1406390453, now seen corresponding path program 1 times [2025-01-09 20:46:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374066551] [2025-01-09 20:46:58,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:59,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1577 statements into 1 equivalence classes. [2025-01-09 20:46:59,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1577 of 1577 statements. [2025-01-09 20:46:59,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:59,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:47:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6623 trivial. 0 not checked. [2025-01-09 20:47:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:47:01,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374066551] [2025-01-09 20:47:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374066551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:47:01,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:47:01,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:47:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471358445] [2025-01-09 20:47:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:47:01,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:47:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:47:01,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:47:01,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:47:01,540 INFO L87 Difference]: Start difference. First operand 4301 states and 5978 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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-01-09 20:47:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:47:01,665 INFO L93 Difference]: Finished difference Result 5139 states and 7225 transitions. [2025-01-09 20:47:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:47:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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 1577 [2025-01-09 20:47:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:47:01,678 INFO L225 Difference]: With dead ends: 5139 [2025-01-09 20:47:01,678 INFO L226 Difference]: Without dead ends: 4294 [2025-01-09 20:47:01,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:47:01,681 INFO L435 NwaCegarLoop]: 1324 mSDtfsCounter, 1 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:47:01,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2626 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:47:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2025-01-09 20:47:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 4294. [2025-01-09 20:47:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 4237 states have (on average 1.3839981118716074) internal successors, (5864), 4242 states have internal predecessors, (5864), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 20:47:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 5967 transitions. [2025-01-09 20:47:01,753 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 5967 transitions. Word has length 1577 [2025-01-09 20:47:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:47:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 4294 states and 5967 transitions. [2025-01-09 20:47:01,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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-01-09 20:47:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 5967 transitions. [2025-01-09 20:47:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1579 [2025-01-09 20:47:01,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:47:01,770 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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-01-09 20:47:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:47:01,770 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:47:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:47:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1983721171, now seen corresponding path program 1 times [2025-01-09 20:47:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:47:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537279018] [2025-01-09 20:47:01,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:47:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:47:02,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1578 statements into 1 equivalence classes. [2025-01-09 20:47:02,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1578 of 1578 statements. [2025-01-09 20:47:02,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:47:02,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:47:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 1302 proven. 1 refuted. 0 times theorem prover too weak. 5320 trivial. 0 not checked. [2025-01-09 20:47:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:47:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537279018] [2025-01-09 20:47:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537279018] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:47:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213331845] [2025-01-09 20:47:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:47:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:47:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:47:05,973 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:47:05,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 20:47:07,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1578 statements into 1 equivalence classes. [2025-01-09 20:47:08,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1578 of 1578 statements. [2025-01-09 20:47:08,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:47:08,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:47:08,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 7627 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 20:47:08,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:47:08,178 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 11 treesize of output 7 [2025-01-09 20:47:08,441 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 19 treesize of output 11 [2025-01-09 20:47:08,569 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 19 treesize of output 11 [2025-01-09 20:47:08,717 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 19 treesize of output 11 [2025-01-09 20:47:08,840 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 19 treesize of output 11 [2025-01-09 20:47:08,966 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 19 treesize of output 11 [2025-01-09 20:47:09,114 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 19 treesize of output 11 [2025-01-09 20:47:09,269 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 19 treesize of output 11 [2025-01-09 20:47:09,421 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 19 treesize of output 11 [2025-01-09 20:47:09,571 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 19 treesize of output 11 [2025-01-09 20:47:09,720 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 19 treesize of output 11 [2025-01-09 20:47:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 0 proven. 6599 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:47:09,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:47:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 0 proven. 6599 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:47:11,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213331845] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:47:11,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:47:11,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 14] total 31 [2025-01-09 20:47:11,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360982276] [2025-01-09 20:47:11,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:47:11,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 20:47:11,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:47:11,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 20:47:11,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=649, Unknown=0, NotChecked=0, Total=930 [2025-01-09 20:47:11,212 INFO L87 Difference]: Start difference. First operand 4294 states and 5967 transitions. Second operand has 31 states, 31 states have (on average 108.2258064516129) internal successors, (3355), 31 states have internal predecessors, (3355), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:47:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:47:13,755 INFO L93 Difference]: Finished difference Result 8467 states and 11869 transitions. [2025-01-09 20:47:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-01-09 20:47:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 108.2258064516129) internal successors, (3355), 31 states have internal predecessors, (3355), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1578 [2025-01-09 20:47:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:47:13,770 INFO L225 Difference]: With dead ends: 8467 [2025-01-09 20:47:13,770 INFO L226 Difference]: Without dead ends: 7250 [2025-01-09 20:47:13,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3208 GetRequests, 3126 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1314, Invalid=4538, Unknown=0, NotChecked=0, Total=5852 [2025-01-09 20:47:13,775 INFO L435 NwaCegarLoop]: 5601 mSDtfsCounter, 16856 mSDsluCounter, 79232 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16938 SdHoareTripleChecker+Valid, 84833 SdHoareTripleChecker+Invalid, 2359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:47:13,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16938 Valid, 84833 Invalid, 2359 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 20:47:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7250 states. [2025-01-09 20:47:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7250 to 7054. [2025-01-09 20:47:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 6957 states have (on average 1.3857984763547506) internal successors, (9641), 6962 states have internal predecessors, (9641), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 20:47:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 9824 transitions. [2025-01-09 20:47:13,898 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 9824 transitions. Word has length 1578 [2025-01-09 20:47:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:47:13,900 INFO L471 AbstractCegarLoop]: Abstraction has 7054 states and 9824 transitions. [2025-01-09 20:47:13,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 108.2258064516129) internal successors, (3355), 31 states have internal predecessors, (3355), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:47:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 9824 transitions. [2025-01-09 20:47:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2503 [2025-01-09 20:47:13,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:47:13,935 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 12, 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-01-09 20:47:13,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 20:47:14,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 20:47:14,136 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:47:14,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:47:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash -628161197, now seen corresponding path program 1 times [2025-01-09 20:47:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:47:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017733032] [2025-01-09 20:47:14,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:47:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:47:14,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2502 statements into 1 equivalence classes. [2025-01-09 20:47:15,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2502 of 2502 statements. [2025-01-09 20:47:15,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:47:15,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat