./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_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-?-48c9605-m [2025-02-08 04:49:48,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:49:49,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:49:49,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:49:49,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:49:49,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:49:49,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:49:49,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:49:49,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:49:49,059 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:49:49,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:49:49,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:49:49,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:49:49,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:49:49,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:49:49,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:49:49,062 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:49:49,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:49:49,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:49:49,062 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:49:49,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:49:49,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:49:49,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:49:49,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:49:49,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:49:49,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:49:49,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:49:49,063 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-02-08 04:49:49,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:49:49,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:49:49,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:49:49,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:49:49,266 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:49:49,267 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-02-08 04:49:50,340 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c44bc65b/445d573d5ca44ce7ac438d0c81cb01b7/FLAGfc711a27d [2025-02-08 04:49:50,670 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:49:50,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-2.i [2025-02-08 04:49:50,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c44bc65b/445d573d5ca44ce7ac438d0c81cb01b7/FLAGfc711a27d [2025-02-08 04:49:50,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c44bc65b/445d573d5ca44ce7ac438d0c81cb01b7 [2025-02-08 04:49:50,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:49:50,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:49:50,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:49:50,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:49:50,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:49:50,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:49:50" (1/1) ... [2025-02-08 04:49:50,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e0c5ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:50, skipping insertion in model container [2025-02-08 04:49:50,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:49:50" (1/1) ... [2025-02-08 04:49:50,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:49:51,223 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-02-08 04:49:51,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:49:51,376 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:49:51,406 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-02-08 04:49:51,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:49:51,522 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:49:51,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51 WrapperNode [2025-02-08 04:49:51,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:49:51,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:49:51,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:49:51,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:49:51,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,629 INFO L138 Inliner]: procedures = 177, calls = 557, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3464 [2025-02-08 04:49:51,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:49:51,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:49:51,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:49:51,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:49:51,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,773 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 420, 106]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 90, 4]. [2025-02-08 04:49:51,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:49:51,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:49:51,849 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:49:51,849 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:49:51,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (1/1) ... [2025-02-08 04:49:51,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:49:51,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:51,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 04:49:51,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-08 04:49:51,896 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:49:51,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:49:51,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:49:51,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:49:51,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:49:51,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:49:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:49:51,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:49:52,135 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:49:52,137 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:49:55,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 04:49:55,383 INFO L? ?]: Removed 805 outVars from TransFormulas that were not future-live. [2025-02-08 04:49:55,384 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:49:55,490 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:49:55,490 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 04:49:55,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:49:55 BoogieIcfgContainer [2025-02-08 04:49:55,491 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:49:55,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:49:55,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:49:55,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:49:55,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:49:50" (1/3) ... [2025-02-08 04:49:55,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1294f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:49:55, skipping insertion in model container [2025-02-08 04:49:55,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:51" (2/3) ... [2025-02-08 04:49:55,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1294f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:49:55, skipping insertion in model container [2025-02-08 04:49:55,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:49:55" (3/3) ... [2025-02-08 04:49:55,497 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-2.i [2025-02-08 04:49:55,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:49:55,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test10-2.i that has 6 procedures, 1062 locations, 1 initial locations, 89 loop locations, and 1 error locations. [2025-02-08 04:49:55,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:49:55,579 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;@bd16289, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:49:55,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 04:49:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 1054 states, 1034 states have (on average 1.622823984526112) internal successors, (1678), 1039 states have internal predecessors, (1678), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 04:49:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 04:49:55,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:55,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:55,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:55,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:55,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2119212172, now seen corresponding path program 1 times [2025-02-08 04:49:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488403899] [2025-02-08 04:49:55,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:55,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 04:49:55,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 04:49:55,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:55,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:55,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488403899] [2025-02-08 04:49:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488403899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:55,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:55,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:49:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138896577] [2025-02-08 04:49:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:55,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:49:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:55,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:49:55,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:49:55,735 INFO L87 Difference]: Start difference. First operand has 1054 states, 1034 states have (on average 1.622823984526112) internal successors, (1678), 1039 states have internal predecessors, (1678), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:55,942 INFO L93 Difference]: Finished difference Result 2107 states and 3415 transitions. [2025-02-08 04:49:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:49:55,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 04:49:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:55,957 INFO L225 Difference]: With dead ends: 2107 [2025-02-08 04:49:55,958 INFO L226 Difference]: Without dead ends: 1014 [2025-02-08 04:49:55,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:49:55,967 INFO L435 NwaCegarLoop]: 1430 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:55,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1430 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:49:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-02-08 04:49:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1014. [2025-02-08 04:49:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 997 states have (on average 1.4764292878635907) internal successors, (1472), 1001 states have internal predecessors, (1472), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:49:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1495 transitions. [2025-02-08 04:49:56,052 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1495 transitions. Word has length 12 [2025-02-08 04:49:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:56,052 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1495 transitions. [2025-02-08 04:49:56,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1495 transitions. [2025-02-08 04:49:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 04:49:56,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:56,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:56,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:49:56,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:56,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash -649187653, now seen corresponding path program 1 times [2025-02-08 04:49:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627490141] [2025-02-08 04:49:56,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:56,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 04:49:56,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 04:49:56,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:56,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627490141] [2025-02-08 04:49:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627490141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:56,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:56,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:49:56,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287295863] [2025-02-08 04:49:56,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:56,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:56,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:56,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:56,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:49:56,469 INFO L87 Difference]: Start difference. First operand 1014 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:56,902 INFO L93 Difference]: Finished difference Result 2023 states and 2985 transitions. [2025-02-08 04:49:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:49:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-08 04:49:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:56,912 INFO L225 Difference]: With dead ends: 2023 [2025-02-08 04:49:56,912 INFO L226 Difference]: Without dead ends: 1396 [2025-02-08 04:49:56,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:56,914 INFO L435 NwaCegarLoop]: 1449 mSDtfsCounter, 544 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4203 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:56,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4203 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:49:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-02-08 04:49:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1016. [2025-02-08 04:49:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 999 states have (on average 1.4754754754754755) internal successors, (1474), 1003 states have internal predecessors, (1474), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:49:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1497 transitions. [2025-02-08 04:49:56,942 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1497 transitions. Word has length 66 [2025-02-08 04:49:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1497 transitions. [2025-02-08 04:49:56,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1497 transitions. [2025-02-08 04:49:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-08 04:49:56,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:56,948 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:56,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:49:56,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:56,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash 296797821, now seen corresponding path program 1 times [2025-02-08 04:49:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777957005] [2025-02-08 04:49:56,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:57,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 04:49:57,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 04:49:57,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:57,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777957005] [2025-02-08 04:49:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777957005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:57,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:49:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413795919] [2025-02-08 04:49:57,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:57,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:57,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:57,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:49:57,439 INFO L87 Difference]: Start difference. First operand 1016 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:57,820 INFO L93 Difference]: Finished difference Result 2409 states and 3546 transitions. [2025-02-08 04:49:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:49:57,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-02-08 04:49:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:57,825 INFO L225 Difference]: With dead ends: 2409 [2025-02-08 04:49:57,826 INFO L226 Difference]: Without dead ends: 1396 [2025-02-08 04:49:57,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:57,832 INFO L435 NwaCegarLoop]: 1449 mSDtfsCounter, 540 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 4203 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:57,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 4203 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:49:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-02-08 04:49:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1019. [2025-02-08 04:49:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1002 states have (on average 1.4740518962075848) internal successors, (1477), 1006 states have internal predecessors, (1477), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:49:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1500 transitions. [2025-02-08 04:49:57,889 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1500 transitions. Word has length 142 [2025-02-08 04:49:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:57,889 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1500 transitions. [2025-02-08 04:49:57,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1500 transitions. [2025-02-08 04:49:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 04:49:57,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:57,891 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:57,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:49:57,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:57,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1283920306, now seen corresponding path program 1 times [2025-02-08 04:49:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078315021] [2025-02-08 04:49:57,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:57,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 04:49:57,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 04:49:57,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:57,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078315021] [2025-02-08 04:49:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078315021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:58,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:49:58,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913199770] [2025-02-08 04:49:58,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:58,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:58,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:58,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:49:58,236 INFO L87 Difference]: Start difference. First operand 1019 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:58,514 INFO L93 Difference]: Finished difference Result 1990 states and 2928 transitions. [2025-02-08 04:49:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:49:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-02-08 04:49:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:58,518 INFO L225 Difference]: With dead ends: 1990 [2025-02-08 04:49:58,518 INFO L226 Difference]: Without dead ends: 977 [2025-02-08 04:49:58,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:58,521 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 30 mSDsluCounter, 2547 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:58,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3830 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-08 04:49:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-02-08 04:49:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 960 states have (on average 1.4583333333333333) internal successors, (1400), 964 states have internal predecessors, (1400), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:49:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1423 transitions. [2025-02-08 04:49:58,583 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1423 transitions. Word has length 212 [2025-02-08 04:49:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:58,585 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1423 transitions. [2025-02-08 04:49:58,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1423 transitions. [2025-02-08 04:49:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 04:49:58,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:58,587 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:58,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:49:58,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1702145784, now seen corresponding path program 1 times [2025-02-08 04:49:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:58,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193850363] [2025-02-08 04:49:58,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:58,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 04:49:58,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 04:49:58,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:58,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193850363] [2025-02-08 04:49:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193850363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:49:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846712755] [2025-02-08 04:49:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:58,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:49:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:58,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:49:58,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:49:58,798 INFO L87 Difference]: Start difference. First operand 977 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:59,078 INFO L93 Difference]: Finished difference Result 2475 states and 3619 transitions. [2025-02-08 04:49:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:49:59,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-02-08 04:49:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:59,086 INFO L225 Difference]: With dead ends: 2475 [2025-02-08 04:49:59,087 INFO L226 Difference]: Without dead ends: 1504 [2025-02-08 04:49:59,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:49:59,090 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 713 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:59,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2580 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-02-08 04:49:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1346. [2025-02-08 04:49:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1327 states have (on average 1.4611906556141674) internal successors, (1939), 1331 states have internal predecessors, (1939), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 04:49:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1966 transitions. [2025-02-08 04:49:59,130 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1966 transitions. Word has length 212 [2025-02-08 04:49:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:59,132 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1966 transitions. [2025-02-08 04:49:59,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1966 transitions. [2025-02-08 04:49:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-08 04:49:59,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:59,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:59,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:49:59,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:59,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash 898695983, now seen corresponding path program 1 times [2025-02-08 04:49:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023800786] [2025-02-08 04:49:59,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:59,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:59,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 04:49:59,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 04:49:59,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:59,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023800786] [2025-02-08 04:49:59,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023800786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:59,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:59,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:49:59,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759023518] [2025-02-08 04:49:59,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:59,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:59,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:59,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:59,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:49:59,495 INFO L87 Difference]: Start difference. First operand 1346 states and 1966 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:59,743 INFO L93 Difference]: Finished difference Result 2560 states and 3745 transitions. [2025-02-08 04:49:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:49:59,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227 [2025-02-08 04:49:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:59,749 INFO L225 Difference]: With dead ends: 2560 [2025-02-08 04:49:59,749 INFO L226 Difference]: Without dead ends: 1304 [2025-02-08 04:49:59,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:59,751 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 30 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:59,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3608 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-02-08 04:49:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-02-08 04:49:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1285 states have (on average 1.4490272373540856) internal successors, (1862), 1289 states have internal predecessors, (1862), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 04:49:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1889 transitions. [2025-02-08 04:49:59,779 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1889 transitions. Word has length 227 [2025-02-08 04:49:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:59,780 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1889 transitions. [2025-02-08 04:49:59,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1889 transitions. [2025-02-08 04:49:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-08 04:49:59,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:59,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:59,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:49:59,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2137780457, now seen corresponding path program 1 times [2025-02-08 04:49:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:59,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965539323] [2025-02-08 04:49:59,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:59,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 04:49:59,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 04:49:59,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:59,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:50:00,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965539323] [2025-02-08 04:50:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965539323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:00,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:50:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295430828] [2025-02-08 04:50:00,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:00,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:50:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:00,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:50:00,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:50:00,082 INFO L87 Difference]: Start difference. First operand 1304 states and 1889 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:00,328 INFO L93 Difference]: Finished difference Result 3084 states and 4486 transitions. [2025-02-08 04:50:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:50:00,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227 [2025-02-08 04:50:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:00,336 INFO L225 Difference]: With dead ends: 3084 [2025-02-08 04:50:00,336 INFO L226 Difference]: Without dead ends: 1870 [2025-02-08 04:50:00,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:50:00,338 INFO L435 NwaCegarLoop]: 1430 mSDtfsCounter, 593 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:00,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 2637 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:50:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2025-02-08 04:50:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1865. [2025-02-08 04:50:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1840 states have (on average 1.4521739130434783) internal successors, (2672), 1844 states have internal predecessors, (2672), 22 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 04:50:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2711 transitions. [2025-02-08 04:50:00,380 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2711 transitions. Word has length 227 [2025-02-08 04:50:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:00,380 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2711 transitions. [2025-02-08 04:50:00,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2711 transitions. [2025-02-08 04:50:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-08 04:50:00,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:00,382 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:00,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 04:50:00,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:00,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1839097156, now seen corresponding path program 1 times [2025-02-08 04:50:00,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:00,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742377825] [2025-02-08 04:50:00,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:00,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-08 04:50:00,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-08 04:50:00,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:00,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742377825] [2025-02-08 04:50:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742377825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:50:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11512672] [2025-02-08 04:50:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:00,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:50:00,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:00,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:50:00,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:50:00,696 INFO L87 Difference]: Start difference. First operand 1865 states and 2711 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:50:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:01,200 INFO L93 Difference]: Finished difference Result 3070 states and 4468 transitions. [2025-02-08 04:50:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:50:01,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 242 [2025-02-08 04:50:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:01,207 INFO L225 Difference]: With dead ends: 3070 [2025-02-08 04:50:01,207 INFO L226 Difference]: Without dead ends: 1439 [2025-02-08 04:50:01,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:50:01,210 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 2357 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:01,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 1422 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:50:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-02-08 04:50:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2025-02-08 04:50:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1419 states have (on average 1.437632135306554) internal successors, (2040), 1423 states have internal predecessors, (2040), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:50:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2069 transitions. [2025-02-08 04:50:01,241 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2069 transitions. Word has length 242 [2025-02-08 04:50:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:01,242 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2069 transitions. [2025-02-08 04:50:01,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:50:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2069 transitions. [2025-02-08 04:50:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-08 04:50:01,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:01,244 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:01,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 04:50:01,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:01,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1181886358, now seen corresponding path program 1 times [2025-02-08 04:50:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812358168] [2025-02-08 04:50:01,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:01,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:50:01,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:50:01,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:01,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 04:50:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:01,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812358168] [2025-02-08 04:50:01,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812358168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:01,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:01,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:50:01,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873473588] [2025-02-08 04:50:01,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:01,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:50:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:01,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:50:01,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:50:01,566 INFO L87 Difference]: Start difference. First operand 1439 states and 2069 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:01,781 INFO L93 Difference]: Finished difference Result 2305 states and 3356 transitions. [2025-02-08 04:50:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:50:01,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 252 [2025-02-08 04:50:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:01,787 INFO L225 Difference]: With dead ends: 2305 [2025-02-08 04:50:01,787 INFO L226 Difference]: Without dead ends: 1397 [2025-02-08 04:50:01,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:50:01,789 INFO L435 NwaCegarLoop]: 1133 mSDtfsCounter, 30 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:01,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3380 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:50:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2025-02-08 04:50:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1397. [2025-02-08 04:50:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1377 states have (on average 1.4255628177196804) internal successors, (1963), 1381 states have internal predecessors, (1963), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:50:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1992 transitions. [2025-02-08 04:50:01,817 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1992 transitions. Word has length 252 [2025-02-08 04:50:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:01,818 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 1992 transitions. [2025-02-08 04:50:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1992 transitions. [2025-02-08 04:50:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-08 04:50:01,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:01,820 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:01,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 04:50:01,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:01,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash -204057361, now seen corresponding path program 1 times [2025-02-08 04:50:01,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:01,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33034605] [2025-02-08 04:50:01,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:50:01,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:50:01,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:01,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:02,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33034605] [2025-02-08 04:50:02,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33034605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:50:02,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051827046] [2025-02-08 04:50:02,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:02,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:02,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:50:02,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:50:02,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 04:50:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:50:03,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:50:03,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:03,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:03,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 04:50:03,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:50:03,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:03,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:50:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:03,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:50:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051827046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:50:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-02-08 04:50:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133915568] [2025-02-08 04:50:03,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:03,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:50:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:03,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:50:03,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-08 04:50:03,577 INFO L87 Difference]: Start difference. First operand 1397 states and 1992 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:07,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 04:50:09,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 04:50:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:09,713 INFO L93 Difference]: Finished difference Result 2585 states and 3698 transitions. [2025-02-08 04:50:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:50:09,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 252 [2025-02-08 04:50:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:09,721 INFO L225 Difference]: With dead ends: 2585 [2025-02-08 04:50:09,721 INFO L226 Difference]: Without dead ends: 1715 [2025-02-08 04:50:09,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 241 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-08 04:50:09,723 INFO L435 NwaCegarLoop]: 1091 mSDtfsCounter, 2446 mSDsluCounter, 2944 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2454 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:09,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2454 Valid, 4035 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 610 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-02-08 04:50:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-02-08 04:50:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1557. [2025-02-08 04:50:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1532 states have (on average 1.4177545691906006) internal successors, (2172), 1536 states have internal predecessors, (2172), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 04:50:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2207 transitions. [2025-02-08 04:50:09,775 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2207 transitions. Word has length 252 [2025-02-08 04:50:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:09,776 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2207 transitions. [2025-02-08 04:50:09,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2207 transitions. [2025-02-08 04:50:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-08 04:50:09,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:09,779 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:09,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 04:50:09,979 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,SelfDestructingSolverStorable9 [2025-02-08 04:50:09,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:09,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1119108629, now seen corresponding path program 1 times [2025-02-08 04:50:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:09,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296176967] [2025-02-08 04:50:09,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:10,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-08 04:50:10,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-08 04:50:10,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:10,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:11,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296176967] [2025-02-08 04:50:11,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296176967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:50:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130021363] [2025-02-08 04:50:11,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:11,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:50:11,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:50:11,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 04:50:11,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-08 04:50:11,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-08 04:50:11,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:11,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:11,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 04:50:11,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:50:11,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 04:50:11,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-02-08 04:50:11,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:50:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:11,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:50:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:12,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130021363] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:50:12,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:50:12,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-02-08 04:50:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099857044] [2025-02-08 04:50:12,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:50:12,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:50:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:12,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:50:12,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-08 04:50:12,142 INFO L87 Difference]: Start difference. First operand 1557 states and 2207 transitions. Second operand has 11 states, 11 states have (on average 43.45454545454545) internal successors, (478), 11 states have internal predecessors, (478), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 04:50:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:12,922 INFO L93 Difference]: Finished difference Result 3812 states and 5356 transitions. [2025-02-08 04:50:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 04:50:12,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 43.45454545454545) internal successors, (478), 11 states have internal predecessors, (478), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 328 [2025-02-08 04:50:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:12,930 INFO L225 Difference]: With dead ends: 3812 [2025-02-08 04:50:12,931 INFO L226 Difference]: Without dead ends: 2489 [2025-02-08 04:50:12,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 645 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-02-08 04:50:12,934 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 1896 mSDsluCounter, 5802 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 6921 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:12,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1910 Valid, 6921 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 04:50:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-02-08 04:50:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2205. [2025-02-08 04:50:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 2168 states have (on average 1.3929889298892988) internal successors, (3020), 2172 states have internal predecessors, (3020), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 04:50:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3077 transitions. [2025-02-08 04:50:12,989 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3077 transitions. Word has length 328 [2025-02-08 04:50:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:12,989 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 3077 transitions. [2025-02-08 04:50:12,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 43.45454545454545) internal successors, (478), 11 states have internal predecessors, (478), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 04:50:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3077 transitions. [2025-02-08 04:50:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2025-02-08 04:50:12,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:13,001 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:13,014 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-02-08 04:50:13,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:13,206 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:13,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:13,207 INFO L85 PathProgramCache]: Analyzing trace with hash -734859200, now seen corresponding path program 1 times [2025-02-08 04:50:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:13,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903569836] [2025-02-08 04:50:13,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:13,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:13,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 766 statements into 1 equivalence classes. [2025-02-08 04:50:13,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 766 of 766 statements. [2025-02-08 04:50:13,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:13,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903569836] [2025-02-08 04:50:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903569836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:50:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318176608] [2025-02-08 04:50:17,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:17,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:50:17,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:50:17,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 04:50:17,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 766 statements into 1 equivalence classes. [2025-02-08 04:50:18,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 766 of 766 statements. [2025-02-08 04:50:18,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:18,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:18,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 3728 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 04:50:18,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:50:18,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 04:50:18,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:18,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:18,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:19,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:19,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:50:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:19,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:50:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:19,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318176608] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:50:19,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:50:19,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2025-02-08 04:50:19,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462090812] [2025-02-08 04:50:19,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:50:19,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 04:50:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:19,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 04:50:19,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-02-08 04:50:19,979 INFO L87 Difference]: Start difference. First operand 2205 states and 3077 transitions. Second operand has 21 states, 21 states have (on average 64.80952380952381) internal successors, (1361), 21 states have internal predecessors, (1361), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 04:50:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:21,184 INFO L93 Difference]: Finished difference Result 5546 states and 7699 transitions. [2025-02-08 04:50:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 04:50:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.80952380952381) internal successors, (1361), 21 states have internal predecessors, (1361), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 766 [2025-02-08 04:50:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:21,197 INFO L225 Difference]: With dead ends: 5546 [2025-02-08 04:50:21,198 INFO L226 Difference]: Without dead ends: 4223 [2025-02-08 04:50:21,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1556 GetRequests, 1520 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-02-08 04:50:21,200 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 7142 mSDsluCounter, 9139 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7184 SdHoareTripleChecker+Valid, 10258 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:21,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7184 Valid, 10258 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 04:50:21,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2025-02-08 04:50:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 3939. [2025-02-08 04:50:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3878 states have (on average 1.369778236204229) internal successors, (5312), 3882 states have internal predecessors, (5312), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:50:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 5417 transitions. [2025-02-08 04:50:21,279 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 5417 transitions. Word has length 766 [2025-02-08 04:50:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:21,280 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 5417 transitions. [2025-02-08 04:50:21,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.80952380952381) internal successors, (1361), 21 states have internal predecessors, (1361), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 04:50:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 5417 transitions. [2025-02-08 04:50:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1643 [2025-02-08 04:50:21,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:21,369 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:21,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 04:50:21,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:21,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:21,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1119664042, now seen corresponding path program 2 times [2025-02-08 04:50:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:21,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683230634] [2025-02-08 04:50:21,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:50:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:21,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1642 statements into 2 equivalence classes. [2025-02-08 04:50:21,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1642 statements. [2025-02-08 04:50:22,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:50:22,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:50:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683230634] [2025-02-08 04:50:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683230634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:22,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:22,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 04:50:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330267257] [2025-02-08 04:50:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:22,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:50:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:22,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:50:22,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:50:22,134 INFO L87 Difference]: Start difference. First operand 3939 states and 5417 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:22,872 INFO L93 Difference]: Finished difference Result 4793 states and 6683 transitions. [2025-02-08 04:50:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:50:22,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1642 [2025-02-08 04:50:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:22,884 INFO L225 Difference]: With dead ends: 4793 [2025-02-08 04:50:22,884 INFO L226 Difference]: Without dead ends: 3954 [2025-02-08 04:50:22,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:50:22,886 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 51 mSDsluCounter, 6421 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 7560 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:22,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 7560 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:50:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2025-02-08 04:50:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3950. [2025-02-08 04:50:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 3889 states have (on average 1.3687323219336591) internal successors, (5323), 3893 states have internal predecessors, (5323), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:50:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5428 transitions. [2025-02-08 04:50:22,954 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5428 transitions. Word has length 1642 [2025-02-08 04:50:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:22,955 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 5428 transitions. [2025-02-08 04:50:22,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5428 transitions. [2025-02-08 04:50:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1644 [2025-02-08 04:50:22,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:22,997 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:22,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 04:50:22,997 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 767041950, now seen corresponding path program 1 times [2025-02-08 04:50:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807270030] [2025-02-08 04:50:22,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:23,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1643 statements into 1 equivalence classes. [2025-02-08 04:50:24,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1643 of 1643 statements. [2025-02-08 04:50:24,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:24,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:50:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807270030] [2025-02-08 04:50:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807270030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:26,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 04:50:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530919024] [2025-02-08 04:50:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:26,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:50:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:26,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:50:26,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:50:26,796 INFO L87 Difference]: Start difference. First operand 3950 states and 5428 transitions. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:27,299 INFO L93 Difference]: Finished difference Result 4787 states and 6669 transitions. [2025-02-08 04:50:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:50:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1643 [2025-02-08 04:50:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:27,312 INFO L225 Difference]: With dead ends: 4787 [2025-02-08 04:50:27,312 INFO L226 Difference]: Without dead ends: 3958 [2025-02-08 04:50:27,314 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-02-08 04:50:27,315 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 24 mSDsluCounter, 6455 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 7599 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:27,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 7599 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:50:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2025-02-08 04:50:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3950. [2025-02-08 04:50:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 3889 states have (on average 1.3687323219336591) internal successors, (5323), 3893 states have internal predecessors, (5323), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:50:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5428 transitions. [2025-02-08 04:50:27,399 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5428 transitions. Word has length 1643 [2025-02-08 04:50:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:27,400 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 5428 transitions. [2025-02-08 04:50:27,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5428 transitions. [2025-02-08 04:50:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1644 [2025-02-08 04:50:27,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:27,417 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:27,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 04:50:27,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:27,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1812375451, now seen corresponding path program 1 times [2025-02-08 04:50:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:27,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407685254] [2025-02-08 04:50:27,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:27,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:27,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1643 statements into 1 equivalence classes. [2025-02-08 04:50:28,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1643 of 1643 statements. [2025-02-08 04:50:28,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:28,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:50:31,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407685254] [2025-02-08 04:50:31,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407685254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:31,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:31,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:50:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757013019] [2025-02-08 04:50:31,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:31,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:50:31,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:31,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:50:31,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:50:31,291 INFO L87 Difference]: Start difference. First operand 3950 states and 5428 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:31,745 INFO L93 Difference]: Finished difference Result 4793 states and 6678 transitions. [2025-02-08 04:50:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:50:31,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1643 [2025-02-08 04:50:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:31,755 INFO L225 Difference]: With dead ends: 4793 [2025-02-08 04:50:31,755 INFO L226 Difference]: Without dead ends: 3955 [2025-02-08 04:50:31,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:50:31,758 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 21 mSDsluCounter, 4306 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5451 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:31,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5451 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:50:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-02-08 04:50:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3954. [2025-02-08 04:50:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3893 states have (on average 1.3686103262265605) internal successors, (5328), 3897 states have internal predecessors, (5328), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:50:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 5433 transitions. [2025-02-08 04:50:31,819 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 5433 transitions. Word has length 1643 [2025-02-08 04:50:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:31,820 INFO L471 AbstractCegarLoop]: Abstraction has 3954 states and 5433 transitions. [2025-02-08 04:50:31,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 5433 transitions. [2025-02-08 04:50:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-02-08 04:50:31,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:31,836 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:31,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 04:50:31,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:31,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 141241585, now seen corresponding path program 1 times [2025-02-08 04:50:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:31,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531343571] [2025-02-08 04:50:31,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:32,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-02-08 04:50:32,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-02-08 04:50:32,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:32,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:50:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:35,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531343571] [2025-02-08 04:50:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531343571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:35,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 04:50:35,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407048058] [2025-02-08 04:50:35,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:35,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:50:35,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:35,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:50:35,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:50:35,756 INFO L87 Difference]: Start difference. First operand 3954 states and 5433 transitions. Second operand has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:36,413 INFO L93 Difference]: Finished difference Result 4799 states and 6685 transitions. [2025-02-08 04:50:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:50:36,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1644 [2025-02-08 04:50:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:36,425 INFO L225 Difference]: With dead ends: 4799 [2025-02-08 04:50:36,425 INFO L226 Difference]: Without dead ends: 3965 [2025-02-08 04:50:36,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:50:36,429 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 31 mSDsluCounter, 7603 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8742 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:36,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8742 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:50:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2025-02-08 04:50:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3962. [2025-02-08 04:50:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3901 states have (on average 1.3683670853627274) internal successors, (5338), 3905 states have internal predecessors, (5338), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:50:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 5443 transitions. [2025-02-08 04:50:36,489 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 5443 transitions. Word has length 1644 [2025-02-08 04:50:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:36,490 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 5443 transitions. [2025-02-08 04:50:36,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:50:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 5443 transitions. [2025-02-08 04:50:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-08 04:50:36,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:36,507 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:36,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 04:50:36,507 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:36,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:36,509 INFO L85 PathProgramCache]: Analyzing trace with hash 233429627, now seen corresponding path program 1 times [2025-02-08 04:50:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:36,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612168381] [2025-02-08 04:50:36,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:36,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:36,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-08 04:50:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-08 04:50:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 1988 proven. 75 refuted. 0 times theorem prover too weak. 5275 trivial. 0 not checked. [2025-02-08 04:50:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612168381] [2025-02-08 04:50:42,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612168381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:50:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040174825] [2025-02-08 04:50:42,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:42,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:50:42,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:50:42,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 04:50:43,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-08 04:50:44,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-08 04:50:44,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:44,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:44,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 7916 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 04:50:44,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:50:44,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 04:50:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:44,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:44,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:50:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 7314 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:45,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:50:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 7314 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:50:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040174825] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:50:47,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:50:47,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 32 [2025-02-08 04:50:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653222042] [2025-02-08 04:50:47,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:50:47,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 04:50:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:47,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 04:50:47,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=636, Unknown=0, NotChecked=0, Total=992 [2025-02-08 04:50:47,291 INFO L87 Difference]: Start difference. First operand 3962 states and 5443 transitions. Second operand has 32 states, 32 states have (on average 104.59375) internal successors, (3347), 32 states have internal predecessors, (3347), 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-02-08 04:50:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:49,742 INFO L93 Difference]: Finished difference Result 6838 states and 9437 transitions. [2025-02-08 04:50:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-02-08 04:50:49,743 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 104.59375) internal successors, (3347), 32 states have internal predecessors, (3347), 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 1645 [2025-02-08 04:50:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:49,755 INFO L225 Difference]: With dead ends: 6838 [2025-02-08 04:50:49,755 INFO L226 Difference]: Without dead ends: 5938 [2025-02-08 04:50:49,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3345 GetRequests, 3261 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2025-02-08 04:50:49,761 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 12497 mSDsluCounter, 13681 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12578 SdHoareTripleChecker+Valid, 14769 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:49,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12578 Valid, 14769 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 04:50:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5938 states. [2025-02-08 04:50:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5938 to 5938. [2025-02-08 04:50:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5938 states, 5838 states have (on average 1.357485440219253) internal successors, (7925), 5842 states have internal predecessors, (7925), 94 states have call successors, (94), 6 states have call predecessors, (94), 5 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-08 04:50:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5938 states to 5938 states and 8108 transitions. [2025-02-08 04:50:49,858 INFO L78 Accepts]: Start accepts. Automaton has 5938 states and 8108 transitions. Word has length 1645 [2025-02-08 04:50:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:49,859 INFO L471 AbstractCegarLoop]: Abstraction has 5938 states and 8108 transitions. [2025-02-08 04:50:49,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 104.59375) internal successors, (3347), 32 states have internal predecessors, (3347), 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-02-08 04:50:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5938 states and 8108 transitions. [2025-02-08 04:50:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2634 [2025-02-08 04:50:49,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:49,894 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, 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] [2025-02-08 04:50:49,926 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-02-08 04:50:50,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 04:50:50,095 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:50,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -991721297, now seen corresponding path program 2 times [2025-02-08 04:50:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734298349] [2025-02-08 04:50:50,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:50:50,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:50,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2633 statements into 2 equivalence classes. [2025-02-08 04:50:50,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 2633 statements. [2025-02-08 04:50:50,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:50:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 24134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24134 trivial. 0 not checked. [2025-02-08 04:50:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734298349] [2025-02-08 04:50:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734298349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 04:50:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13774351] [2025-02-08 04:50:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:50,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 04:50:50,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:50,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 04:50:50,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:50:50,895 INFO L87 Difference]: Start difference. First operand 5938 states and 8108 transitions. Second operand has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 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-02-08 04:50:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:51,801 INFO L93 Difference]: Finished difference Result 6797 states and 9378 transitions. [2025-02-08 04:50:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 04:50:51,802 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 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 2633 [2025-02-08 04:50:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:51,814 INFO L225 Difference]: With dead ends: 6797 [2025-02-08 04:50:51,815 INFO L226 Difference]: Without dead ends: 5983 [2025-02-08 04:50:51,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 04:50:51,818 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 102 mSDsluCounter, 7843 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 8989 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:51,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 8989 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 04:50:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2025-02-08 04:50:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 5944. [2025-02-08 04:50:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5944 states, 5844 states have (on average 1.357460643394935) internal successors, (7933), 5848 states have internal predecessors, (7933), 94 states have call successors, (94), 6 states have call predecessors, (94), 5 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-08 04:50:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5944 states to 5944 states and 8116 transitions. [2025-02-08 04:50:51,902 INFO L78 Accepts]: Start accepts. Automaton has 5944 states and 8116 transitions. Word has length 2633 [2025-02-08 04:50:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:51,904 INFO L471 AbstractCegarLoop]: Abstraction has 5944 states and 8116 transitions. [2025-02-08 04:50:51,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 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-02-08 04:50:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5944 states and 8116 transitions. [2025-02-08 04:50:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2634 [2025-02-08 04:50:51,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:51,937 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, 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] [2025-02-08 04:50:51,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 04:50:51,938 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:51,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:51,940 INFO L85 PathProgramCache]: Analyzing trace with hash -956244458, now seen corresponding path program 1 times [2025-02-08 04:50:51,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:51,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089831464] [2025-02-08 04:50:51,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:51,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:52,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2633 statements into 1 equivalence classes. [2025-02-08 04:50:53,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2633 of 2633 statements. [2025-02-08 04:50:53,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:53,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24134 trivial. 0 not checked. [2025-02-08 04:50:59,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089831464] [2025-02-08 04:50:59,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089831464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:59,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:59,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:50:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265726742] [2025-02-08 04:50:59,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:50:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:59,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:50:59,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:50:59,138 INFO L87 Difference]: Start difference. First operand 5944 states and 8116 transitions. Second operand has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 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-02-08 04:50:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:59,546 INFO L93 Difference]: Finished difference Result 6787 states and 9366 transitions. [2025-02-08 04:50:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:50:59,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 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 2633 [2025-02-08 04:50:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:59,561 INFO L225 Difference]: With dead ends: 6787 [2025-02-08 04:50:59,562 INFO L226 Difference]: Without dead ends: 5947 [2025-02-08 04:50:59,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:50:59,565 INFO L435 NwaCegarLoop]: 1148 mSDtfsCounter, 15 mSDsluCounter, 4316 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5464 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:59,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5464 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:50:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2025-02-08 04:50:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 5947. [2025-02-08 04:50:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5947 states, 5847 states have (on average 1.357277236189499) internal successors, (7936), 5851 states have internal predecessors, (7936), 94 states have call successors, (94), 6 states have call predecessors, (94), 5 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-08 04:50:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5947 states to 5947 states and 8119 transitions. [2025-02-08 04:50:59,662 INFO L78 Accepts]: Start accepts. Automaton has 5947 states and 8119 transitions. Word has length 2633 [2025-02-08 04:50:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:59,666 INFO L471 AbstractCegarLoop]: Abstraction has 5947 states and 8119 transitions. [2025-02-08 04:50:59,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 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-02-08 04:50:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5947 states and 8119 transitions. [2025-02-08 04:50:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2635 [2025-02-08 04:50:59,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:59,779 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, 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-02-08 04:50:59,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 04:50:59,779 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:59,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2072700039, now seen corresponding path program 1 times [2025-02-08 04:50:59,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:59,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153262616] [2025-02-08 04:50:59,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:59,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:51:00,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2634 statements into 1 equivalence classes. [2025-02-08 04:51:02,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2634 of 2634 statements. [2025-02-08 04:51:02,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:51:02,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat