./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.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 b230d83c95de2b0a2d65b5c62bdacb0eaf62e204b83623e9d22dd193a3762a9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:52:46,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:52:46,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:52:46,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:52:46,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:52:46,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:52:46,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:52:46,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:52:46,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:52:46,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:52:46,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:52:46,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:52:46,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:52:46,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:52:46,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:52:46,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:52:46,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:52:46,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:52:46,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:52:46,283 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 -> b230d83c95de2b0a2d65b5c62bdacb0eaf62e204b83623e9d22dd193a3762a9e [2025-03-04 01:52:46,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:52:46,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:52:46,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:52:46,505 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:52:46,506 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:52:46,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i [2025-03-04 01:52:47,621 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8ef3c22/b127d309027b4a339b96df34301789b3/FLAGd52ddaa3e [2025-03-04 01:52:47,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:52:47,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i [2025-03-04 01:52:47,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8ef3c22/b127d309027b4a339b96df34301789b3/FLAGd52ddaa3e [2025-03-04 01:52:48,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8ef3c22/b127d309027b4a339b96df34301789b3 [2025-03-04 01:52:48,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:52:48,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:52:48,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:52:48,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:52:48,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:52:48,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb799e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48, skipping insertion in model container [2025-03-04 01:52:48,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:52:48,299 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i[917,930] [2025-03-04 01:52:48,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:52:48,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:52:48,345 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i[917,930] [2025-03-04 01:52:48,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:52:48,390 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:52:48,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48 WrapperNode [2025-03-04 01:52:48,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:52:48,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:52:48,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:52:48,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:52:48,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,434 INFO L138 Inliner]: procedures = 27, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 354 [2025-03-04 01:52:48,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:52:48,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:52:48,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:52:48,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:52:48,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,472 INFO L175 MemorySlicer]: Split 97 memory accesses to 2 slices as follows [2, 95]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-03-04 01:52:48,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:52:48,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:52:48,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:52:48,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:52:48,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (1/1) ... [2025-03-04 01:52:48,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:52:48,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:48,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:52:48,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:52:48,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:52:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:52:48,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:52:48,609 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:52:48,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:52:48,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~mem55#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~ite65#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite78#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem72#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~short79#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~short85#1;havoc property_#t~ite88#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1; [2025-03-04 01:52:48,891 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-03-04 01:52:48,891 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:52:48,900 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:52:48,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:52:48,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:52:48 BoogieIcfgContainer [2025-03-04 01:52:48,900 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:52:48,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:52:48,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:52:48,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:52:48,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:52:48" (1/3) ... [2025-03-04 01:52:48,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2735baae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:52:48, skipping insertion in model container [2025-03-04 01:52:48,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:48" (2/3) ... [2025-03-04 01:52:48,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2735baae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:52:48, skipping insertion in model container [2025-03-04 01:52:48,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:52:48" (3/3) ... [2025-03-04 01:52:48,910 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-59.i [2025-03-04 01:52:48,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:52:48,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-59.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:52:48,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:52:48,973 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;@40beb5c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:52:48,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:52:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:52:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:52:48,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:48,983 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:48,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:48,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:48,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1001844447, now seen corresponding path program 1 times [2025-03-04 01:52:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:48,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305772735] [2025-03-04 01:52:48,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:48,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:52:49,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:52:49,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:49,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:52:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:49,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305772735] [2025-03-04 01:52:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305772735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:52:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66886140] [2025-03-04 01:52:49,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:49,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:52:49,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:49,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:52:49,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:52:49,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:52:49,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:52:49,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:49,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:49,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:52:49,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:52:49,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:52:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66886140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:49,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:52:49,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:52:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149658068] [2025-03-04 01:52:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:49,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:52:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:49,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:52:49,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:52:49,456 INFO L87 Difference]: Start difference. First operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:52:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:49,477 INFO L93 Difference]: Finished difference Result 160 states and 253 transitions. [2025-03-04 01:52:49,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:52:49,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2025-03-04 01:52:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:49,482 INFO L225 Difference]: With dead ends: 160 [2025-03-04 01:52:49,483 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 01:52:49,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:52:49,489 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:49,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:52:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 01:52:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 01:52:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:52:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-03-04 01:52:49,520 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 131 [2025-03-04 01:52:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:49,521 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-03-04 01:52:49,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:52:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2025-03-04 01:52:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:52:49,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:49,525 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:49,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:52:49,726 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,SelfDestructingSolverStorable0 [2025-03-04 01:52:49,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:49,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1358697267, now seen corresponding path program 1 times [2025-03-04 01:52:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:49,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334818706] [2025-03-04 01:52:49,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:49,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:52:49,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:52:49,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:49,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:52:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334818706] [2025-03-04 01:52:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334818706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:50,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:52:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439544751] [2025-03-04 01:52:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:50,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:52:50,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:50,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:52:50,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:52:50,601 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:52:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:50,871 INFO L93 Difference]: Finished difference Result 235 states and 340 transitions. [2025-03-04 01:52:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:52:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-04 01:52:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:50,874 INFO L225 Difference]: With dead ends: 235 [2025-03-04 01:52:50,874 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 01:52:50,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:52:50,875 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 76 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:50,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 235 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:52:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 01:52:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2025-03-04 01:52:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 109 states have internal predecessors, (142), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:52:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2025-03-04 01:52:50,905 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 131 [2025-03-04 01:52:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:50,906 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2025-03-04 01:52:50,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:52:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2025-03-04 01:52:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:52:50,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:50,907 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:50,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:52:50,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:50,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash -23044141, now seen corresponding path program 1 times [2025-03-04 01:52:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:50,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986956398] [2025-03-04 01:52:50,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:50,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:50,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:52:50,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:52:50,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:50,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:52:53,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:53,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986956398] [2025-03-04 01:52:53,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986956398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:53,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:53,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:52:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815135650] [2025-03-04 01:52:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:53,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:52:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:53,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:52:53,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:52:53,393 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:52:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:53,777 INFO L93 Difference]: Finished difference Result 241 states and 351 transitions. [2025-03-04 01:52:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:52:53,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 133 [2025-03-04 01:52:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:53,779 INFO L225 Difference]: With dead ends: 241 [2025-03-04 01:52:53,779 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 01:52:53,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:52:53,782 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 52 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:53,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 317 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:52:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 01:52:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 01:52:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 109 states have internal predecessors, (141), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:52:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 213 transitions. [2025-03-04 01:52:53,811 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 213 transitions. Word has length 133 [2025-03-04 01:52:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:53,812 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 213 transitions. [2025-03-04 01:52:53,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:52:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2025-03-04 01:52:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:52:53,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:53,815 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:53,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:52:53,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -316447148, now seen corresponding path program 1 times [2025-03-04 01:52:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617695915] [2025-03-04 01:52:53,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:53,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:52:53,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:52:53,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:53,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:52:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617695915] [2025-03-04 01:52:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617695915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:54,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:54,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:52:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337034597] [2025-03-04 01:52:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:54,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:52:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:54,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:52:54,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:52:54,808 INFO L87 Difference]: Start difference. First operand 148 states and 213 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:52:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:55,016 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2025-03-04 01:52:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:52:55,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 133 [2025-03-04 01:52:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:55,019 INFO L225 Difference]: With dead ends: 315 [2025-03-04 01:52:55,020 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 01:52:55,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:52:55,022 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 70 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:55,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 344 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:52:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 01:52:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2025-03-04 01:52:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 165 states have (on average 1.2969696969696969) internal successors, (214), 165 states have internal predecessors, (214), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:52:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 322 transitions. [2025-03-04 01:52:55,054 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 322 transitions. Word has length 133 [2025-03-04 01:52:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:55,054 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 322 transitions. [2025-03-04 01:52:55,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:52:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 322 transitions. [2025-03-04 01:52:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:52:55,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:55,056 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:55,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:52:55,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:55,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:55,057 INFO L85 PathProgramCache]: Analyzing trace with hash -512960653, now seen corresponding path program 1 times [2025-03-04 01:52:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:55,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031982212] [2025-03-04 01:52:55,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:55,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:52:55,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:52:55,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:55,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:52:56,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031982212] [2025-03-04 01:52:56,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031982212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:56,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:56,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:52:56,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41136832] [2025-03-04 01:52:56,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:56,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:52:56,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:56,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:52:56,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:52:56,523 INFO L87 Difference]: Start difference. First operand 223 states and 322 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:52:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:56,946 INFO L93 Difference]: Finished difference Result 452 states and 654 transitions. [2025-03-04 01:52:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:52:56,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 133 [2025-03-04 01:52:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:56,950 INFO L225 Difference]: With dead ends: 452 [2025-03-04 01:52:56,950 INFO L226 Difference]: Without dead ends: 294 [2025-03-04 01:52:56,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:52:56,951 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 243 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:56,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 283 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:52:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-04 01:52:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 238. [2025-03-04 01:52:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 180 states have (on average 1.2944444444444445) internal successors, (233), 180 states have internal predecessors, (233), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:52:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 341 transitions. [2025-03-04 01:52:56,992 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 341 transitions. Word has length 133 [2025-03-04 01:52:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:56,992 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 341 transitions. [2025-03-04 01:52:56,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 01:52:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 341 transitions. [2025-03-04 01:52:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:52:56,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:56,994 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:52:56,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1974552180, now seen corresponding path program 1 times [2025-03-04 01:52:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531248811] [2025-03-04 01:52:56,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:57,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:52:57,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:52:57,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:57,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:52:57,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531248811] [2025-03-04 01:52:57,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531248811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:57,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:57,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:52:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988269888] [2025-03-04 01:52:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:57,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:52:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:57,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:52:57,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:52:57,191 INFO L87 Difference]: Start difference. First operand 238 states and 341 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:52:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:57,410 INFO L93 Difference]: Finished difference Result 461 states and 663 transitions. [2025-03-04 01:52:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:52:57,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-04 01:52:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:57,414 INFO L225 Difference]: With dead ends: 461 [2025-03-04 01:52:57,414 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 01:52:57,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:52:57,415 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 74 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:57,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 294 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:52:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 01:52:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2025-03-04 01:52:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 192 states have (on average 1.296875) internal successors, (249), 192 states have internal predecessors, (249), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:52:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 357 transitions. [2025-03-04 01:52:57,448 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 357 transitions. Word has length 133 [2025-03-04 01:52:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:57,448 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 357 transitions. [2025-03-04 01:52:57,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:52:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 357 transitions. [2025-03-04 01:52:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:52:57,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:57,450 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:57,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:52:57,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:57,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -383877934, now seen corresponding path program 1 times [2025-03-04 01:52:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882834410] [2025-03-04 01:52:57,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:57,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:52:57,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:52:57,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:57,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:52:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882834410] [2025-03-04 01:52:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882834410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:52:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756459393] [2025-03-04 01:52:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:57,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:52:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:57,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:52:57,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:52:57,625 INFO L87 Difference]: Start difference. First operand 250 states and 357 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:52:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:57,820 INFO L93 Difference]: Finished difference Result 472 states and 676 transitions. [2025-03-04 01:52:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:52:57,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-04 01:52:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:57,822 INFO L225 Difference]: With dead ends: 472 [2025-03-04 01:52:57,822 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 01:52:57,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:52:57,823 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:57,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 294 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:52:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 01:52:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 246. [2025-03-04 01:52:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 188 states have (on average 1.2925531914893618) internal successors, (243), 188 states have internal predecessors, (243), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:52:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 351 transitions. [2025-03-04 01:52:57,856 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 351 transitions. Word has length 133 [2025-03-04 01:52:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:57,857 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 351 transitions. [2025-03-04 01:52:57,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:52:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 351 transitions. [2025-03-04 01:52:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:52:57,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:57,859 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:57,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:52:57,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:57,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:57,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1758757331, now seen corresponding path program 1 times [2025-03-04 01:52:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:57,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486818088] [2025-03-04 01:52:57,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:57,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:57,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:52:57,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:52:57,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:57,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:52:58,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:58,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486818088] [2025-03-04 01:52:58,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486818088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:58,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:58,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:52:58,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512529716] [2025-03-04 01:52:58,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:58,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:52:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:58,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:52:58,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:52:58,232 INFO L87 Difference]: Start difference. First operand 246 states and 351 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:52:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:58,528 INFO L93 Difference]: Finished difference Result 524 states and 747 transitions. [2025-03-04 01:52:58,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:52:58,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2025-03-04 01:52:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:58,531 INFO L225 Difference]: With dead ends: 524 [2025-03-04 01:52:58,532 INFO L226 Difference]: Without dead ends: 349 [2025-03-04 01:52:58,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:52:58,533 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 107 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:58,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 477 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:52:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-04 01:52:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 302. [2025-03-04 01:52:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 244 states have (on average 1.3032786885245902) internal successors, (318), 244 states have internal predecessors, (318), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:52:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 426 transitions. [2025-03-04 01:52:58,565 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 426 transitions. Word has length 135 [2025-03-04 01:52:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:58,566 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 426 transitions. [2025-03-04 01:52:58,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:52:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 426 transitions. [2025-03-04 01:52:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:52:58,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:58,568 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:58,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:52:58,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:58,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:58,569 INFO L85 PathProgramCache]: Analyzing trace with hash 23834304, now seen corresponding path program 1 times [2025-03-04 01:52:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:58,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492778605] [2025-03-04 01:52:58,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:58,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:52:58,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:52:58,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:58,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:52:58,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030747351] [2025-03-04 01:52:58,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:58,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:52:58,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:58,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:52:58,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:52:58,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:52:58,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:52:58,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:58,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:58,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 01:52:58,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:58,844 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 43 treesize of output 42 [2025-03-04 01:52:59,148 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 112 treesize of output 83 [2025-03-04 01:52:59,692 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 98 treesize of output 73 [2025-03-04 01:53:00,227 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 98 treesize of output 73 [2025-03-04 01:53:00,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2025-03-04 01:53:01,162 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 98 treesize of output 73 [2025-03-04 01:53:01,591 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 98 treesize of output 73 [2025-03-04 01:53:02,025 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 98 treesize of output 73 [2025-03-04 01:53:02,458 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 98 treesize of output 73 [2025-03-04 01:53:02,891 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 98 treesize of output 73 [2025-03-04 01:53:03,597 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 112 treesize of output 83 [2025-03-04 01:53:03,800 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 128 treesize of output 91 [2025-03-04 01:53:04,240 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 296 treesize of output 226 [2025-03-04 01:53:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-04 01:53:04,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:53:50,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:50,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492778605] [2025-03-04 01:53:50,117 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:53:50,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030747351] [2025-03-04 01:53:50,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030747351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:53:50,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:53:50,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 01:53:50,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636730239] [2025-03-04 01:53:50,117 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:53:50,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:53:50,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:50,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:53:50,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2025-03-04 01:53:50,119 INFO L87 Difference]: Start difference. First operand 302 states and 426 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:53:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:52,487 INFO L93 Difference]: Finished difference Result 547 states and 775 transitions. [2025-03-04 01:53:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:53:52,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-04 01:53:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:52,489 INFO L225 Difference]: With dead ends: 547 [2025-03-04 01:53:52,489 INFO L226 Difference]: Without dead ends: 321 [2025-03-04 01:53:52,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 138 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=80, Invalid=292, Unknown=8, NotChecked=0, Total=380 [2025-03-04 01:53:52,490 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 44 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:52,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 440 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 01:53:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-04 01:53:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 302. [2025-03-04 01:53:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 244 states have (on average 1.2991803278688525) internal successors, (317), 244 states have internal predecessors, (317), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:53:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2025-03-04 01:53:52,529 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 136 [2025-03-04 01:53:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:52,529 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2025-03-04 01:53:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:53:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2025-03-04 01:53:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:53:52,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:52,531 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:52,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:53:52,735 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,SelfDestructingSolverStorable8 [2025-03-04 01:53:52,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:52,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash 14321359, now seen corresponding path program 1 times [2025-03-04 01:53:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812613778] [2025-03-04 01:53:52,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:52,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:53:52,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:53:52,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:52,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:53:52,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809982718] [2025-03-04 01:53:52,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:53:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:53:52,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:53:52,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:53:52,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:53:53,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:53:53,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:53,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:53,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 01:53:53,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:53:53,052 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 43 treesize of output 42 [2025-03-04 01:53:53,327 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 112 treesize of output 83 [2025-03-04 01:53:53,834 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 98 treesize of output 73 [2025-03-04 01:53:54,420 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 98 treesize of output 73 [2025-03-04 01:53:54,908 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 98 treesize of output 73 [2025-03-04 01:53:55,413 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 98 treesize of output 73 [2025-03-04 01:53:55,886 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 98 treesize of output 73 [2025-03-04 01:53:56,415 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 98 treesize of output 73 [2025-03-04 01:53:56,899 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 98 treesize of output 73 [2025-03-04 01:53:57,413 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 98 treesize of output 73 [2025-03-04 01:53:58,105 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 112 treesize of output 83 [2025-03-04 01:53:58,307 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 128 treesize of output 91 [2025-03-04 01:53:58,718 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 292 treesize of output 222 [2025-03-04 01:53:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-04 01:53:58,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:54:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:54:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812613778] [2025-03-04 01:54:12,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:54:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809982718] [2025-03-04 01:54:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809982718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:54:12,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:54:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 01:54:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203086973] [2025-03-04 01:54:12,622 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:54:12,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:54:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:54:12,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:54:12,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=164, Unknown=3, NotChecked=0, Total=210 [2025-03-04 01:54:12,623 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:54:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:14,751 INFO L93 Difference]: Finished difference Result 544 states and 770 transitions. [2025-03-04 01:54:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:54:14,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-03-04 01:54:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:14,753 INFO L225 Difference]: With dead ends: 544 [2025-03-04 01:54:14,753 INFO L226 Difference]: Without dead ends: 316 [2025-03-04 01:54:14,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 142 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=67, Invalid=236, Unknown=3, NotChecked=0, Total=306 [2025-03-04 01:54:14,754 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 41 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:14,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 374 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:54:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-04 01:54:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 302. [2025-03-04 01:54:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 244 states have (on average 1.2950819672131149) internal successors, (316), 244 states have internal predecessors, (316), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:54:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 424 transitions. [2025-03-04 01:54:14,785 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 424 transitions. Word has length 137 [2025-03-04 01:54:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:14,786 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 424 transitions. [2025-03-04 01:54:14,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:54:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 424 transitions. [2025-03-04 01:54:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:54:14,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:14,787 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:14,794 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-04 01:54:14,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:54:14,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:14,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:14,991 INFO L85 PathProgramCache]: Analyzing trace with hash -607068510, now seen corresponding path program 1 times [2025-03-04 01:54:14,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:54:14,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645642315] [2025-03-04 01:54:14,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:54:15,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:54:15,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:54:15,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:15,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:54:17,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:54:17,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645642315] [2025-03-04 01:54:17,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645642315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:17,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:17,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:54:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177381090] [2025-03-04 01:54:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:17,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:54:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:54:17,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:54:17,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:54:17,717 INFO L87 Difference]: Start difference. First operand 302 states and 424 transitions. Second operand has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:54:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:18,926 INFO L93 Difference]: Finished difference Result 651 states and 914 transitions. [2025-03-04 01:54:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:54:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 138 [2025-03-04 01:54:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:18,928 INFO L225 Difference]: With dead ends: 651 [2025-03-04 01:54:18,928 INFO L226 Difference]: Without dead ends: 432 [2025-03-04 01:54:18,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:54:18,929 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 243 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:18,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 618 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:54:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-04 01:54:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 428. [2025-03-04 01:54:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.3) internal successors, (468), 362 states have internal predecessors, (468), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:54:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 592 transitions. [2025-03-04 01:54:18,969 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 592 transitions. Word has length 138 [2025-03-04 01:54:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:18,969 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 592 transitions. [2025-03-04 01:54:18,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-04 01:54:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 592 transitions. [2025-03-04 01:54:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:54:18,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:18,970 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:18,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:54:18,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:18,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1880444323, now seen corresponding path program 1 times [2025-03-04 01:54:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:54:18,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109478882] [2025-03-04 01:54:18,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:18,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:54:18,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:54:18,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:54:18,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:18,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:54:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:54:19,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:54:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109478882] [2025-03-04 01:54:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109478882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:54:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:54:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:54:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302508159] [2025-03-04 01:54:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:54:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:54:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:54:19,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:54:19,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:54:19,647 INFO L87 Difference]: Start difference. First operand 428 states and 592 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:54:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:54:20,085 INFO L93 Difference]: Finished difference Result 755 states and 1055 transitions. [2025-03-04 01:54:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:54:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 138 [2025-03-04 01:54:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:54:20,088 INFO L225 Difference]: With dead ends: 755 [2025-03-04 01:54:20,088 INFO L226 Difference]: Without dead ends: 424 [2025-03-04 01:54:20,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:54:20,090 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 198 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:54:20,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 271 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:54:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-04 01:54:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2025-03-04 01:54:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 354 states have (on average 1.2937853107344632) internal successors, (458), 356 states have internal predecessors, (458), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:54:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 582 transitions. [2025-03-04 01:54:20,139 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 582 transitions. Word has length 138 [2025-03-04 01:54:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:54:20,139 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 582 transitions. [2025-03-04 01:54:20,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 01:54:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 582 transitions. [2025-03-04 01:54:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:54:20,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:54:20,142 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:54:20,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:54:20,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:54:20,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:54:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1451540381, now seen corresponding path program 1 times [2025-03-04 01:54:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:54:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023990788] [2025-03-04 01:54:20,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:54:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:54:20,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:54:20,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:54:20,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:54:20,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat