./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:11:06,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:11:06,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:11:06,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:11:06,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:11:06,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:11:06,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:11:06,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:11:06,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:11:06,916 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:11:06,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:11:06,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:11:06,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:11:06,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:11:06,917 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:11:06,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:11:06,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:11:06,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:11:06,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:11:06,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:11:06,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:11:06,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:11:06,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:11:06,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:11:06,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:11:06,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:11:06,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:11:06,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:11:06,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:11:06,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:11:06,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:11:06,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:11:06,920 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/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 -> ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e [2025-03-04 06:11:07,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:11:07,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:11:07,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:11:07,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:11:07,165 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:11:07,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2025-03-04 06:11:08,333 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592e2cde3/6d1de7847d2545bbbde41871f1ab4d4c/FLAGc01947fd8 [2025-03-04 06:11:08,664 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:11:08,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2025-03-04 06:11:08,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592e2cde3/6d1de7847d2545bbbde41871f1ab4d4c/FLAGc01947fd8 [2025-03-04 06:11:08,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592e2cde3/6d1de7847d2545bbbde41871f1ab4d4c [2025-03-04 06:11:08,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:11:08,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:11:08,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:11:08,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:11:08,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:11:08,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:11:08" (1/1) ... [2025-03-04 06:11:08,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d408809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:08, skipping insertion in model container [2025-03-04 06:11:08,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:11:08" (1/1) ... [2025-03-04 06:11:08,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:11:08,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i[33022,33035] [2025-03-04 06:11:09,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:11:09,165 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:11:09,189 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i[33022,33035] [2025-03-04 06:11:09,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:11:09,300 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:11:09,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09 WrapperNode [2025-03-04 06:11:09,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:11:09,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:11:09,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:11:09,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:11:09,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,451 INFO L138 Inliner]: procedures = 177, calls = 506, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3305 [2025-03-04 06:11:09,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:11:09,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:11:09,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:11:09,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:11:09,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,648 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2025-03-04 06:11:09,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:11:09,746 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:11:09,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:11:09,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:11:09,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (1/1) ... [2025-03-04 06:11:09,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:11:09,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:11:09,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:11:09,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-04 06:11:09,800 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:11:09,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:11:09,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:11:09,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:11:09,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:11:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:11:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:11:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:11:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:11:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:11:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:11:09,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:11:10,026 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:11:10,028 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:11:11,986 INFO L1325 $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-03-04 06:11:12,196 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2025-03-04 06:11:12,197 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:11:12,290 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:11:12,295 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 06:11:12,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:11:12 BoogieIcfgContainer [2025-03-04 06:11:12,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:11:12,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:11:12,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:11:12,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:11:12,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:11:08" (1/3) ... [2025-03-04 06:11:12,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549a6d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:11:12, skipping insertion in model container [2025-03-04 06:11:12,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:11:09" (2/3) ... [2025-03-04 06:11:12,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549a6d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:11:12, skipping insertion in model container [2025-03-04 06:11:12,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:11:12" (3/3) ... [2025-03-04 06:11:12,304 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-1.i [2025-03-04 06:11:12,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:11:12,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test10-1.i that has 6 procedures, 1024 locations, 1 initial locations, 78 loop locations, and 1 error locations. [2025-03-04 06:11:12,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:11:12,410 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;@42c138ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:11:12,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 06:11:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 1016 states, 997 states have (on average 1.6248746238716147) internal successors, (1620), 1002 states have internal predecessors, (1620), 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-03-04 06:11:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 06:11:12,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:12,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:11:12,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:12,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash -380536812, now seen corresponding path program 1 times [2025-03-04 06:11:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:12,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169795145] [2025-03-04 06:11:12,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:12,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 06:11:12,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 06:11:12,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:11:12,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:12,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169795145] [2025-03-04 06:11:12,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169795145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:12,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:12,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:11:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460414227] [2025-03-04 06:11:12,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:12,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:11:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:12,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:11:12,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:11:12,587 INFO L87 Difference]: Start difference. First operand has 1016 states, 997 states have (on average 1.6248746238716147) internal successors, (1620), 1002 states have internal predecessors, (1620), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:11:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:12,834 INFO L93 Difference]: Finished difference Result 2030 states and 3302 transitions. [2025-03-04 06:11:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:11:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 06:11:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:12,857 INFO L225 Difference]: With dead ends: 2030 [2025-03-04 06:11:12,857 INFO L226 Difference]: Without dead ends: 1012 [2025-03-04 06:11:12,867 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-03-04 06:11:12,869 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:12,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1381 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:11:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-03-04 06:11:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2025-03-04 06:11:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 994 states have (on average 1.4788732394366197) internal successors, (1470), 999 states have internal predecessors, (1470), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:11:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1497 transitions. [2025-03-04 06:11:12,989 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1497 transitions. Word has length 13 [2025-03-04 06:11:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:12,990 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1497 transitions. [2025-03-04 06:11:12,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:11:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1497 transitions. [2025-03-04 06:11:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:11:12,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:12,998 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-03-04 06:11:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:11:12,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:12,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1192121012, now seen corresponding path program 1 times [2025-03-04 06:11:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819032031] [2025-03-04 06:11:12,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:13,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:11:13,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:11:13,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:13,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:11:13,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:13,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819032031] [2025-03-04 06:11:13,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819032031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:13,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:13,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:11:13,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205267981] [2025-03-04 06:11:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:13,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:11:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:13,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:11:13,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:11:13,474 INFO L87 Difference]: Start difference. First operand 1012 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-03-04 06:11:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:13,936 INFO L93 Difference]: Finished difference Result 2018 states and 2988 transitions. [2025-03-04 06:11:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:11:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-03-04 06:11:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:13,942 INFO L225 Difference]: With dead ends: 2018 [2025-03-04 06:11:13,943 INFO L226 Difference]: Without dead ends: 1392 [2025-03-04 06:11:13,944 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-03-04 06:11:13,945 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 542 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:13,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4053 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:11:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-04 06:11:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1014. [2025-03-04 06:11:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 996 states have (on average 1.4779116465863453) internal successors, (1472), 1001 states have internal predecessors, (1472), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:11:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1499 transitions. [2025-03-04 06:11:13,980 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1499 transitions. Word has length 66 [2025-03-04 06:11:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:13,981 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1499 transitions. [2025-03-04 06:11:13,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-03-04 06:11:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1499 transitions. [2025-03-04 06:11:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 06:11:13,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:13,986 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] [2025-03-04 06:11:13,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:11:13,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:13,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash 263222360, now seen corresponding path program 1 times [2025-03-04 06:11:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:13,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94180393] [2025-03-04 06:11:13,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:14,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 06:11:14,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 06:11:14,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:11:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94180393] [2025-03-04 06:11:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94180393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:14,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:14,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:11:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666411464] [2025-03-04 06:11:14,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:14,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:11:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:14,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:11:14,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:11:14,549 INFO L87 Difference]: Start difference. First operand 1014 states and 1499 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-03-04 06:11:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:15,012 INFO L93 Difference]: Finished difference Result 2402 states and 3547 transitions. [2025-03-04 06:11:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:11:15,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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 141 [2025-03-04 06:11:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:15,018 INFO L225 Difference]: With dead ends: 2402 [2025-03-04 06:11:15,018 INFO L226 Difference]: Without dead ends: 1392 [2025-03-04 06:11:15,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:11:15,021 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 1078 mSDsluCounter, 3987 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 5363 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:15,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 5363 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:11:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-04 06:11:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1017. [2025-03-04 06:11:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 999 states have (on average 1.4764764764764764) internal successors, (1475), 1004 states have internal predecessors, (1475), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:11:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1502 transitions. [2025-03-04 06:11:15,046 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1502 transitions. Word has length 141 [2025-03-04 06:11:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:15,047 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1502 transitions. [2025-03-04 06:11:15,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-03-04 06:11:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1502 transitions. [2025-03-04 06:11:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-04 06:11:15,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:15,050 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] [2025-03-04 06:11:15,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:11:15,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:15,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1606050077, now seen corresponding path program 1 times [2025-03-04 06:11:15,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:15,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98749039] [2025-03-04 06:11:15,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:15,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:15,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 06:11:15,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 06:11:15,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:15,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:11:15,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:15,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98749039] [2025-03-04 06:11:15,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98749039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:15,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:15,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:11:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655599330] [2025-03-04 06:11:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:15,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:11:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:15,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:11:15,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:11:15,384 INFO L87 Difference]: Start difference. First operand 1017 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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-03-04 06:11:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:15,628 INFO L93 Difference]: Finished difference Result 1985 states and 2931 transitions. [2025-03-04 06:11:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:11:15,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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 210 [2025-03-04 06:11:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:15,633 INFO L225 Difference]: With dead ends: 1985 [2025-03-04 06:11:15,633 INFO L226 Difference]: Without dead ends: 975 [2025-03-04 06:11:15,634 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-03-04 06:11:15,636 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 30 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3836 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-03-04 06:11:15,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3836 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:11:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-04 06:11:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2025-03-04 06:11:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 957 states have (on average 1.4608150470219436) internal successors, (1398), 962 states have internal predecessors, (1398), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:11:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1425 transitions. [2025-03-04 06:11:15,687 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1425 transitions. Word has length 210 [2025-03-04 06:11:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:15,687 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1425 transitions. [2025-03-04 06:11:15,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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-03-04 06:11:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1425 transitions. [2025-03-04 06:11:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-04 06:11:15,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:15,693 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] [2025-03-04 06:11:15,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:11:15,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:15,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash 802950237, now seen corresponding path program 1 times [2025-03-04 06:11:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:15,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006079913] [2025-03-04 06:11:15,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:15,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 06:11:15,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 06:11:15,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:15,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:11:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:15,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006079913] [2025-03-04 06:11:15,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006079913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:15,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:15,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:11:15,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986353492] [2025-03-04 06:11:15,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:15,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:11:15,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:15,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:11:15,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:11:15,901 INFO L87 Difference]: Start difference. First operand 975 states and 1425 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-03-04 06:11:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:16,169 INFO L93 Difference]: Finished difference Result 2466 states and 3618 transitions. [2025-03-04 06:11:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:11:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 210 [2025-03-04 06:11:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:16,178 INFO L225 Difference]: With dead ends: 2466 [2025-03-04 06:11:16,179 INFO L226 Difference]: Without dead ends: 1498 [2025-03-04 06:11:16,180 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-03-04 06:11:16,182 INFO L435 NwaCegarLoop]: 1301 mSDtfsCounter, 710 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2584 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-03-04 06:11:16,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2584 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:11:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-04 06:11:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1341. [2025-03-04 06:11:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1321 states have (on average 1.4640423921271764) internal successors, (1934), 1326 states have internal predecessors, (1934), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:11:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1965 transitions. [2025-03-04 06:11:16,219 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1965 transitions. Word has length 210 [2025-03-04 06:11:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:16,219 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1965 transitions. [2025-03-04 06:11:16,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-03-04 06:11:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1965 transitions. [2025-03-04 06:11:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-04 06:11:16,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:16,225 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] [2025-03-04 06:11:16,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:11:16,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:16,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 11785375, now seen corresponding path program 1 times [2025-03-04 06:11:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302808804] [2025-03-04 06:11:16,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:16,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 06:11:16,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 06:11:16,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:16,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:11:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302808804] [2025-03-04 06:11:16,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302808804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:16,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:16,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:11:16,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574920556] [2025-03-04 06:11:16,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:16,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:11:16,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:16,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:11:16,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:11:16,602 INFO L87 Difference]: Start difference. First operand 1341 states and 1965 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-03-04 06:11:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:16,840 INFO L93 Difference]: Finished difference Result 2550 states and 3743 transitions. [2025-03-04 06:11:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:11:16,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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 225 [2025-03-04 06:11:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:16,847 INFO L225 Difference]: With dead ends: 2550 [2025-03-04 06:11:16,847 INFO L226 Difference]: Without dead ends: 1299 [2025-03-04 06:11:16,849 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-03-04 06:11:16,849 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 30 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3614 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-03-04 06:11:16,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3614 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:11:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-04 06:11:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1299. [2025-03-04 06:11:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1279 states have (on average 1.4519155590304926) internal successors, (1857), 1284 states have internal predecessors, (1857), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:11:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1888 transitions. [2025-03-04 06:11:16,878 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1888 transitions. Word has length 225 [2025-03-04 06:11:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:16,879 INFO L471 AbstractCegarLoop]: Abstraction has 1299 states and 1888 transitions. [2025-03-04 06:11:16,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-03-04 06:11:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1888 transitions. [2025-03-04 06:11:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-04 06:11:16,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:16,882 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] [2025-03-04 06:11:16,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:11:16,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:16,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:16,883 INFO L85 PathProgramCache]: Analyzing trace with hash 876109862, now seen corresponding path program 1 times [2025-03-04 06:11:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749694645] [2025-03-04 06:11:16,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:16,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:16,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 06:11:16,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 06:11:16,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:16,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:11:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749694645] [2025-03-04 06:11:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749694645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:17,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:17,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:11:17,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267473121] [2025-03-04 06:11:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:17,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:11:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:17,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:11:17,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:11:17,187 INFO L87 Difference]: Start difference. First operand 1299 states and 1888 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-03-04 06:11:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:17,436 INFO L93 Difference]: Finished difference Result 3070 states and 4480 transitions. [2025-03-04 06:11:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:11:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 225 [2025-03-04 06:11:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:17,446 INFO L225 Difference]: With dead ends: 3070 [2025-03-04 06:11:17,446 INFO L226 Difference]: Without dead ends: 1861 [2025-03-04 06:11:17,448 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-03-04 06:11:17,449 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 591 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 2640 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-03-04 06:11:17,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 2640 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:11:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2025-03-04 06:11:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1856. [2025-03-04 06:11:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1830 states have (on average 1.4551912568306011) internal successors, (2663), 1835 states have internal predecessors, (2663), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 06:11:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2706 transitions. [2025-03-04 06:11:17,501 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2706 transitions. Word has length 225 [2025-03-04 06:11:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:17,502 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2706 transitions. [2025-03-04 06:11:17,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-03-04 06:11:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2706 transitions. [2025-03-04 06:11:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-04 06:11:17,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:17,506 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] [2025-03-04 06:11:17,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:11:17,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:17,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1836684401, now seen corresponding path program 1 times [2025-03-04 06:11:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:17,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954352617] [2025-03-04 06:11:17,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:17,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 06:11:17,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 06:11:17,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:17,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:17,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:17,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954352617] [2025-03-04 06:11:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954352617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:17,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:17,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:11:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605805315] [2025-03-04 06:11:17,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:17,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:11:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:17,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:11:17,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:11:17,805 INFO L87 Difference]: Start difference. First operand 1856 states and 2706 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-03-04 06:11:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:18,344 INFO L93 Difference]: Finished difference Result 3056 states and 4462 transitions. [2025-03-04 06:11:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:11:18,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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 240 [2025-03-04 06:11:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:18,351 INFO L225 Difference]: With dead ends: 3056 [2025-03-04 06:11:18,352 INFO L226 Difference]: Without dead ends: 1433 [2025-03-04 06:11:18,354 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-03-04 06:11:18,355 INFO L435 NwaCegarLoop]: 1256 mSDtfsCounter, 2348 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 1438 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-03-04 06:11:18,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 1438 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:11:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-03-04 06:11:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2025-03-04 06:11:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1412 states have (on average 1.4405099150141643) internal successors, (2034), 1417 states have internal predecessors, (2034), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 06:11:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2067 transitions. [2025-03-04 06:11:18,419 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2067 transitions. Word has length 240 [2025-03-04 06:11:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:18,419 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2067 transitions. [2025-03-04 06:11:18,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-03-04 06:11:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2067 transitions. [2025-03-04 06:11:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 06:11:18,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:18,423 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] [2025-03-04 06:11:18,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:11:18,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:18,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1656163521, now seen corresponding path program 1 times [2025-03-04 06:11:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206670712] [2025-03-04 06:11:18,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:18,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:11:18,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:11:18,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:18,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 06:11:18,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:18,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206670712] [2025-03-04 06:11:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206670712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:11:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768551886] [2025-03-04 06:11:18,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:18,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:11:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:18,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:11:18,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:11:18,724 INFO L87 Difference]: Start difference. First operand 1433 states and 2067 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-03-04 06:11:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:18,929 INFO L93 Difference]: Finished difference Result 2307 states and 3370 transitions. [2025-03-04 06:11:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:11:18,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 250 [2025-03-04 06:11:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:18,936 INFO L225 Difference]: With dead ends: 2307 [2025-03-04 06:11:18,937 INFO L226 Difference]: Without dead ends: 1453 [2025-03-04 06:11:18,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:11:18,939 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 8 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:18,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2399 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:11:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-03-04 06:11:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2025-03-04 06:11:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1432 states have (on average 1.4343575418994414) internal successors, (2054), 1437 states have internal predecessors, (2054), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 06:11:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2087 transitions. [2025-03-04 06:11:18,982 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2087 transitions. Word has length 250 [2025-03-04 06:11:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:18,982 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2087 transitions. [2025-03-04 06:11:18,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-03-04 06:11:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2087 transitions. [2025-03-04 06:11:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 06:11:18,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:18,985 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] [2025-03-04 06:11:18,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:11:18,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:18,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -464123678, now seen corresponding path program 1 times [2025-03-04 06:11:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:18,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910379494] [2025-03-04 06:11:18,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:18,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:19,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:11:19,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:11:19,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:19,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 06:11:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910379494] [2025-03-04 06:11:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910379494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:11:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737635827] [2025-03-04 06:11:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:11:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:19,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:11:19,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:11:19,357 INFO L87 Difference]: Start difference. First operand 1453 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-03-04 06:11:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:19,573 INFO L93 Difference]: Finished difference Result 2317 states and 3373 transitions. [2025-03-04 06:11:19,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:11:19,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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 250 [2025-03-04 06:11:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:19,578 INFO L225 Difference]: With dead ends: 2317 [2025-03-04 06:11:19,579 INFO L226 Difference]: Without dead ends: 1391 [2025-03-04 06:11:19,580 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-03-04 06:11:19,581 INFO L435 NwaCegarLoop]: 1132 mSDtfsCounter, 32 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:19,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3382 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:11:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-04 06:11:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2025-03-04 06:11:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1370 states have (on average 1.4262773722627737) internal successors, (1954), 1375 states have internal predecessors, (1954), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 06:11:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1987 transitions. [2025-03-04 06:11:19,614 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1987 transitions. Word has length 250 [2025-03-04 06:11:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:19,614 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1987 transitions. [2025-03-04 06:11:19,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-03-04 06:11:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1987 transitions. [2025-03-04 06:11:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 06:11:19,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:19,617 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] [2025-03-04 06:11:19,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:11:19,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:19,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:19,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1850067397, now seen corresponding path program 1 times [2025-03-04 06:11:19,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:19,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847704338] [2025-03-04 06:11:19,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:19,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:11:19,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:11:19,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:19,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:20,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847704338] [2025-03-04 06:11:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847704338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:11:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140565404] [2025-03-04 06:11:20,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:20,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:11:20,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:11:20,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:11:20,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:11:20,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:11:21,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:11:21,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:21,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:21,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 06:11:21,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:11:21,493 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-03-04 06:11:21,507 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-03-04 06:11:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:21,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:11:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140565404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:21,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:11:21,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-04 06:11:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291607855] [2025-03-04 06:11:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:21,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:11:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:21,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:11:21,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:11:21,521 INFO L87 Difference]: Start difference. First operand 1391 states and 1987 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 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-03-04 06:11:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:22,950 INFO L93 Difference]: Finished difference Result 2577 states and 3696 transitions. [2025-03-04 06:11:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:11:22,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 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 250 [2025-03-04 06:11:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:22,962 INFO L225 Difference]: With dead ends: 2577 [2025-03-04 06:11:22,962 INFO L226 Difference]: Without dead ends: 1710 [2025-03-04 06:11:22,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 06:11:22,966 INFO L435 NwaCegarLoop]: 1093 mSDtfsCounter, 1854 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 4104 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:22,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 4104 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 06:11:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-04 06:11:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1559. [2025-03-04 06:11:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1528 states have (on average 1.418193717277487) internal successors, (2167), 1537 states have internal predecessors, (2167), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 06:11:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2214 transitions. [2025-03-04 06:11:23,030 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2214 transitions. Word has length 250 [2025-03-04 06:11:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:23,031 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2214 transitions. [2025-03-04 06:11:23,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 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-03-04 06:11:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2214 transitions. [2025-03-04 06:11:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 06:11:23,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:23,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:11:23,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:11:23,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 06:11:23,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:23,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1286989784, now seen corresponding path program 1 times [2025-03-04 06:11:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763075188] [2025-03-04 06:11:23,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:23,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 06:11:23,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 06:11:23,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:23,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:24,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763075188] [2025-03-04 06:11:24,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763075188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:11:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370458773] [2025-03-04 06:11:24,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:24,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:11:24,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:11:24,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:11:24,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:11:24,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 06:11:24,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 06:11:24,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:24,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:24,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:11:24,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:11:24,781 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-03-04 06:11:25,122 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-03-04 06:11:25,134 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-03-04 06:11:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:25,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:11:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:25,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370458773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:11:25,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:11:25,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-03-04 06:11:25,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857115220] [2025-03-04 06:11:25,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:11:25,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 06:11:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:25,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 06:11:25,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:11:25,415 INFO L87 Difference]: Start difference. First operand 1559 states and 2214 transitions. Second operand has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 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-03-04 06:11:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:26,256 INFO L93 Difference]: Finished difference Result 3811 states and 5365 transitions. [2025-03-04 06:11:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:11:26,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 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 325 [2025-03-04 06:11:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:26,264 INFO L225 Difference]: With dead ends: 3811 [2025-03-04 06:11:26,265 INFO L226 Difference]: Without dead ends: 2485 [2025-03-04 06:11:26,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 639 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-04 06:11:26,268 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 1908 mSDsluCounter, 8135 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1926 SdHoareTripleChecker+Valid, 9256 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:26,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1926 Valid, 9256 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:11:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-04 06:11:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2203. [2025-03-04 06:11:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2160 states have (on average 1.3939814814814815) internal successors, (3011), 2169 states have internal predecessors, (3011), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 06:11:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3080 transitions. [2025-03-04 06:11:26,326 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3080 transitions. Word has length 325 [2025-03-04 06:11:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:26,327 INFO L471 AbstractCegarLoop]: Abstraction has 2203 states and 3080 transitions. [2025-03-04 06:11:26,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 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-03-04 06:11:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3080 transitions. [2025-03-04 06:11:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-04 06:11:26,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:26,338 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-03-04 06:11:26,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:11:26,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 06:11:26,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:26,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash -485828768, now seen corresponding path program 1 times [2025-03-04 06:11:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:26,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025340616] [2025-03-04 06:11:26,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:26,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-04 06:11:26,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-04 06:11:26,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:26,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:31,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025340616] [2025-03-04 06:11:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025340616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:11:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080318067] [2025-03-04 06:11:31,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:31,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:11:31,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:11:31,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:11:31,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:11:31,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-04 06:11:32,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-04 06:11:32,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:32,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:32,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 3726 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 06:11:32,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:11:32,262 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-03-04 06:11:32,583 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-03-04 06:11:32,748 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-03-04 06:11:32,931 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-03-04 06:11:33,077 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-03-04 06:11:33,083 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-03-04 06:11:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:33,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:11:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:11:33,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080318067] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:11:33,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:11:33,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-03-04 06:11:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100752110] [2025-03-04 06:11:33,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:11:33,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 06:11:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:33,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 06:11:33,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-04 06:11:33,718 INFO L87 Difference]: Start difference. First operand 2203 states and 3080 transitions. Second operand has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 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-03-04 06:11:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:34,820 INFO L93 Difference]: Finished difference Result 5533 states and 7696 transitions. [2025-03-04 06:11:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 06:11:34,826 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 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 757 [2025-03-04 06:11:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:34,887 INFO L225 Difference]: With dead ends: 5533 [2025-03-04 06:11:34,891 INFO L226 Difference]: Without dead ends: 4207 [2025-03-04 06:11:34,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1537 GetRequests, 1501 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-03-04 06:11:34,895 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 4895 mSDsluCounter, 8830 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4937 SdHoareTripleChecker+Valid, 9951 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:34,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4937 Valid, 9951 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 06:11:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2025-03-04 06:11:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 3925. [2025-03-04 06:11:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3858 states have (on average 1.371435977190254) internal successors, (5291), 3867 states have internal predecessors, (5291), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:11:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 5408 transitions. [2025-03-04 06:11:35,087 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 5408 transitions. Word has length 757 [2025-03-04 06:11:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:35,091 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 5408 transitions. [2025-03-04 06:11:35,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 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-03-04 06:11:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 5408 transitions. [2025-03-04 06:11:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-04 06:11:35,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:35,141 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-04 06:11:35,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:11:35,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:11:35,342 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:35,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -622598704, now seen corresponding path program 2 times [2025-03-04 06:11:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765122363] [2025-03-04 06:11:35,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:11:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:35,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1621 statements into 2 equivalence classes. [2025-03-04 06:11:35,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1621 statements. [2025-03-04 06:11:35,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:11:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:11:35,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765122363] [2025-03-04 06:11:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765122363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:35,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:35,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:11:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637308723] [2025-03-04 06:11:35,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:35,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:11:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:35,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:11:35,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:11:35,949 INFO L87 Difference]: Start difference. First operand 3925 states and 5408 transitions. Second operand has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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-03-04 06:11:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:36,630 INFO L93 Difference]: Finished difference Result 4782 states and 6685 transitions. [2025-03-04 06:11:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:11:36,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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 1621 [2025-03-04 06:11:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:36,642 INFO L225 Difference]: With dead ends: 4782 [2025-03-04 06:11:36,642 INFO L226 Difference]: Without dead ends: 3936 [2025-03-04 06:11:36,644 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-03-04 06:11:36,645 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 45 mSDsluCounter, 5369 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6507 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:36,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6507 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:11:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2025-03-04 06:11:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3932. [2025-03-04 06:11:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3932 states, 3865 states have (on average 1.3707632600258732) internal successors, (5298), 3874 states have internal predecessors, (5298), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:11:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 5415 transitions. [2025-03-04 06:11:36,751 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 5415 transitions. Word has length 1621 [2025-03-04 06:11:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:36,752 INFO L471 AbstractCegarLoop]: Abstraction has 3932 states and 5415 transitions. [2025-03-04 06:11:36,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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-03-04 06:11:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 5415 transitions. [2025-03-04 06:11:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-04 06:11:36,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:36,767 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-04 06:11:36,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:11:36,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:36,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1842472832, now seen corresponding path program 1 times [2025-03-04 06:11:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266203679] [2025-03-04 06:11:36,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:37,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-04 06:11:37,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-04 06:11:37,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:11:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:41,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266203679] [2025-03-04 06:11:41,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266203679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:41,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:41,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:11:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695739006] [2025-03-04 06:11:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:41,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:11:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:41,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:11:41,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:11:41,370 INFO L87 Difference]: Start difference. First operand 3932 states and 5415 transitions. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 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-03-04 06:11:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:41,904 INFO L93 Difference]: Finished difference Result 4782 states and 6680 transitions. [2025-03-04 06:11:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:11:41,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 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 1622 [2025-03-04 06:11:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:41,917 INFO L225 Difference]: With dead ends: 4782 [2025-03-04 06:11:41,918 INFO L226 Difference]: Without dead ends: 3937 [2025-03-04 06:11:41,920 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-03-04 06:11:41,920 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 17 mSDsluCounter, 5354 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6498 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:41,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6498 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:11:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2025-03-04 06:11:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3936. [2025-03-04 06:11:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3869 states have (on average 1.3706384078573275) internal successors, (5303), 3878 states have internal predecessors, (5303), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:11:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5420 transitions. [2025-03-04 06:11:41,988 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5420 transitions. Word has length 1622 [2025-03-04 06:11:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:41,989 INFO L471 AbstractCegarLoop]: Abstraction has 3936 states and 5420 transitions. [2025-03-04 06:11:41,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 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-03-04 06:11:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5420 transitions. [2025-03-04 06:11:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-04 06:11:42,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:42,005 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-04 06:11:42,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:11:42,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:42,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash 126922937, now seen corresponding path program 1 times [2025-03-04 06:11:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:42,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114922184] [2025-03-04 06:11:42,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:42,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-04 06:11:42,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-04 06:11:42,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:42,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:11:46,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:46,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114922184] [2025-03-04 06:11:46,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114922184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:46,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:46,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:11:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838947710] [2025-03-04 06:11:46,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:46,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:11:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:46,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:11:46,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:11:46,027 INFO L87 Difference]: Start difference. First operand 3936 states and 5420 transitions. Second operand has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 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-03-04 06:11:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:46,493 INFO L93 Difference]: Finished difference Result 4780 states and 6676 transitions. [2025-03-04 06:11:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:11:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 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 1622 [2025-03-04 06:11:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:46,505 INFO L225 Difference]: With dead ends: 4780 [2025-03-04 06:11:46,505 INFO L226 Difference]: Without dead ends: 3944 [2025-03-04 06:11:46,507 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-03-04 06:11:46,508 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 25 mSDsluCounter, 5399 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6537 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:46,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6537 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:11:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-03-04 06:11:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3936. [2025-03-04 06:11:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3869 states have (on average 1.3706384078573275) internal successors, (5303), 3878 states have internal predecessors, (5303), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:11:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5420 transitions. [2025-03-04 06:11:46,577 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5420 transitions. Word has length 1622 [2025-03-04 06:11:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:46,578 INFO L471 AbstractCegarLoop]: Abstraction has 3936 states and 5420 transitions. [2025-03-04 06:11:46,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 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-03-04 06:11:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5420 transitions. [2025-03-04 06:11:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-04 06:11:46,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:46,597 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-04 06:11:46,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:11:46,598 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash -692160073, now seen corresponding path program 1 times [2025-03-04 06:11:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388410324] [2025-03-04 06:11:46,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:47,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-04 06:11:47,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-04 06:11:47,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:47,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:11:50,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:50,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388410324] [2025-03-04 06:11:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388410324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:50,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:11:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237842319] [2025-03-04 06:11:50,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:50,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:11:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:50,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:11:50,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:11:50,556 INFO L87 Difference]: Start difference. First operand 3936 states and 5420 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 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-03-04 06:11:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:51,217 INFO L93 Difference]: Finished difference Result 4788 states and 6687 transitions. [2025-03-04 06:11:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:11:51,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 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 1623 [2025-03-04 06:11:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:51,227 INFO L225 Difference]: With dead ends: 4788 [2025-03-04 06:11:51,227 INFO L226 Difference]: Without dead ends: 3947 [2025-03-04 06:11:51,229 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-03-04 06:11:51,229 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 31 mSDsluCounter, 7617 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8758 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-03-04 06:11:51,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8758 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:11:51,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2025-03-04 06:11:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3944. [2025-03-04 06:11:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3877 states have (on average 1.3703894763992779) internal successors, (5313), 3886 states have internal predecessors, (5313), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:11:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5430 transitions. [2025-03-04 06:11:51,287 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5430 transitions. Word has length 1623 [2025-03-04 06:11:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:51,289 INFO L471 AbstractCegarLoop]: Abstraction has 3944 states and 5430 transitions. [2025-03-04 06:11:51,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 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-03-04 06:11:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5430 transitions. [2025-03-04 06:11:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-04 06:11:51,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:51,305 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-04 06:11:51,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:11:51,305 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:51,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2033677405, now seen corresponding path program 1 times [2025-03-04 06:11:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:51,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361962213] [2025-03-04 06:11:51,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:51,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:51,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-04 06:11:52,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-04 06:11:52,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:52,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:11:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:11:54,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:11:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361962213] [2025-03-04 06:11:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361962213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:11:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:11:54,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:11:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556834043] [2025-03-04 06:11:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:11:54,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:11:54,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:11:54,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:11:54,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:11:54,954 INFO L87 Difference]: Start difference. First operand 3944 states and 5430 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-03-04 06:11:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:11:55,326 INFO L93 Difference]: Finished difference Result 4794 states and 6695 transitions. [2025-03-04 06:11:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:11:55,326 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 1624 [2025-03-04 06:11:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:11:55,335 INFO L225 Difference]: With dead ends: 4794 [2025-03-04 06:11:55,335 INFO L226 Difference]: Without dead ends: 3947 [2025-03-04 06:11:55,337 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-03-04 06:11:55,338 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 16 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:11:55,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4407 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:11:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2025-03-04 06:11:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3947. [2025-03-04 06:11:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3880 states have (on average 1.3701030927835052) internal successors, (5316), 3889 states have internal predecessors, (5316), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:11:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5433 transitions. [2025-03-04 06:11:55,421 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5433 transitions. Word has length 1624 [2025-03-04 06:11:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:11:55,423 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 5433 transitions. [2025-03-04 06:11:55,423 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-03-04 06:11:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5433 transitions. [2025-03-04 06:11:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-04 06:11:55,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:11:55,452 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-04 06:11:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:11:55,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:11:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:11:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1399373452, now seen corresponding path program 1 times [2025-03-04 06:11:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:11:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830441564] [2025-03-04 06:11:55,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:11:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:11:55,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-04 06:11:56,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-04 06:11:56,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:11:56,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:12:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 1961 proven. 74 refuted. 0 times theorem prover too weak. 5203 trivial. 0 not checked. [2025-03-04 06:12:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:12:00,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830441564] [2025-03-04 06:12:00,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830441564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:12:00,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556898145] [2025-03-04 06:12:00,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:12:00,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:12:00,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:12:00,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:12:00,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:12:02,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-04 06:12:03,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-04 06:12:03,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:12:03,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:12:03,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 7914 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 06:12:03,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:12:03,323 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-03-04 06:12:03,446 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-03-04 06:12:03,581 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-03-04 06:12:03,714 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-03-04 06:12:03,847 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-03-04 06:12:03,981 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-03-04 06:12:04,107 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-03-04 06:12:04,238 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-03-04 06:12:04,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:12:04,503 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-03-04 06:12:04,572 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-03-04 06:12:04,585 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-03-04 06:12:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:12:04,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:12:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:12:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556898145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:12:06,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:12:06,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-03-04 06:12:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171140063] [2025-03-04 06:12:06,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:12:06,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:12:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:12:06,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:12:06,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:12:06,244 INFO L87 Difference]: Start difference. First operand 3947 states and 5433 transitions. Second operand has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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-03-04 06:12:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:12:08,571 INFO L93 Difference]: Finished difference Result 8176 states and 11270 transitions. [2025-03-04 06:12:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-04 06:12:08,572 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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 1624 [2025-03-04 06:12:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:12:08,590 INFO L225 Difference]: With dead ends: 8176 [2025-03-04 06:12:08,590 INFO L226 Difference]: Without dead ends: 7271 [2025-03-04 06:12:08,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3303 GetRequests, 3217 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2025-03-04 06:12:08,595 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 8595 mSDsluCounter, 10529 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8667 SdHoareTripleChecker+Valid, 11617 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:12:08,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8667 Valid, 11617 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 06:12:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7271 states. [2025-03-04 06:12:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7271 to 7269. [2025-03-04 06:12:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7269 states, 7136 states have (on average 1.3553811659192825) internal successors, (9672), 7145 states have internal predecessors, (9672), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-04 06:12:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 9921 transitions. [2025-03-04 06:12:08,702 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 9921 transitions. Word has length 1624 [2025-03-04 06:12:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:12:08,703 INFO L471 AbstractCegarLoop]: Abstraction has 7269 states and 9921 transitions. [2025-03-04 06:12:08,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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-03-04 06:12:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 9921 transitions. [2025-03-04 06:12:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3275 [2025-03-04 06:12:08,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:12:08,750 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-04 06:12:08,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:12:08,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:12:08,952 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:12:08,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:12:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1770192876, now seen corresponding path program 2 times [2025-03-04 06:12:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:12:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710718777] [2025-03-04 06:12:08,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:12:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:12:09,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3274 statements into 2 equivalence classes. [2025-03-04 06:12:09,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 3274 statements. [2025-03-04 06:12:09,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:12:09,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:12:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 42713 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42713 trivial. 0 not checked. [2025-03-04 06:12:09,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:12:09,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710718777] [2025-03-04 06:12:09,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710718777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:12:09,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:12:09,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 06:12:09,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759175496] [2025-03-04 06:12:09,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:12:09,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:12:09,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:12:09,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:12:09,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:12:09,995 INFO L87 Difference]: Start difference. First operand 7269 states and 9921 transitions. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 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-03-04 06:12:14,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:12:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:12:15,118 INFO L93 Difference]: Finished difference Result 8135 states and 11206 transitions. [2025-03-04 06:12:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:12:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 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 3274 [2025-03-04 06:12:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:12:15,137 INFO L225 Difference]: With dead ends: 8135 [2025-03-04 06:12:15,137 INFO L226 Difference]: Without dead ends: 7314 [2025-03-04 06:12:15,140 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-03-04 06:12:15,141 INFO L435 NwaCegarLoop]: 1148 mSDtfsCounter, 85 mSDsluCounter, 9949 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 11097 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:12:15,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 11097 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1772 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-04 06:12:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7314 states. [2025-03-04 06:12:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7314 to 7275. [2025-03-04 06:12:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7275 states, 7142 states have (on average 1.3553626435172221) internal successors, (9680), 7151 states have internal predecessors, (9680), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-04 06:12:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7275 states to 7275 states and 9929 transitions. [2025-03-04 06:12:15,249 INFO L78 Accepts]: Start accepts. Automaton has 7275 states and 9929 transitions. Word has length 3274 [2025-03-04 06:12:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:12:15,251 INFO L471 AbstractCegarLoop]: Abstraction has 7275 states and 9929 transitions. [2025-03-04 06:12:15,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 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-03-04 06:12:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7275 states and 9929 transitions. [2025-03-04 06:12:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3276 [2025-03-04 06:12:15,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:12:15,299 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-03-04 06:12:15,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:12:15,300 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:12:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:12:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash -313786262, now seen corresponding path program 1 times [2025-03-04 06:12:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:12:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898598884] [2025-03-04 06:12:15,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:12:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:12:16,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3275 statements into 1 equivalence classes. [2025-03-04 06:12:17,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3275 of 3275 statements. [2025-03-04 06:12:17,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:12:17,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat