./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 10:30:26,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:30:26,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:30:26,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:30:26,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:30:26,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:30:26,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:30:26,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:30:26,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:30:26,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:30:26,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:30:26,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:30:26,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:30:26,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:30:26,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:30:26,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:30:26,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:30:26,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:30:26,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:30:26,894 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-17 10:30:27,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:30:27,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:30:27,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:30:27,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:30:27,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:30:27,134 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-17 10:30:28,230 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6db179f2/54a8ba89c38d4e2e93704021be54add1/FLAGf99dd58a9 [2025-03-17 10:30:28,596 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:30:28,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2025-03-17 10:30:28,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6db179f2/54a8ba89c38d4e2e93704021be54add1/FLAGf99dd58a9 [2025-03-17 10:30:28,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6db179f2/54a8ba89c38d4e2e93704021be54add1 [2025-03-17 10:30:28,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:30:28,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:30:28,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:30:28,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:30:28,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:30:28,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:30:28" (1/1) ... [2025-03-17 10:30:28,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f1e748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:28, skipping insertion in model container [2025-03-17 10:30:28,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:30:28" (1/1) ... [2025-03-17 10:30:28,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:30:28,952 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-17 10:30:29,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:30:29,114 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:30:29,138 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-17 10:30:29,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:30:29,287 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:30:29,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29 WrapperNode [2025-03-17 10:30:29,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:30:29,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:30:29,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:30:29,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:30:29,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,442 INFO L138 Inliner]: procedures = 177, calls = 506, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3305 [2025-03-17 10:30:29,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:30:29,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:30:29,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:30:29,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:30:29,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,596 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 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, 82, 4]. [2025-03-17 10:30:29,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:30:29,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:30:29,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:30:29,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:30:29,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (1/1) ... [2025-03-17 10:30:29,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:30:29,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:29,734 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-17 10:30:29,736 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-17 10:30:29,756 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-17 10:30:29,756 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-17 10:30:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:30:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:30:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:30:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:30:29,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:30:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:30:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:30:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:30:29,758 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:30:29,758 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:30:29,758 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:30:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:30:29,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:30:29,967 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:30:29,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:30:31,915 INFO L1322 $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-17 10:30:32,109 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2025-03-17 10:30:32,110 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:30:32,194 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:30:32,198 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 10:30:32,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:30:32 BoogieIcfgContainer [2025-03-17 10:30:32,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:30:32,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:30:32,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:30:32,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:30:32,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:30:28" (1/3) ... [2025-03-17 10:30:32,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16baa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:30:32, skipping insertion in model container [2025-03-17 10:30:32,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:29" (2/3) ... [2025-03-17 10:30:32,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16baa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:30:32, skipping insertion in model container [2025-03-17 10:30:32,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:30:32" (3/3) ... [2025-03-17 10:30:32,207 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-1.i [2025-03-17 10:30:32,218 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:30:32,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test10-1.i that has 6 procedures, 1023 locations, 1 initial locations, 78 loop locations, and 1 error locations. [2025-03-17 10:30:32,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:30:32,304 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;@4c1f7db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:30:32,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 10:30:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 1015 states, 996 states have (on average 1.6255020080321285) internal successors, (1619), 1001 states have internal predecessors, (1619), 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-17 10:30:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 10:30:32,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:32,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:32,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:32,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash -836830071, now seen corresponding path program 1 times [2025-03-17 10:30:32,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770124570] [2025-03-17 10:30:32,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:32,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 10:30:32,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 10:30:32,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:32,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:32,489 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-17 10:30:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:32,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770124570] [2025-03-17 10:30:32,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770124570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:32,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:30:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475342492] [2025-03-17 10:30:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:32,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:30:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:32,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:30:32,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:30:32,513 INFO L87 Difference]: Start difference. First operand has 1015 states, 996 states have (on average 1.6255020080321285) internal successors, (1619), 1001 states have internal predecessors, (1619), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:32,728 INFO L93 Difference]: Finished difference Result 2029 states and 3301 transitions. [2025-03-17 10:30:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:30:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 10:30:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:32,748 INFO L225 Difference]: With dead ends: 2029 [2025-03-17 10:30:32,749 INFO L226 Difference]: Without dead ends: 1011 [2025-03-17 10:30:32,758 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-17 10:30:32,760 INFO L435 NwaCegarLoop]: 1380 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, 1380 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-17 10:30:32,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1380 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-17 10:30:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2025-03-17 10:30:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 993 states have (on average 1.4793554884189326) internal successors, (1469), 998 states have internal predecessors, (1469), 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-17 10:30:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1496 transitions. [2025-03-17 10:30:32,843 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1496 transitions. Word has length 12 [2025-03-17 10:30:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:32,843 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1496 transitions. [2025-03-17 10:30:32,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:30:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1496 transitions. [2025-03-17 10:30:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:30:32,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:32,851 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] [2025-03-17 10:30:32,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:30:32,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:32,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash 292999061, now seen corresponding path program 1 times [2025-03-17 10:30:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389302295] [2025-03-17 10:30:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:32,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:30:32,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:30:32,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:32,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:33,255 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-17 10:30:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389302295] [2025-03-17 10:30:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389302295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:30:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500006605] [2025-03-17 10:30:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:33,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:33,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:33,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:33,259 INFO L87 Difference]: Start difference. First operand 1011 states and 1496 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-17 10:30:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:33,694 INFO L93 Difference]: Finished difference Result 2017 states and 2987 transitions. [2025-03-17 10:30:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:30:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 65 [2025-03-17 10:30:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:33,704 INFO L225 Difference]: With dead ends: 2017 [2025-03-17 10:30:33,704 INFO L226 Difference]: Without dead ends: 1391 [2025-03-17 10:30:33,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:30:33,707 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 542 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4050 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-17 10:30:33,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4050 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:30:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-17 10:30:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1013. [2025-03-17 10:30:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 995 states have (on average 1.478391959798995) internal successors, (1471), 1000 states have internal predecessors, (1471), 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-17 10:30:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1498 transitions. [2025-03-17 10:30:33,750 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1498 transitions. Word has length 65 [2025-03-17 10:30:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:33,750 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1498 transitions. [2025-03-17 10:30:33,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-17 10:30:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1498 transitions. [2025-03-17 10:30:33,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 10:30:33,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:33,759 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] [2025-03-17 10:30:33,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:30:33,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:33,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1819764531, now seen corresponding path program 1 times [2025-03-17 10:30:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:33,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843537165] [2025-03-17 10:30:33,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:33,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 10:30:33,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 10:30:33,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:33,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:34,272 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-17 10:30:34,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:34,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843537165] [2025-03-17 10:30:34,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843537165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:34,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:34,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:30:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435492116] [2025-03-17 10:30:34,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:34,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:34,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:34,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:34,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:34,275 INFO L87 Difference]: Start difference. First operand 1013 states and 1498 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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-17 10:30:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:34,631 INFO L93 Difference]: Finished difference Result 2401 states and 3546 transitions. [2025-03-17 10:30:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:30:34,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 140 [2025-03-17 10:30:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:34,637 INFO L225 Difference]: With dead ends: 2401 [2025-03-17 10:30:34,637 INFO L226 Difference]: Without dead ends: 1391 [2025-03-17 10:30:34,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:30:34,642 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 538 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 4067 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:34,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 4067 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:30:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-17 10:30:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1016. [2025-03-17 10:30:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 998 states have (on average 1.4769539078156313) internal successors, (1474), 1003 states have internal predecessors, (1474), 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-17 10:30:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1501 transitions. [2025-03-17 10:30:34,670 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1501 transitions. Word has length 140 [2025-03-17 10:30:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:34,670 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1501 transitions. [2025-03-17 10:30:34,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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-17 10:30:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1501 transitions. [2025-03-17 10:30:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 10:30:34,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:34,676 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] [2025-03-17 10:30:34,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:30:34,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:34,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2111615700, now seen corresponding path program 1 times [2025-03-17 10:30:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:34,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953476540] [2025-03-17 10:30:34,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:34,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 10:30:34,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 10:30:34,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:35,009 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-17 10:30:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953476540] [2025-03-17 10:30:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953476540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:35,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708319200] [2025-03-17 10:30:35,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:35,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:35,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:35,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:35,010 INFO L87 Difference]: Start difference. First operand 1016 states and 1501 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-17 10:30:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:35,274 INFO L93 Difference]: Finished difference Result 1984 states and 2930 transitions. [2025-03-17 10:30:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:30:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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 209 [2025-03-17 10:30:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:35,279 INFO L225 Difference]: With dead ends: 1984 [2025-03-17 10:30:35,279 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 10:30:35,281 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-17 10:30:35,282 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 30 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3833 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-17 10:30:35,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3833 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 10:30:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2025-03-17 10:30:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 956 states have (on average 1.461297071129707) internal successors, (1397), 961 states have internal predecessors, (1397), 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-17 10:30:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1424 transitions. [2025-03-17 10:30:35,305 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1424 transitions. Word has length 209 [2025-03-17 10:30:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:35,306 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1424 transitions. [2025-03-17 10:30:35,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-17 10:30:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1424 transitions. [2025-03-17 10:30:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 10:30:35,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:35,310 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] [2025-03-17 10:30:35,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:30:35,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:35,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash 297384614, now seen corresponding path program 1 times [2025-03-17 10:30:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:35,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38306066] [2025-03-17 10:30:35,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:35,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 10:30:35,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 10:30:35,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:35,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:35,551 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-17 10:30:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:35,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38306066] [2025-03-17 10:30:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38306066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:35,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:35,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:30:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860697047] [2025-03-17 10:30:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:35,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:35,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:35,554 INFO L87 Difference]: Start difference. First operand 974 states and 1424 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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-17 10:30:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:35,838 INFO L93 Difference]: Finished difference Result 2465 states and 3617 transitions. [2025-03-17 10:30:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:35,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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 209 [2025-03-17 10:30:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:35,845 INFO L225 Difference]: With dead ends: 2465 [2025-03-17 10:30:35,845 INFO L226 Difference]: Without dead ends: 1497 [2025-03-17 10:30:35,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:35,847 INFO L435 NwaCegarLoop]: 1300 mSDtfsCounter, 710 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2582 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-17 10:30:35,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2582 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-17 10:30:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1340. [2025-03-17 10:30:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1320 states have (on average 1.4643939393939394) internal successors, (1933), 1325 states have internal predecessors, (1933), 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-17 10:30:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1964 transitions. [2025-03-17 10:30:35,880 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1964 transitions. Word has length 209 [2025-03-17 10:30:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:35,881 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1964 transitions. [2025-03-17 10:30:35,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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-17 10:30:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1964 transitions. [2025-03-17 10:30:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-17 10:30:35,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:35,883 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] [2025-03-17 10:30:35,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:30:35,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:35,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1435000660, now seen corresponding path program 1 times [2025-03-17 10:30:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412868723] [2025-03-17 10:30:35,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:35,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 10:30:35,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 10:30:35,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:35,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:36,239 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-17 10:30:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412868723] [2025-03-17 10:30:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412868723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278544653] [2025-03-17 10:30:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:36,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:36,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:36,243 INFO L87 Difference]: Start difference. First operand 1340 states and 1964 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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-17 10:30:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:36,494 INFO L93 Difference]: Finished difference Result 2549 states and 3742 transitions. [2025-03-17 10:30:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:30:36,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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 224 [2025-03-17 10:30:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:36,502 INFO L225 Difference]: With dead ends: 2549 [2025-03-17 10:30:36,502 INFO L226 Difference]: Without dead ends: 1298 [2025-03-17 10:30:36,505 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-17 10:30:36,505 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 30 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3611 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-17 10:30:36,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3611 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-17 10:30:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2025-03-17 10:30:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1278 states have (on average 1.4522691705790298) internal successors, (1856), 1283 states have internal predecessors, (1856), 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-17 10:30:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1887 transitions. [2025-03-17 10:30:36,537 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1887 transitions. Word has length 224 [2025-03-17 10:30:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:36,539 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1887 transitions. [2025-03-17 10:30:36,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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-17 10:30:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1887 transitions. [2025-03-17 10:30:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-17 10:30:36,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:36,541 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] [2025-03-17 10:30:36,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:30:36,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:36,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1995642149, now seen corresponding path program 1 times [2025-03-17 10:30:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122959613] [2025-03-17 10:30:36,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:36,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 10:30:36,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 10:30:36,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:36,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:36,812 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-17 10:30:36,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:36,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122959613] [2025-03-17 10:30:36,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122959613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:36,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:36,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:30:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100201365] [2025-03-17 10:30:36,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:36,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:36,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:36,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:36,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:36,815 INFO L87 Difference]: Start difference. First operand 1298 states and 1887 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-17 10:30:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:37,050 INFO L93 Difference]: Finished difference Result 3069 states and 4479 transitions. [2025-03-17 10:30:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 224 [2025-03-17 10:30:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:37,059 INFO L225 Difference]: With dead ends: 3069 [2025-03-17 10:30:37,059 INFO L226 Difference]: Without dead ends: 1860 [2025-03-17 10:30:37,062 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-17 10:30:37,063 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 592 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:37,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2434 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-03-17 10:30:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1855. [2025-03-17 10:30:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1829 states have (on average 1.4554401312192455) internal successors, (2662), 1834 states have internal predecessors, (2662), 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-17 10:30:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2705 transitions. [2025-03-17 10:30:37,144 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2705 transitions. Word has length 224 [2025-03-17 10:30:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:37,146 INFO L471 AbstractCegarLoop]: Abstraction has 1855 states and 2705 transitions. [2025-03-17 10:30:37,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-17 10:30:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2705 transitions. [2025-03-17 10:30:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-17 10:30:37,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:37,150 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] [2025-03-17 10:30:37,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:30:37,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2004905512, now seen corresponding path program 1 times [2025-03-17 10:30:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907707825] [2025-03-17 10:30:37,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:37,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-17 10:30:37,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-17 10:30:37,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:37,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:37,485 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-17 10:30:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907707825] [2025-03-17 10:30:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907707825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045645944] [2025-03-17 10:30:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:37,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:37,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:37,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:37,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:37,487 INFO L87 Difference]: Start difference. First operand 1855 states and 2705 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-17 10:30:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:38,029 INFO L93 Difference]: Finished difference Result 3055 states and 4461 transitions. [2025-03-17 10:30:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:30:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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 239 [2025-03-17 10:30:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:38,035 INFO L225 Difference]: With dead ends: 3055 [2025-03-17 10:30:38,035 INFO L226 Difference]: Without dead ends: 1432 [2025-03-17 10:30:38,038 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-17 10:30:38,038 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 2348 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 1435 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-17 10:30:38,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 1435 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:30:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-17 10:30:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2025-03-17 10:30:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1411 states have (on average 1.440822111977321) internal successors, (2033), 1416 states have internal predecessors, (2033), 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-17 10:30:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2066 transitions. [2025-03-17 10:30:38,073 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2066 transitions. Word has length 239 [2025-03-17 10:30:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:38,073 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2066 transitions. [2025-03-17 10:30:38,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-17 10:30:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2066 transitions. [2025-03-17 10:30:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 10:30:38,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:38,076 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] [2025-03-17 10:30:38,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:30:38,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:38,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash -437649782, now seen corresponding path program 1 times [2025-03-17 10:30:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:38,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123765899] [2025-03-17 10:30:38,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:38,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 10:30:38,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 10:30:38,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:38,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:38,344 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-17 10:30:38,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123765899] [2025-03-17 10:30:38,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123765899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:38,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:38,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:30:38,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359960504] [2025-03-17 10:30:38,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:38,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:38,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:38,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:38,347 INFO L87 Difference]: Start difference. First operand 1432 states and 2066 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-17 10:30:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:38,594 INFO L93 Difference]: Finished difference Result 2306 states and 3369 transitions. [2025-03-17 10:30:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:38,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 249 [2025-03-17 10:30:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:38,601 INFO L225 Difference]: With dead ends: 2306 [2025-03-17 10:30:38,601 INFO L226 Difference]: Without dead ends: 1452 [2025-03-17 10:30:38,603 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-17 10:30:38,604 INFO L435 NwaCegarLoop]: 1206 mSDtfsCounter, 8 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2397 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-17 10:30:38,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2397 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2025-03-17 10:30:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2025-03-17 10:30:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1431 states have (on average 1.43466107617051) internal successors, (2053), 1436 states have internal predecessors, (2053), 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-17 10:30:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2086 transitions. [2025-03-17 10:30:38,637 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2086 transitions. Word has length 249 [2025-03-17 10:30:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:38,638 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2086 transitions. [2025-03-17 10:30:38,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-17 10:30:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2086 transitions. [2025-03-17 10:30:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 10:30:38,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:38,642 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] [2025-03-17 10:30:38,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:30:38,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:38,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1737030315, now seen corresponding path program 1 times [2025-03-17 10:30:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296256652] [2025-03-17 10:30:38,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:38,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:38,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 10:30:38,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 10:30:38,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:38,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:38,989 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-17 10:30:38,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:38,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296256652] [2025-03-17 10:30:38,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296256652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:38,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:38,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:38,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383914961] [2025-03-17 10:30:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:38,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:38,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:38,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:38,991 INFO L87 Difference]: Start difference. First operand 1452 states and 2086 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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-17 10:30:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:39,218 INFO L93 Difference]: Finished difference Result 2316 states and 3372 transitions. [2025-03-17 10:30:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:30:39,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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 249 [2025-03-17 10:30:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:39,224 INFO L225 Difference]: With dead ends: 2316 [2025-03-17 10:30:39,225 INFO L226 Difference]: Without dead ends: 1390 [2025-03-17 10:30:39,227 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-17 10:30:39,227 INFO L435 NwaCegarLoop]: 1131 mSDtfsCounter, 32 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3379 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-17 10:30:39,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3379 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-17 10:30:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2025-03-17 10:30:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1369 states have (on average 1.4265887509130752) internal successors, (1953), 1374 states have internal predecessors, (1953), 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-17 10:30:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1986 transitions. [2025-03-17 10:30:39,257 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1986 transitions. Word has length 249 [2025-03-17 10:30:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:39,257 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1986 transitions. [2025-03-17 10:30:39,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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-17 10:30:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1986 transitions. [2025-03-17 10:30:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 10:30:39,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:39,260 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] [2025-03-17 10:30:39,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:30:39,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:39,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 351086596, now seen corresponding path program 1 times [2025-03-17 10:30:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:39,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234304219] [2025-03-17 10:30:39,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:39,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 10:30:39,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 10:30:39,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:39,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:40,057 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-17 10:30:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:40,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234304219] [2025-03-17 10:30:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234304219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:30:40,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117544766] [2025-03-17 10:30:40,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:40,062 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-17 10:30:40,063 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-17 10:30:40,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 10:30:40,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 10:30:40,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:40,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:40,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 10:30:40,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:30:40,895 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-17 10:30:40,910 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-17 10:30:40,922 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-17 10:30:40,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:30:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117544766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:40,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:30:40,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-17 10:30:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079301008] [2025-03-17 10:30:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:40,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:30:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:40,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:30:40,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:30:40,926 INFO L87 Difference]: Start difference. First operand 1390 states and 1986 transitions. Second operand has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 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-17 10:30:45,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:30:49,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 10:30:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:49,612 INFO L93 Difference]: Finished difference Result 2576 states and 3695 transitions. [2025-03-17 10:30:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:30:49,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 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 249 [2025-03-17 10:30:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:49,619 INFO L225 Difference]: With dead ends: 2576 [2025-03-17 10:30:49,619 INFO L226 Difference]: Without dead ends: 1709 [2025-03-17 10:30:49,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 238 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:30:49,621 INFO L435 NwaCegarLoop]: 1092 mSDtfsCounter, 1847 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:49,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1855 Valid, 4597 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 705 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-17 10:30:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-03-17 10:30:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1558. [2025-03-17 10:30:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1527 states have (on average 1.418467583497053) internal successors, (2166), 1536 states have internal predecessors, (2166), 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-17 10:30:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2213 transitions. [2025-03-17 10:30:49,658 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2213 transitions. Word has length 249 [2025-03-17 10:30:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:49,659 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2213 transitions. [2025-03-17 10:30:49,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 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-17 10:30:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2213 transitions. [2025-03-17 10:30:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-17 10:30:49,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:49,663 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] [2025-03-17 10:30:49,674 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-17 10:30:49,863 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-17 10:30:49,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:49,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1067171101, now seen corresponding path program 1 times [2025-03-17 10:30:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:49,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935180662] [2025-03-17 10:30:49,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:49,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-17 10:30:50,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-17 10:30:50,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:50,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:50,977 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-17 10:30:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935180662] [2025-03-17 10:30:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935180662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:30:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532870431] [2025-03-17 10:30:50,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:50,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:50,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:50,981 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-17 10:30:50,983 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-17 10:30:51,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-17 10:30:51,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-17 10:30:51,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:51,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:51,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:30:51,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:30:51,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 10:30:51,907 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-17 10:30:51,917 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-17 10:30:51,928 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-17 10:30:51,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:30:52,198 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-17 10:30:52,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532870431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:30:52,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:30:52,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-03-17 10:30:52,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169445063] [2025-03-17 10:30:52,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:30:52,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:30:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:52,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:30:52,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:30:52,202 INFO L87 Difference]: Start difference. First operand 1558 states and 2213 transitions. Second operand has 12 states, 12 states have (on average 39.416666666666664) internal successors, (473), 12 states have internal predecessors, (473), 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-17 10:30:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:53,039 INFO L93 Difference]: Finished difference Result 3810 states and 5364 transitions. [2025-03-17 10:30:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 10:30:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.416666666666664) internal successors, (473), 12 states have internal predecessors, (473), 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 324 [2025-03-17 10:30:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:53,048 INFO L225 Difference]: With dead ends: 3810 [2025-03-17 10:30:53,048 INFO L226 Difference]: Without dead ends: 2484 [2025-03-17 10:30:53,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 637 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-17 10:30:53,050 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 1902 mSDsluCounter, 5882 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1920 SdHoareTripleChecker+Valid, 7002 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:53,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1920 Valid, 7002 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:30:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2025-03-17 10:30:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2202. [2025-03-17 10:30:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2159 states have (on average 1.3941639647985178) internal successors, (3010), 2168 states have internal predecessors, (3010), 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-17 10:30:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 3079 transitions. [2025-03-17 10:30:53,107 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 3079 transitions. Word has length 324 [2025-03-17 10:30:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:53,109 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 3079 transitions. [2025-03-17 10:30:53,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.416666666666664) internal successors, (473), 12 states have internal predecessors, (473), 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-17 10:30:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 3079 transitions. [2025-03-17 10:30:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-03-17 10:30:53,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:53,119 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] [2025-03-17 10:30:53,131 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-17 10:30:53,319 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-17 10:30:53,320 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:53,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -905881515, now seen corresponding path program 1 times [2025-03-17 10:30:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420649754] [2025-03-17 10:30:53,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:53,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-17 10:30:53,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-17 10:30:53,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:53,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:57,889 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-17 10:30:57,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:57,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420649754] [2025-03-17 10:30:57,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420649754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:30:57,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67152544] [2025-03-17 10:30:57,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:57,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:57,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:57,892 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-17 10:30:57,894 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-17 10:30:58,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-17 10:30:58,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-17 10:30:58,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:58,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:58,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 3726 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 10:30:58,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:30:58,936 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-17 10:30:59,232 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-17 10:30:59,397 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-17 10:30:59,561 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-17 10:30:59,716 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-17 10:30:59,723 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-17 10:30:59,728 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-17 10:30:59,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:31:00,435 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-17 10:31:00,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67152544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:31:00,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:31:00,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2025-03-17 10:31:00,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258869817] [2025-03-17 10:31:00,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:31:00,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 10:31:00,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:00,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 10:31:00,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-17 10:31:00,441 INFO L87 Difference]: Start difference. First operand 2202 states and 3079 transitions. Second operand has 21 states, 21 states have (on average 63.95238095238095) internal successors, (1343), 21 states have internal predecessors, (1343), 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-17 10:31:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:01,882 INFO L93 Difference]: Finished difference Result 5532 states and 7695 transitions. [2025-03-17 10:31:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 10:31:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 63.95238095238095) internal successors, (1343), 21 states have internal predecessors, (1343), 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 756 [2025-03-17 10:31:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:01,896 INFO L225 Difference]: With dead ends: 5532 [2025-03-17 10:31:01,896 INFO L226 Difference]: Without dead ends: 4206 [2025-03-17 10:31:01,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1536 GetRequests, 1500 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-17 10:31:01,900 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 4989 mSDsluCounter, 10754 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5031 SdHoareTripleChecker+Valid, 11874 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:31:01,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5031 Valid, 11874 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 10:31:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4206 states. [2025-03-17 10:31:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4206 to 3924. [2025-03-17 10:31:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3857 states have (on average 1.3715322789732953) internal successors, (5290), 3866 states have internal predecessors, (5290), 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-17 10:31:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5407 transitions. [2025-03-17 10:31:01,984 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5407 transitions. Word has length 756 [2025-03-17 10:31:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:01,984 INFO L471 AbstractCegarLoop]: Abstraction has 3924 states and 5407 transitions. [2025-03-17 10:31:01,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 63.95238095238095) internal successors, (1343), 21 states have internal predecessors, (1343), 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-17 10:31:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5407 transitions. [2025-03-17 10:31:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1621 [2025-03-17 10:31:02,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:02,040 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] [2025-03-17 10:31:02,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 10:31:02,244 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-17 10:31:02,244 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:02,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 678174405, now seen corresponding path program 2 times [2025-03-17 10:31:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347703080] [2025-03-17 10:31:02,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:31:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:02,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1620 statements into 2 equivalence classes. [2025-03-17 10:31:02,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 1620 statements. [2025-03-17 10:31:02,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:31:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:02,809 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-17 10:31:02,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:02,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347703080] [2025-03-17 10:31:02,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347703080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:31:02,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:31:02,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:31:02,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028582263] [2025-03-17 10:31:02,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:31:02,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:31:02,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:02,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:31:02,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:31:02,813 INFO L87 Difference]: Start difference. First operand 3924 states and 5407 transitions. Second operand has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 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-17 10:31:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:03,729 INFO L93 Difference]: Finished difference Result 4781 states and 6684 transitions. [2025-03-17 10:31:03,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:31:03,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 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 1620 [2025-03-17 10:31:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:03,754 INFO L225 Difference]: With dead ends: 4781 [2025-03-17 10:31:03,755 INFO L226 Difference]: Without dead ends: 3935 [2025-03-17 10:31:03,757 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-17 10:31:03,761 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 53 mSDsluCounter, 4313 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 10:31:03,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 5450 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 10:31:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2025-03-17 10:31:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 3931. [2025-03-17 10:31:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3864 states have (on average 1.3708592132505175) internal successors, (5297), 3873 states have internal predecessors, (5297), 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-17 10:31:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 5414 transitions. [2025-03-17 10:31:03,847 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 5414 transitions. Word has length 1620 [2025-03-17 10:31:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:03,850 INFO L471 AbstractCegarLoop]: Abstraction has 3931 states and 5414 transitions. [2025-03-17 10:31:03,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.5) internal successors, (236), 8 states have internal predecessors, (236), 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-17 10:31:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5414 transitions. [2025-03-17 10:31:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-17 10:31:03,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:03,868 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-17 10:31:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:31:03,868 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash 72996425, now seen corresponding path program 1 times [2025-03-17 10:31:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458639375] [2025-03-17 10:31:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:04,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1621 statements into 1 equivalence classes. [2025-03-17 10:31:05,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1621 of 1621 statements. [2025-03-17 10:31:05,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:05,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:08,661 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-17 10:31:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458639375] [2025-03-17 10:31:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458639375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:31:08,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:31:08,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:31:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697066953] [2025-03-17 10:31:08,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:31:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:31:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:08,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:31:08,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:31:08,664 INFO L87 Difference]: Start difference. First operand 3931 states and 5414 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 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-17 10:31:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:09,172 INFO L93 Difference]: Finished difference Result 4781 states and 6679 transitions. [2025-03-17 10:31:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:31:09,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 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-17 10:31:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:09,184 INFO L225 Difference]: With dead ends: 4781 [2025-03-17 10:31:09,184 INFO L226 Difference]: Without dead ends: 3936 [2025-03-17 10:31:09,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:31:09,188 INFO L435 NwaCegarLoop]: 1143 mSDtfsCounter, 17 mSDsluCounter, 5349 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6492 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.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:31:09,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6492 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:31:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2025-03-17 10:31:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3935. [2025-03-17 10:31:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3868 states have (on average 1.3707342295760083) internal successors, (5302), 3877 states have internal predecessors, (5302), 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-17 10:31:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 5419 transitions. [2025-03-17 10:31:09,261 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 5419 transitions. Word has length 1621 [2025-03-17 10:31:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:09,263 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 5419 transitions. [2025-03-17 10:31:09,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 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-17 10:31:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 5419 transitions. [2025-03-17 10:31:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-17 10:31:09,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:09,279 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-17 10:31:09,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:31:09,279 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:09,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1642553470, now seen corresponding path program 1 times [2025-03-17 10:31:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:09,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49488097] [2025-03-17 10:31:09,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:09,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1621 statements into 1 equivalence classes. [2025-03-17 10:31:10,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1621 of 1621 statements. [2025-03-17 10:31:10,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:10,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:12,928 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-17 10:31:12,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49488097] [2025-03-17 10:31:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49488097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:31:12,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:31:12,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:31:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637735221] [2025-03-17 10:31:12,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:31:12,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:31:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:12,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:31:12,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:31:12,930 INFO L87 Difference]: Start difference. First operand 3935 states and 5419 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-17 10:31:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:13,346 INFO L93 Difference]: Finished difference Result 4779 states and 6675 transitions. [2025-03-17 10:31:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:31:13,347 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-17 10:31:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:13,356 INFO L225 Difference]: With dead ends: 4779 [2025-03-17 10:31:13,356 INFO L226 Difference]: Without dead ends: 3943 [2025-03-17 10:31:13,358 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-17 10:31:13,358 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 25 mSDsluCounter, 5394 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6531 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-17 10:31:13,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6531 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:31:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2025-03-17 10:31:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3935. [2025-03-17 10:31:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3868 states have (on average 1.3707342295760083) internal successors, (5302), 3877 states have internal predecessors, (5302), 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-17 10:31:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 5419 transitions. [2025-03-17 10:31:13,418 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 5419 transitions. Word has length 1621 [2025-03-17 10:31:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:13,420 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 5419 transitions. [2025-03-17 10:31:13,420 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-17 10:31:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 5419 transitions. [2025-03-17 10:31:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-17 10:31:13,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:13,436 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-17 10:31:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:31:13,436 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:13,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1144876332, now seen corresponding path program 1 times [2025-03-17 10:31:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203474975] [2025-03-17 10:31:13,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:13,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:13,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-17 10:31:14,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-17 10:31:14,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:14,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:17,338 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-17 10:31:17,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:17,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203474975] [2025-03-17 10:31:17,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203474975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:31:17,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:31:17,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:31:17,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832851824] [2025-03-17 10:31:17,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:31:17,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:31:17,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:17,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:31:17,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:31:17,341 INFO L87 Difference]: Start difference. First operand 3935 states and 5419 transitions. Second operand has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 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-17 10:31:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:18,014 INFO L93 Difference]: Finished difference Result 4787 states and 6686 transitions. [2025-03-17 10:31:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:31:18,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 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-17 10:31:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:18,023 INFO L225 Difference]: With dead ends: 4787 [2025-03-17 10:31:18,023 INFO L226 Difference]: Without dead ends: 3946 [2025-03-17 10:31:18,025 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-17 10:31:18,026 INFO L435 NwaCegarLoop]: 1140 mSDtfsCounter, 31 mSDsluCounter, 7610 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8750 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-17 10:31:18,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8750 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:31:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2025-03-17 10:31:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3943. [2025-03-17 10:31:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3876 states have (on average 1.370485036119711) internal successors, (5312), 3885 states have internal predecessors, (5312), 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-17 10:31:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 5429 transitions. [2025-03-17 10:31:18,083 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 5429 transitions. Word has length 1622 [2025-03-17 10:31:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:18,084 INFO L471 AbstractCegarLoop]: Abstraction has 3943 states and 5429 transitions. [2025-03-17 10:31:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 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-17 10:31:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 5429 transitions. [2025-03-17 10:31:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-17 10:31:18,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:18,107 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-17 10:31:18,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:31:18,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:18,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash -291506010, now seen corresponding path program 1 times [2025-03-17 10:31:18,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:18,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865797797] [2025-03-17 10:31:18,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:18,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:18,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-17 10:31:19,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-17 10:31:19,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:19,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:21,821 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-17 10:31:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865797797] [2025-03-17 10:31:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865797797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:31:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:31:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:31:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144371943] [2025-03-17 10:31:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:31:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:31:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:21,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:31:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:31:21,823 INFO L87 Difference]: Start difference. First operand 3943 states and 5429 transitions. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 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-17 10:31:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:22,258 INFO L93 Difference]: Finished difference Result 4793 states and 6694 transitions. [2025-03-17 10:31:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:31:22,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 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-17 10:31:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:22,267 INFO L225 Difference]: With dead ends: 4793 [2025-03-17 10:31:22,267 INFO L226 Difference]: Without dead ends: 3946 [2025-03-17 10:31:22,269 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-17 10:31:22,270 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 12 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5454 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:31:22,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5454 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:31:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2025-03-17 10:31:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3946. [2025-03-17 10:31:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 3879 states have (on average 1.3701985047692704) internal successors, (5315), 3888 states have internal predecessors, (5315), 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-17 10:31:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5432 transitions. [2025-03-17 10:31:22,331 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5432 transitions. Word has length 1623 [2025-03-17 10:31:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:22,332 INFO L471 AbstractCegarLoop]: Abstraction has 3946 states and 5432 transitions. [2025-03-17 10:31:22,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 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-17 10:31:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5432 transitions. [2025-03-17 10:31:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-17 10:31:22,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:22,350 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-17 10:31:22,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:31:22,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:22,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1019107068, now seen corresponding path program 1 times [2025-03-17 10:31:22,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:22,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320724863] [2025-03-17 10:31:22,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:22,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:22,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-17 10:31:23,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-17 10:31:23,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:23,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:28,325 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-17 10:31:28,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320724863] [2025-03-17 10:31:28,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320724863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:31:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365187839] [2025-03-17 10:31:28,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:28,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:31:28,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:31:28,328 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-17 10:31:28,329 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-17 10:31:29,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-17 10:31:30,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-17 10:31:30,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:30,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:30,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 7914 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 10:31:30,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:31:30,416 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-17 10:31:30,684 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-17 10:31:30,831 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-17 10:31:30,961 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-17 10:31:31,080 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-17 10:31:31,205 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-17 10:31:31,339 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-17 10:31:31,466 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-17 10:31:31,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:31:31,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 10:31:31,837 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-17 10:31:31,898 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-17 10:31:31,901 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-17 10:31:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 7214 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:31:31,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:31:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 7214 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 10:31:33,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365187839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:31:33,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:31:33,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 32 [2025-03-17 10:31:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514891469] [2025-03-17 10:31:33,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:31:33,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 10:31:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:33,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 10:31:33,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=636, Unknown=0, NotChecked=0, Total=992 [2025-03-17 10:31:33,264 INFO L87 Difference]: Start difference. First operand 3946 states and 5432 transitions. Second operand has 32 states, 32 states have (on average 103.1875) internal successors, (3302), 32 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-17 10:31:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:35,361 INFO L93 Difference]: Finished difference Result 6814 states and 9423 transitions. [2025-03-17 10:31:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-17 10:31:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 103.1875) internal successors, (3302), 32 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 1623 [2025-03-17 10:31:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:35,375 INFO L225 Difference]: With dead ends: 6814 [2025-03-17 10:31:35,376 INFO L226 Difference]: Without dead ends: 5909 [2025-03-17 10:31:35,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3302 GetRequests, 3218 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 10:31:35,380 INFO L435 NwaCegarLoop]: 1089 mSDtfsCounter, 13752 mSDsluCounter, 12538 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13833 SdHoareTripleChecker+Valid, 13627 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:31:35,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13833 Valid, 13627 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 10:31:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5909 states. [2025-03-17 10:31:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5909 to 5909. [2025-03-17 10:31:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5909 states, 5803 states have (on average 1.3594692400482509) internal successors, (7889), 5812 states have internal predecessors, (7889), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 10:31:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 8084 transitions. [2025-03-17 10:31:35,463 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 8084 transitions. Word has length 1623 [2025-03-17 10:31:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:35,464 INFO L471 AbstractCegarLoop]: Abstraction has 5909 states and 8084 transitions. [2025-03-17 10:31:35,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 103.1875) internal successors, (3302), 32 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-17 10:31:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 8084 transitions. [2025-03-17 10:31:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2599 [2025-03-17 10:31:35,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:35,498 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-17 10:31:35,531 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-17 10:31:35,698 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-17 10:31:35,699 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:35,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1721735269, now seen corresponding path program 2 times [2025-03-17 10:31:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708327872] [2025-03-17 10:31:35,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:31:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:36,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2598 statements into 2 equivalence classes. [2025-03-17 10:31:36,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 2598 statements. [2025-03-17 10:31:36,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:31:36,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-17 10:31:36,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:36,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708327872] [2025-03-17 10:31:36,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708327872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:31:36,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:31:36,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:31:36,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453712440] [2025-03-17 10:31:36,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:31:36,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:31:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:31:36,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:31:36,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:31:36,363 INFO L87 Difference]: Start difference. First operand 5909 states and 8084 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:31:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:31:36,889 INFO L93 Difference]: Finished difference Result 6747 states and 9331 transitions. [2025-03-17 10:31:36,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:31:36,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 2598 [2025-03-17 10:31:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:31:36,902 INFO L225 Difference]: With dead ends: 6747 [2025-03-17 10:31:36,902 INFO L226 Difference]: Without dead ends: 5897 [2025-03-17 10:31:36,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:31:36,905 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 405 mSDsluCounter, 4938 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 6066 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:31:36,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 6066 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:31:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2025-03-17 10:31:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 5894. [2025-03-17 10:31:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 5788 states have (on average 1.3597097442985486) internal successors, (7870), 5797 states have internal predecessors, (7870), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 10:31:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 8065 transitions. [2025-03-17 10:31:36,986 INFO L78 Accepts]: Start accepts. Automaton has 5894 states and 8065 transitions. Word has length 2598 [2025-03-17 10:31:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:31:36,988 INFO L471 AbstractCegarLoop]: Abstraction has 5894 states and 8065 transitions. [2025-03-17 10:31:36,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:31:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5894 states and 8065 transitions. [2025-03-17 10:31:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2025-03-17 10:31:37,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:31:37,020 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-17 10:31:37,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:31:37,020 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:31:37,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:31:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1576687383, now seen corresponding path program 1 times [2025-03-17 10:31:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:31:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243982582] [2025-03-17 10:31:37,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:31:37,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:31:37,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2599 statements into 1 equivalence classes. [2025-03-17 10:31:38,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2599 of 2599 statements. [2025-03-17 10:31:38,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:31:38,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat