./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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_FNV_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 3f1ddce0da39afb2e81d3f6974a6168ade2d49435b1ce063903c0017c6d40b05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:41:54,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:41:54,293 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:41:54,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:41:54,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:41:54,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:41:54,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:41:54,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:41:54,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:41:54,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:41:54,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:41:54,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:41:54,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:41:54,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:41:54,311 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:41:54,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:41:54,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:41:54,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:41:54,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:41:54,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:54,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:54,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:41:54,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:41:54,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:41:54,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:41:54,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:41:54,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:41:54,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:41:54,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:41:54,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:41:54,314 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 -> 3f1ddce0da39afb2e81d3f6974a6168ade2d49435b1ce063903c0017c6d40b05 [2025-01-09 20:41:54,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:41:54,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:41:54,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:41:54,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:41:54,471 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:41:54,472 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_FNV_test10-2.i [2025-01-09 20:41:55,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb3fde45/26236caf68ac44c99ecb47834d90800f/FLAG92e810404 [2025-01-09 20:41:55,929 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:41:55,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-2.i [2025-01-09 20:41:55,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb3fde45/26236caf68ac44c99ecb47834d90800f/FLAG92e810404 [2025-01-09 20:41:56,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bb3fde45/26236caf68ac44c99ecb47834d90800f [2025-01-09 20:41:56,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:41:56,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:41:56,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:41:56,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:41:56,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:41:56,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:56,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdd097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56, skipping insertion in model container [2025-01-09 20:41:56,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:56,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:41:56,536 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_FNV_test10-2.i[33022,33035] [2025-01-09 20:41:56,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:41:56,704 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:41:56,734 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_FNV_test10-2.i[33022,33035] [2025-01-09 20:41:56,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:41:56,831 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:41:56,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56 WrapperNode [2025-01-09 20:41:56,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:41:56,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:41:56,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:41:56,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:41:56,836 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:41:56" (1/1) ... [2025-01-09 20:41:56,867 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:41:56" (1/1) ... [2025-01-09 20:41:56,942 INFO L138 Inliner]: procedures = 177, calls = 557, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3464 [2025-01-09 20:41:56,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:41:56,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:41:56,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:41:56,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:41:56,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:56,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:56,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,096 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 106, 420]. 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, 4, 90]. [2025-01-09 20:41:57,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:41:57,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:41:57,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:41:57,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:41:57,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (1/1) ... [2025-01-09 20:41:57,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:57,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:57,271 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:41:57,276 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:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-01-09 20:41:57,291 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:41:57,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:41:57,291 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:41:57,291 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:41:57,291 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:41:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:41:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:41:57,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:41:57,482 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:41:57,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:41:59,363 INFO L? ?]: Removed 806 outVars from TransFormulas that were not future-live. [2025-01-09 20:41:59,363 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:41:59,381 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:41:59,381 INFO L312 CfgBuilder]: Removed 77 assume(true) statements. [2025-01-09 20:41:59,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:41:59 BoogieIcfgContainer [2025-01-09 20:41:59,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:41:59,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:41:59,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:41:59,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:41:59,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:41:56" (1/3) ... [2025-01-09 20:41:59,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f4e69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:41:59, skipping insertion in model container [2025-01-09 20:41:59,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:56" (2/3) ... [2025-01-09 20:41:59,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f4e69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:41:59, skipping insertion in model container [2025-01-09 20:41:59,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:41:59" (3/3) ... [2025-01-09 20:41:59,387 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-2.i [2025-01-09 20:41:59,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:41:59,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test10-2.i that has 6 procedures, 1066 locations, 1 initial locations, 89 loop locations, and 1 error locations. [2025-01-09 20:41:59,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:41:59,446 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;@5e317be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:41:59,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:41:59,451 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:41:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 20:41:59,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:59,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:59,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:59,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash 497311879, now seen corresponding path program 1 times [2025-01-09 20:41:59,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:59,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369719743] [2025-01-09 20:41:59,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:59,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 20:41:59,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 20:41:59,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:59,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:59,570 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:41:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:59,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369719743] [2025-01-09 20:41:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369719743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:41:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657145716] [2025-01-09 20:41:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:59,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:41:59,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:59,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:41:59,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:41:59,594 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:41:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:59,670 INFO L93 Difference]: Finished difference Result 2114 states and 3428 transitions. [2025-01-09 20:41:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:41:59,672 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:41:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:59,681 INFO L225 Difference]: With dead ends: 2114 [2025-01-09 20:41:59,681 INFO L226 Difference]: Without dead ends: 1021 [2025-01-09 20:41:59,684 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:41:59,686 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:41:59,686 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:41:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-01-09 20:41:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2025-01-09 20:41:59,730 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:41:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1506 transitions. [2025-01-09 20:41:59,736 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1506 transitions. Word has length 13 [2025-01-09 20:41:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:59,736 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1506 transitions. [2025-01-09 20:41:59,736 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:41:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1506 transitions. [2025-01-09 20:41:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:41:59,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:59,739 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:41:59,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:41:59,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:59,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1564019447, now seen corresponding path program 1 times [2025-01-09 20:41:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:59,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932124136] [2025-01-09 20:41:59,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:59,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:41:59,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:41:59,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:59,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:00,125 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:42:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:00,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932124136] [2025-01-09 20:42:00,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932124136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:00,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:00,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:42:00,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440985595] [2025-01-09 20:42:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:00,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:42:00,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:00,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:42:00,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:42:00,127 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:42:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:00,269 INFO L93 Difference]: Finished difference Result 2036 states and 3006 transitions. [2025-01-09 20:42:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:42:00,269 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:42:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:00,278 INFO L225 Difference]: With dead ends: 2036 [2025-01-09 20:42:00,278 INFO L226 Difference]: Without dead ends: 1406 [2025-01-09 20:42:00,279 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:42:00,280 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:42:00,280 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:42:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-01-09 20:42:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1023. [2025-01-09 20:42:00,308 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:42:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2025-01-09 20:42:00,312 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 67 [2025-01-09 20:42:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:00,312 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2025-01-09 20:42:00,312 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:42:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2025-01-09 20:42:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 20:42:00,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:00,316 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:42:00,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:42:00,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash 440587507, now seen corresponding path program 1 times [2025-01-09 20:42:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686582116] [2025-01-09 20:42:00,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:00,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 20:42:00,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 20:42:00,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:00,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:00,736 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:42:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:00,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686582116] [2025-01-09 20:42:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686582116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:00,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:00,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:42:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910000240] [2025-01-09 20:42:00,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:00,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:42:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:00,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:42:00,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:42:00,738 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:42:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:00,854 INFO L93 Difference]: Finished difference Result 2425 states and 3570 transitions. [2025-01-09 20:42:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:42:00,854 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:42:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:00,859 INFO L225 Difference]: With dead ends: 2425 [2025-01-09 20:42:00,859 INFO L226 Difference]: Without dead ends: 1406 [2025-01-09 20:42:00,860 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:42:00,860 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:42:00,861 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:42:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-01-09 20:42:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1027. [2025-01-09 20:42:00,876 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:42:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1512 transitions. [2025-01-09 20:42:00,880 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1512 transitions. Word has length 144 [2025-01-09 20:42:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1512 transitions. [2025-01-09 20:42:00,880 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:42:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1512 transitions. [2025-01-09 20:42:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:42:00,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:00,884 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:42:00,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:42:00,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:00,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash 68284982, now seen corresponding path program 1 times [2025-01-09 20:42:00,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:00,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849081172] [2025-01-09 20:42:00,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:00,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:00,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:42:00,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:42:00,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:01,218 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:42:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:01,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849081172] [2025-01-09 20:42:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849081172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:01,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:01,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:42:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077817564] [2025-01-09 20:42:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:01,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:42:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:01,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:42:01,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:42:01,222 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:42:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:01,300 INFO L93 Difference]: Finished difference Result 2004 states and 2950 transitions. [2025-01-09 20:42:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:42:01,300 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:42:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:01,303 INFO L225 Difference]: With dead ends: 2004 [2025-01-09 20:42:01,303 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 20:42:01,305 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:42:01,307 INFO L435 NwaCegarLoop]: 1404 mSDtfsCounter, 33 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:42:01,308 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:42:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 20:42:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-01-09 20:42:01,360 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:42:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1435 transitions. [2025-01-09 20:42:01,364 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1435 transitions. Word has length 214 [2025-01-09 20:42:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:01,365 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1435 transitions. [2025-01-09 20:42:01,365 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:42:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1435 transitions. [2025-01-09 20:42:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:42:01,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:01,367 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:42:01,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:42:01,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:01,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash -756815256, now seen corresponding path program 1 times [2025-01-09 20:42:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:01,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097018631] [2025-01-09 20:42:01,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:01,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:42:01,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:42:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:01,582 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:42:01,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097018631] [2025-01-09 20:42:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097018631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:01,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:42:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275719225] [2025-01-09 20:42:01,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:01,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:42:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:01,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:42:01,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:42:01,585 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:42:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:01,655 INFO L93 Difference]: Finished difference Result 1962 states and 2862 transitions. [2025-01-09 20:42:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:42:01,656 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:42:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:01,660 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 20:42:01,660 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 20:42:01,661 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:42:01,662 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:42:01,662 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:42:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 20:42:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-01-09 20:42:01,676 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:42:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1432 transitions. [2025-01-09 20:42:01,714 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1432 transitions. Word has length 214 [2025-01-09 20:42:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:01,714 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1432 transitions. [2025-01-09 20:42:01,714 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:42:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1432 transitions. [2025-01-09 20:42:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:42:01,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:01,716 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:42:01,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:42:01,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash -932444308, now seen corresponding path program 1 times [2025-01-09 20:42:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939103115] [2025-01-09 20:42:01,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:01,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:42:01,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:42:01,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:01,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:01,927 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:42:01,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:01,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939103115] [2025-01-09 20:42:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939103115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:01,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:01,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:42:01,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187632130] [2025-01-09 20:42:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:01,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:42:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:01,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:42:01,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:42:01,929 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:42:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:02,018 INFO L93 Difference]: Finished difference Result 2489 states and 3632 transitions. [2025-01-09 20:42:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:42:02,019 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:42:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:02,025 INFO L225 Difference]: With dead ends: 2489 [2025-01-09 20:42:02,025 INFO L226 Difference]: Without dead ends: 1512 [2025-01-09 20:42:02,027 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:42:02,027 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 713 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:02,027 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.0s Time] [2025-01-09 20:42:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-01-09 20:42:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1354. [2025-01-09 20:42:02,056 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:42:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1972 transitions. [2025-01-09 20:42:02,062 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1972 transitions. Word has length 214 [2025-01-09 20:42:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:02,062 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1972 transitions. [2025-01-09 20:42:02,062 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:42:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1972 transitions. [2025-01-09 20:42:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:42:02,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:02,065 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:42:02,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:42:02,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:02,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -585199302, now seen corresponding path program 1 times [2025-01-09 20:42:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896667340] [2025-01-09 20:42:02,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:02,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:42:02,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:42:02,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:02,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:02,380 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:42:02,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:02,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896667340] [2025-01-09 20:42:02,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896667340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:02,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:02,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:42:02,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014027895] [2025-01-09 20:42:02,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:02,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:42:02,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:02,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:42:02,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:42:02,382 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:42:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:02,460 INFO L93 Difference]: Finished difference Result 2619 states and 3827 transitions. [2025-01-09 20:42:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:42:02,461 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:42:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:02,466 INFO L225 Difference]: With dead ends: 2619 [2025-01-09 20:42:02,466 INFO L226 Difference]: Without dead ends: 1357 [2025-01-09 20:42:02,468 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:42:02,468 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:42:02,469 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:42:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-01-09 20:42:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1354. [2025-01-09 20:42:02,490 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:42:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1965 transitions. [2025-01-09 20:42:02,494 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1965 transitions. Word has length 229 [2025-01-09 20:42:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:02,495 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1965 transitions. [2025-01-09 20:42:02,495 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:42:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1965 transitions. [2025-01-09 20:42:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:42:02,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:02,497 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:42:02,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:42:02,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:02,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash 788151214, now seen corresponding path program 1 times [2025-01-09 20:42:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460711529] [2025-01-09 20:42:02,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:02,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:02,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:42:02,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:42:02,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:02,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:02,734 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:42:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460711529] [2025-01-09 20:42:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460711529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:02,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:42:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401316450] [2025-01-09 20:42:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:02,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:42:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:02,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:42:02,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:42:02,736 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:42:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:02,795 INFO L93 Difference]: Finished difference Result 2622 states and 3819 transitions. [2025-01-09 20:42:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:42:02,795 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:42:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:02,802 INFO L225 Difference]: With dead ends: 2622 [2025-01-09 20:42:02,802 INFO L226 Difference]: Without dead ends: 1360 [2025-01-09 20:42:02,804 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:42:02,804 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:42:02,805 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:42:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-01-09 20:42:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2025-01-09 20:42:02,832 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:42:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1971 transitions. [2025-01-09 20:42:02,837 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1971 transitions. Word has length 229 [2025-01-09 20:42:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:02,838 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1971 transitions. [2025-01-09 20:42:02,839 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:42:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1971 transitions. [2025-01-09 20:42:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:42:02,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:02,842 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:42:02,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:42:02,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:02,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:02,842 INFO L85 PathProgramCache]: Analyzing trace with hash 316794864, now seen corresponding path program 1 times [2025-01-09 20:42:02,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:02,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67961781] [2025-01-09 20:42:02,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:02,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:02,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:42:02,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:42:02,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:02,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:03,084 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:42:03,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:03,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67961781] [2025-01-09 20:42:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67961781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:03,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:42:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499192386] [2025-01-09 20:42:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:03,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:42:03,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:03,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:42:03,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:42:03,087 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:42:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:03,200 INFO L93 Difference]: Finished difference Result 3243 states and 4728 transitions. [2025-01-09 20:42:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:42:03,200 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:42:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:03,207 INFO L225 Difference]: With dead ends: 3243 [2025-01-09 20:42:03,207 INFO L226 Difference]: Without dead ends: 1975 [2025-01-09 20:42:03,209 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:42:03,209 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 670 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:03,209 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.1s Time] [2025-01-09 20:42:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-01-09 20:42:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1970. [2025-01-09 20:42:03,246 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:42:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2870 transitions. [2025-01-09 20:42:03,252 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2870 transitions. Word has length 229 [2025-01-09 20:42:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:03,252 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2870 transitions. [2025-01-09 20:42:03,252 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:42:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2870 transitions. [2025-01-09 20:42:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-09 20:42:03,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:03,255 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:42:03,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:42:03,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:03,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:03,259 INFO L85 PathProgramCache]: Analyzing trace with hash -206519145, now seen corresponding path program 1 times [2025-01-09 20:42:03,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:03,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483781391] [2025-01-09 20:42:03,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:03,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 20:42:03,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 20:42:03,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:03,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:03,572 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:42:03,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:03,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483781391] [2025-01-09 20:42:03,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483781391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:03,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:03,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:42:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133692264] [2025-01-09 20:42:03,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:03,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:42:03,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:03,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:42:03,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:42:03,575 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:42:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:04,071 INFO L93 Difference]: Finished difference Result 4191 states and 6139 transitions. [2025-01-09 20:42:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:42:04,072 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:42:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:04,082 INFO L225 Difference]: With dead ends: 4191 [2025-01-09 20:42:04,082 INFO L226 Difference]: Without dead ends: 2506 [2025-01-09 20:42:04,084 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:42:04,085 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:42:04,085 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:42:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2025-01-09 20:42:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1544. [2025-01-09 20:42:04,123 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:42:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2228 transitions. [2025-01-09 20:42:04,127 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2228 transitions. Word has length 244 [2025-01-09 20:42:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:04,128 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2228 transitions. [2025-01-09 20:42:04,128 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:42:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2228 transitions. [2025-01-09 20:42:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 20:42:04,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:04,132 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:42:04,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:42:04,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:04,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash 131334278, now seen corresponding path program 1 times [2025-01-09 20:42:04,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:04,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844526897] [2025-01-09 20:42:04,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:04,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:42:04,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:42:04,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:04,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:04,506 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:42:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:04,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844526897] [2025-01-09 20:42:04,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844526897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:04,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:04,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:42:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308590468] [2025-01-09 20:42:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:04,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:42:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:04,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:42:04,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:42:04,509 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:42:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:04,598 INFO L93 Difference]: Finished difference Result 2413 states and 3522 transitions. [2025-01-09 20:42:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:42:04,598 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:42:04,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:04,605 INFO L225 Difference]: With dead ends: 2413 [2025-01-09 20:42:04,605 INFO L226 Difference]: Without dead ends: 1502 [2025-01-09 20:42:04,607 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:42:04,608 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:42:04,608 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:42:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-01-09 20:42:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2025-01-09 20:42:04,648 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:42:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2151 transitions. [2025-01-09 20:42:04,653 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2151 transitions. Word has length 254 [2025-01-09 20:42:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:04,654 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2151 transitions. [2025-01-09 20:42:04,654 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:42:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2151 transitions. [2025-01-09 20:42:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 20:42:04,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:04,657 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:42:04,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:42:04,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:04,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1613739386, now seen corresponding path program 1 times [2025-01-09 20:42:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:04,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738962191] [2025-01-09 20:42:04,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:04,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:42:04,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:42:04,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:04,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:05,420 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:42:05,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:05,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738962191] [2025-01-09 20:42:05,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738962191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:42:05,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15571153] [2025-01-09 20:42:05,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:05,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:42:05,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:42:05,422 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:42:05,426 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:42:05,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:42:05,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:42:05,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:05,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:05,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 20:42:05,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:42:06,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:06,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:42:06,308 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:42:06,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:42:06,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15571153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:06,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:42:06,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-01-09 20:42:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634136046] [2025-01-09 20:42:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:06,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:42:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:06,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:42:06,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:42:06,313 INFO L87 Difference]: Start difference. First operand 1502 states and 2151 transitions. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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:42:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:06,670 INFO L93 Difference]: Finished difference Result 2795 states and 4026 transitions. [2025-01-09 20:42:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:42:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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:42:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:06,677 INFO L225 Difference]: With dead ends: 2795 [2025-01-09 20:42:06,677 INFO L226 Difference]: Without dead ends: 1922 [2025-01-09 20:42:06,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 20:42:06,678 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 1419 mSDsluCounter, 4244 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 5515 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:06,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 5515 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:42:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-01-09 20:42:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1720. [2025-01-09 20:42:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1689 states have (on average 1.4262877442273534) internal successors, (2409), 1698 states have internal predecessors, (2409), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 20:42:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2456 transitions. [2025-01-09 20:42:06,716 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2456 transitions. Word has length 254 [2025-01-09 20:42:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2456 transitions. [2025-01-09 20:42:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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:42:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2456 transitions. [2025-01-09 20:42:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-01-09 20:42:06,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:06,720 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 20:42:06,731 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:42:06,924 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:42:06,925 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:06,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1228992190, now seen corresponding path program 1 times [2025-01-09 20:42:06,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:06,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026834658] [2025-01-09 20:42:06,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:06,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:07,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-01-09 20:42:07,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-01-09 20:42:07,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:07,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:42:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026834658] [2025-01-09 20:42:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026834658] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:42:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271347492] [2025-01-09 20:42:07,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:07,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:42:07,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:42:07,888 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:42:07,889 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:42:08,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-01-09 20:42:08,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-01-09 20:42:08,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:08,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:08,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 20:42:08,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:42:08,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 20:42:08,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:08,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:42:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:42:08,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:42:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:42:09,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271347492] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:42:09,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:42:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-01-09 20:42:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242589678] [2025-01-09 20:42:09,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:42:09,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 20:42:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:09,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 20:42:09,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:42:09,130 INFO L87 Difference]: Start difference. First operand 1720 states and 2456 transitions. Second operand has 12 states, 12 states have (on average 40.333333333333336) internal successors, (484), 12 states have internal predecessors, (484), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:42:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:09,501 INFO L93 Difference]: Finished difference Result 4241 states and 6007 transitions. [2025-01-09 20:42:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 20:42:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 40.333333333333336) internal successors, (484), 12 states have internal predecessors, (484), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 331 [2025-01-09 20:42:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:09,510 INFO L225 Difference]: With dead ends: 4241 [2025-01-09 20:42:09,510 INFO L226 Difference]: Without dead ends: 2806 [2025-01-09 20:42:09,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 651 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-01-09 20:42:09,513 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 2595 mSDsluCounter, 8401 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 9700 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:09,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2613 Valid, 9700 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:42:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2025-01-09 20:42:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2472. [2025-01-09 20:42:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2429 states have (on average 1.4042815973651708) internal successors, (3411), 2438 states have internal predecessors, (3411), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 20:42:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3480 transitions. [2025-01-09 20:42:09,577 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3480 transitions. Word has length 331 [2025-01-09 20:42:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:09,577 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 3480 transitions. [2025-01-09 20:42:09,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 40.333333333333336) internal successors, (484), 12 states have internal predecessors, (484), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:42:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3480 transitions. [2025-01-09 20:42:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2025-01-09 20:42:09,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:09,590 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:09,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 20:42:09,794 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:42:09,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:09,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1568752703, now seen corresponding path program 1 times [2025-01-09 20:42:09,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945816298] [2025-01-09 20:42:09,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:09,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 772 statements into 1 equivalence classes. [2025-01-09 20:42:10,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 772 of 772 statements. [2025-01-09 20:42:10,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:10,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 292 proven. 894 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:42:13,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:13,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945816298] [2025-01-09 20:42:13,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945816298] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:42:13,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762890380] [2025-01-09 20:42:13,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:13,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:42:13,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:42:13,771 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:42:13,776 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:42:14,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 772 statements into 1 equivalence classes. [2025-01-09 20:42:14,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 772 of 772 statements. [2025-01-09 20:42:14,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:14,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:14,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 3764 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 20:42:14,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:42:14,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 20:42:15,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:15,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:15,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:15,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:15,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:42:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 292 proven. 894 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:42:15,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:42:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 292 proven. 894 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:42:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762890380] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:42:16,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:42:16,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-01-09 20:42:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234221360] [2025-01-09 20:42:16,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:42:16,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 20:42:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:16,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 20:42:16,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-01-09 20:42:16,168 INFO L87 Difference]: Start difference. First operand 2472 states and 3480 transitions. Second operand has 21 states, 21 states have (on average 65.33333333333333) internal successors, (1372), 21 states have internal predecessors, (1372), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:42:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:16,716 INFO L93 Difference]: Finished difference Result 6281 states and 8806 transitions. [2025-01-09 20:42:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 20:42:16,718 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 65.33333333333333) internal successors, (1372), 21 states have internal predecessors, (1372), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 772 [2025-01-09 20:42:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:16,731 INFO L225 Difference]: With dead ends: 6281 [2025-01-09 20:42:16,731 INFO L226 Difference]: Without dead ends: 4846 [2025-01-09 20:42:16,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1566 GetRequests, 1530 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-01-09 20:42:16,734 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 7978 mSDsluCounter, 10609 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8020 SdHoareTripleChecker+Valid, 11908 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:16,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8020 Valid, 11908 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:42:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4846 states. [2025-01-09 20:42:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4846 to 4512. [2025-01-09 20:42:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 4445 states have (on average 1.385601799775028) internal successors, (6159), 4454 states have internal predecessors, (6159), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 20:42:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 6276 transitions. [2025-01-09 20:42:16,805 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 6276 transitions. Word has length 772 [2025-01-09 20:42:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:16,806 INFO L471 AbstractCegarLoop]: Abstraction has 4512 states and 6276 transitions. [2025-01-09 20:42:16,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 65.33333333333333) internal successors, (1372), 21 states have internal predecessors, (1372), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:42:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 6276 transitions. [2025-01-09 20:42:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1655 [2025-01-09 20:42:16,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:16,905 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:16,921 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:42:17,105 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:42:17,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:17,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1672974945, now seen corresponding path program 2 times [2025-01-09 20:42:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:17,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741051962] [2025-01-09 20:42:17,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:42:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:17,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1654 statements into 2 equivalence classes. [2025-01-09 20:42:17,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 1654 statements. [2025-01-09 20:42:17,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:42:17,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7393 trivial. 0 not checked. [2025-01-09 20:42:17,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741051962] [2025-01-09 20:42:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741051962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:17,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:42:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439519373] [2025-01-09 20:42:17,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:17,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:42:17,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:17,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:42:17,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:42:17,926 INFO L87 Difference]: Start difference. First operand 4512 states and 6276 transitions. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:42:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:18,340 INFO L93 Difference]: Finished difference Result 5374 states and 7555 transitions. [2025-01-09 20:42:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:42:18,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1654 [2025-01-09 20:42:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:18,354 INFO L225 Difference]: With dead ends: 5374 [2025-01-09 20:42:18,354 INFO L226 Difference]: Without dead ends: 4523 [2025-01-09 20:42:18,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:42:18,358 INFO L435 NwaCegarLoop]: 1323 mSDtfsCounter, 21 mSDsluCounter, 4986 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6309 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:18,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6309 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:42:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2025-01-09 20:42:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 4516. [2025-01-09 20:42:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4516 states, 4449 states have (on average 1.3852551135086537) internal successors, (6163), 4458 states have internal predecessors, (6163), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 20:42:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 6280 transitions. [2025-01-09 20:42:18,431 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 6280 transitions. Word has length 1654 [2025-01-09 20:42:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:18,432 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 6280 transitions. [2025-01-09 20:42:18,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:42:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 6280 transitions. [2025-01-09 20:42:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1656 [2025-01-09 20:42:18,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:18,448 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:18,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:42:18,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:18,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1109560597, now seen corresponding path program 1 times [2025-01-09 20:42:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46458109] [2025-01-09 20:42:18,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:18,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1655 statements into 1 equivalence classes. [2025-01-09 20:42:19,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1655 of 1655 statements. [2025-01-09 20:42:19,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:19,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7393 trivial. 0 not checked. [2025-01-09 20:42:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:22,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46458109] [2025-01-09 20:42:22,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46458109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:22,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:22,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:42:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099065982] [2025-01-09 20:42:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:22,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:42:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:22,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:42:22,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:42:22,313 INFO L87 Difference]: Start difference. First operand 4516 states and 6280 transitions. Second operand has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 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:42:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:22,735 INFO L93 Difference]: Finished difference Result 5372 states and 7549 transitions. [2025-01-09 20:42:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:42:22,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 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 1655 [2025-01-09 20:42:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:22,747 INFO L225 Difference]: With dead ends: 5372 [2025-01-09 20:42:22,747 INFO L226 Difference]: Without dead ends: 4531 [2025-01-09 20:42:22,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:42:22,750 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 25 mSDsluCounter, 6256 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7572 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:22,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7572 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:42:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2025-01-09 20:42:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4520. [2025-01-09 20:42:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4520 states, 4453 states have (on average 1.3851336177857625) internal successors, (6168), 4462 states have internal predecessors, (6168), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 20:42:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 6285 transitions. [2025-01-09 20:42:22,855 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 6285 transitions. Word has length 1655 [2025-01-09 20:42:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:22,857 INFO L471 AbstractCegarLoop]: Abstraction has 4520 states and 6285 transitions. [2025-01-09 20:42:22,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 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:42:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 6285 transitions. [2025-01-09 20:42:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1657 [2025-01-09 20:42:22,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:22,883 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:22,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:42:22,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:22,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:22,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2081994163, now seen corresponding path program 1 times [2025-01-09 20:42:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664713167] [2025-01-09 20:42:22,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:23,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1656 statements into 1 equivalence classes. [2025-01-09 20:42:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1656 of 1656 statements. [2025-01-09 20:42:23,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:23,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7393 trivial. 0 not checked. [2025-01-09 20:42:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664713167] [2025-01-09 20:42:26,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664713167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:26,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:42:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182003004] [2025-01-09 20:42:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:26,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:42:26,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:26,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:42:26,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:42:26,702 INFO L87 Difference]: Start difference. First operand 4520 states and 6285 transitions. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:42:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:27,102 INFO L93 Difference]: Finished difference Result 5377 states and 7557 transitions. [2025-01-09 20:42:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:42:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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 1656 [2025-01-09 20:42:27,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:27,110 INFO L225 Difference]: With dead ends: 5377 [2025-01-09 20:42:27,110 INFO L226 Difference]: Without dead ends: 4531 [2025-01-09 20:42:27,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:42:27,112 INFO L435 NwaCegarLoop]: 1319 mSDtfsCounter, 31 mSDsluCounter, 8806 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10125 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:27,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10125 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:42:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2025-01-09 20:42:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4528. [2025-01-09 20:42:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4528 states, 4461 states have (on average 1.3848912799820667) internal successors, (6178), 4470 states have internal predecessors, (6178), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 20:42:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4528 states to 4528 states and 6295 transitions. [2025-01-09 20:42:27,167 INFO L78 Accepts]: Start accepts. Automaton has 4528 states and 6295 transitions. Word has length 1656 [2025-01-09 20:42:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:27,169 INFO L471 AbstractCegarLoop]: Abstraction has 4528 states and 6295 transitions. [2025-01-09 20:42:27,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:42:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4528 states and 6295 transitions. [2025-01-09 20:42:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1657 [2025-01-09 20:42:27,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:27,184 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:27,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:42:27,185 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:27,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 780396518, now seen corresponding path program 1 times [2025-01-09 20:42:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:27,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502323442] [2025-01-09 20:42:27,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:27,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1656 statements into 1 equivalence classes. [2025-01-09 20:42:27,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1656 of 1656 statements. [2025-01-09 20:42:27,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:27,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7393 trivial. 0 not checked. [2025-01-09 20:42:30,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:30,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502323442] [2025-01-09 20:42:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502323442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:42:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146211741] [2025-01-09 20:42:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:30,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:42:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:30,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:42:30,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:42:30,512 INFO L87 Difference]: Start difference. First operand 4528 states and 6295 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 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:42:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:30,814 INFO L93 Difference]: Finished difference Result 5385 states and 7566 transitions. [2025-01-09 20:42:30,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:42:30,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 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 1656 [2025-01-09 20:42:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:30,825 INFO L225 Difference]: With dead ends: 5385 [2025-01-09 20:42:30,825 INFO L226 Difference]: Without dead ends: 4537 [2025-01-09 20:42:30,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:42:30,827 INFO L435 NwaCegarLoop]: 1327 mSDtfsCounter, 15 mSDsluCounter, 4997 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6324 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:30,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6324 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:42:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2025-01-09 20:42:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4531. [2025-01-09 20:42:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 4464 states have (on average 1.3846326164874552) internal successors, (6181), 4473 states have internal predecessors, (6181), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 20:42:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6298 transitions. [2025-01-09 20:42:30,881 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6298 transitions. Word has length 1656 [2025-01-09 20:42:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:30,882 INFO L471 AbstractCegarLoop]: Abstraction has 4531 states and 6298 transitions. [2025-01-09 20:42:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 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:42:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6298 transitions. [2025-01-09 20:42:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1658 [2025-01-09 20:42:30,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:30,897 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:30,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:42:30,897 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:30,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash 425167736, now seen corresponding path program 1 times [2025-01-09 20:42:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306002018] [2025-01-09 20:42:30,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1657 statements into 1 equivalence classes. [2025-01-09 20:42:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1657 of 1657 statements. [2025-01-09 20:42:31,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:31,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7393 backedges. 1998 proven. 75 refuted. 0 times theorem prover too weak. 5320 trivial. 0 not checked. [2025-01-09 20:42:36,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:36,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306002018] [2025-01-09 20:42:36,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306002018] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:42:36,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948169089] [2025-01-09 20:42:36,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:36,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:42:36,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:42:36,221 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:42:36,222 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:42:37,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1657 statements into 1 equivalence classes. [2025-01-09 20:42:38,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1657 of 1657 statements. [2025-01-09 20:42:38,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:38,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:38,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 8006 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 20:42:38,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:42:38,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 20:42:38,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:38,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:38,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:42:39,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:42:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7393 backedges. 0 proven. 7369 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:42:39,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:42:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7393 backedges. 0 proven. 7369 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:42:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948169089] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:42:41,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:42:41,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 32 [2025-01-09 20:42:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481769186] [2025-01-09 20:42:41,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:42:41,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 20:42:41,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:41,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 20:42:41,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=636, Unknown=0, NotChecked=0, Total=992 [2025-01-09 20:42:41,565 INFO L87 Difference]: Start difference. First operand 4531 states and 6298 transitions. Second operand has 32 states, 32 states have (on average 105.34375) internal successors, (3371), 32 states have internal predecessors, (3371), 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:42:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:43,398 INFO L93 Difference]: Finished difference Result 8065 states and 11322 transitions. [2025-01-09 20:42:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-01-09 20:42:43,399 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 105.34375) internal successors, (3371), 32 states have internal predecessors, (3371), 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 1657 [2025-01-09 20:42:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:43,414 INFO L225 Difference]: With dead ends: 8065 [2025-01-09 20:42:43,414 INFO L226 Difference]: Without dead ends: 7157 [2025-01-09 20:42:43,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3369 GetRequests, 3285 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 20:42:43,418 INFO L435 NwaCegarLoop]: 1268 mSDtfsCounter, 17272 mSDsluCounter, 15319 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17353 SdHoareTripleChecker+Valid, 16587 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:43,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17353 Valid, 16587 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:42:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7157 states. [2025-01-09 20:42:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7157 to 7157. [2025-01-09 20:42:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7157 states, 7051 states have (on average 1.3873209473833499) internal successors, (9782), 7060 states have internal predecessors, (9782), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 20:42:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7157 states to 7157 states and 9977 transitions. [2025-01-09 20:42:43,512 INFO L78 Accepts]: Start accepts. Automaton has 7157 states and 9977 transitions. Word has length 1657 [2025-01-09 20:42:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:43,513 INFO L471 AbstractCegarLoop]: Abstraction has 7157 states and 9977 transitions. [2025-01-09 20:42:43,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 105.34375) internal successors, (3371), 32 states have internal predecessors, (3371), 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:42:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7157 states and 9977 transitions. [2025-01-09 20:42:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2659 [2025-01-09 20:42:43,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:43,550 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:43,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 20:42:43,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:42:43,751 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1922466658, now seen corresponding path program 2 times [2025-01-09 20:42:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366241227] [2025-01-09 20:42:43,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:42:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:44,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2658 statements into 2 equivalence classes. [2025-01-09 20:42:44,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 2658 statements. [2025-01-09 20:42:44,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:42:44,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24410 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24410 trivial. 0 not checked. [2025-01-09 20:42:44,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:44,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366241227] [2025-01-09 20:42:44,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366241227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:44,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:42:44,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:42:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346239983] [2025-01-09 20:42:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:44,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:42:44,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:44,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:42:44,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:42:44,457 INFO L87 Difference]: Start difference. First operand 7157 states and 9977 transitions. Second operand has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 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:42:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:44,920 INFO L93 Difference]: Finished difference Result 8024 states and 11258 transitions. [2025-01-09 20:42:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:42:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 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 2658 [2025-01-09 20:42:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:44,934 INFO L225 Difference]: With dead ends: 8024 [2025-01-09 20:42:44,934 INFO L226 Difference]: Without dead ends: 7169 [2025-01-09 20:42:44,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:42:44,936 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 411 mSDsluCounter, 6954 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 8265 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:44,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 8265 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:42:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2025-01-09 20:42:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7164. [2025-01-09 20:42:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7164 states, 7058 states have (on average 1.3869368092944176) internal successors, (9789), 7067 states have internal predecessors, (9789), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 20:42:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7164 states to 7164 states and 9984 transitions. [2025-01-09 20:42:45,030 INFO L78 Accepts]: Start accepts. Automaton has 7164 states and 9984 transitions. Word has length 2658 [2025-01-09 20:42:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:45,031 INFO L471 AbstractCegarLoop]: Abstraction has 7164 states and 9984 transitions. [2025-01-09 20:42:45,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 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:42:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7164 states and 9984 transitions. [2025-01-09 20:42:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2659 [2025-01-09 20:42:45,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:45,064 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:45,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:42:45,065 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:45,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash 518536630, now seen corresponding path program 1 times [2025-01-09 20:42:45,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:45,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843877990] [2025-01-09 20:42:45,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:45,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2658 statements into 1 equivalence classes. [2025-01-09 20:42:46,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2658 of 2658 statements. [2025-01-09 20:42:46,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:46,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat