./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-a_file-15.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 af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:13:46,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:13:46,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:13:46,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:13:46,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:13:46,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:13:46,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:13:46,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:13:46,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:13:46,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:13:46,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:13:46,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:13:46,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:13:46,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:13:46,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:13:46,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:13:46,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:13:46,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:13:46,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:13:46,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:13:46,305 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 -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2025-03-08 16:13:46,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:13:46,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:13:46,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:13:46,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:13:46,536 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:13:46,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2025-03-08 16:13:47,702 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228d56411/df79a10e533f49bcac9bdae27aadf278/FLAGfb2fdbf5f [2025-03-08 16:13:47,935 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:13:47,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2025-03-08 16:13:47,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228d56411/df79a10e533f49bcac9bdae27aadf278/FLAGfb2fdbf5f [2025-03-08 16:13:48,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228d56411/df79a10e533f49bcac9bdae27aadf278 [2025-03-08 16:13:48,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:13:48,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:13:48,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:13:48,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:13:48,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:13:48,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de66476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48, skipping insertion in model container [2025-03-08 16:13:48,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:13:48,375 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-a_file-15.i[916,929] [2025-03-08 16:13:48,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:13:48,425 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:13:48,431 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-a_file-15.i[916,929] [2025-03-08 16:13:48,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:13:48,464 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:13:48,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48 WrapperNode [2025-03-08 16:13:48,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:13:48,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:13:48,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:13:48,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:13:48,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,504 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2025-03-08 16:13:48,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:13:48,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:13:48,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:13:48,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:13:48,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,535 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2025-03-08 16:13:48,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:13:48,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:13:48,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:13:48,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:13:48,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (1/1) ... [2025-03-08 16:13:48,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:13:48,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:48,594 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-08 16:13:48,597 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-08 16:13:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:13:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:13:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:13:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:13:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:13:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:13:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:13:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:13:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:13:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:13:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:13:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:13:48,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:13:48,727 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:13:48,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:13:49,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short90#1;havoc property_#t~ite101#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite98#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short141#1; [2025-03-08 16:13:49,105 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-08 16:13:49,105 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:13:49,112 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:13:49,113 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:13:49,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:13:49 BoogieIcfgContainer [2025-03-08 16:13:49,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:13:49,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:13:49,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:13:49,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:13:49,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:13:48" (1/3) ... [2025-03-08 16:13:49,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377f9f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:13:49, skipping insertion in model container [2025-03-08 16:13:49,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:13:48" (2/3) ... [2025-03-08 16:13:49,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377f9f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:13:49, skipping insertion in model container [2025-03-08 16:13:49,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:13:49" (3/3) ... [2025-03-08 16:13:49,121 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2025-03-08 16:13:49,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:13:49,132 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-15.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:13:49,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:13:49,179 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;@49610b89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:13:49,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:13:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:13:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 16:13:49,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:49,190 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:49,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:49,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash -270087371, now seen corresponding path program 1 times [2025-03-08 16:13:49,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:49,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974845622] [2025-03-08 16:13:49,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:49,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:13:49,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:13:49,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:49,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 16:13:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974845622] [2025-03-08 16:13:49,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974845622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:13:49,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572540932] [2025-03-08 16:13:49,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:49,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:13:49,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:13:49,432 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-08 16:13:49,433 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-08 16:13:49,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:13:49,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:13:49,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:49,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:49,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:13:49,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:13:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 16:13:49,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:13:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572540932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:13:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:13:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517218259] [2025-03-08 16:13:49,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:49,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:13:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:49,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:13:49,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:13:49,644 INFO L87 Difference]: Start difference. First operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:49,659 INFO L93 Difference]: Finished difference Result 218 states and 335 transitions. [2025-03-08 16:13:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:13:49,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-08 16:13:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:49,667 INFO L225 Difference]: With dead ends: 218 [2025-03-08 16:13:49,667 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 16:13:49,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-08 16:13:49,673 INFO L435 NwaCegarLoop]: 157 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, 157 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-08 16:13:49,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 16:13:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-08 16:13:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:13:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-08 16:13:49,700 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2025-03-08 16:13:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:49,700 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-08 16:13:49,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-08 16:13:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 16:13:49,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:49,703 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:49,710 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-08 16:13:49,904 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-08 16:13:49,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:49,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1200235572, now seen corresponding path program 1 times [2025-03-08 16:13:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:49,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974632538] [2025-03-08 16:13:49,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:49,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:49,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:13:49,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:13:49,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:49,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974632538] [2025-03-08 16:13:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974632538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:50,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:50,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999062762] [2025-03-08 16:13:50,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:50,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:50,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:50,414 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:50,603 INFO L93 Difference]: Finished difference Result 429 states and 623 transitions. [2025-03-08 16:13:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:13:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-08 16:13:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:50,606 INFO L225 Difference]: With dead ends: 429 [2025-03-08 16:13:50,606 INFO L226 Difference]: Without dead ends: 323 [2025-03-08 16:13:50,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:13:50,607 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 252 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:50,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1014 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-08 16:13:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 213. [2025-03-08 16:13:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.403225806451613) internal successors, (261), 186 states have internal predecessors, (261), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:13:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2025-03-08 16:13:50,636 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 115 [2025-03-08 16:13:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:50,637 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2025-03-08 16:13:50,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2025-03-08 16:13:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:13:50,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:50,639 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:50,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:13:50,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:50,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1571966134, now seen corresponding path program 1 times [2025-03-08 16:13:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:50,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020808128] [2025-03-08 16:13:50,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:50,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:13:50,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:13:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020808128] [2025-03-08 16:13:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020808128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:51,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:51,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:13:51,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175385114] [2025-03-08 16:13:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:13:51,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:51,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:13:51,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:51,114 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:51,200 INFO L93 Difference]: Finished difference Result 590 states and 855 transitions. [2025-03-08 16:13:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:13:51,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-08 16:13:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:51,203 INFO L225 Difference]: With dead ends: 590 [2025-03-08 16:13:51,203 INFO L226 Difference]: Without dead ends: 380 [2025-03-08 16:13:51,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:51,204 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 114 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:51,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 751 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-08 16:13:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2025-03-08 16:13:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 331 states have (on average 1.404833836858006) internal successors, (465), 333 states have internal predecessors, (465), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:13:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 545 transitions. [2025-03-08 16:13:51,237 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 545 transitions. Word has length 117 [2025-03-08 16:13:51,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:51,239 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 545 transitions. [2025-03-08 16:13:51,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 545 transitions. [2025-03-08 16:13:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:13:51,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:51,243 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:51,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:13:51,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:51,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash -624343642, now seen corresponding path program 1 times [2025-03-08 16:13:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159212363] [2025-03-08 16:13:51,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:51,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:13:51,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:13:51,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:51,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159212363] [2025-03-08 16:13:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159212363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:51,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:13:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491675988] [2025-03-08 16:13:51,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:51,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:13:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:51,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:13:51,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:13:51,392 INFO L87 Difference]: Start difference. First operand 376 states and 545 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:51,445 INFO L93 Difference]: Finished difference Result 753 states and 1091 transitions. [2025-03-08 16:13:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:13:51,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-08 16:13:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:51,450 INFO L225 Difference]: With dead ends: 753 [2025-03-08 16:13:51,451 INFO L226 Difference]: Without dead ends: 380 [2025-03-08 16:13:51,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:13:51,454 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 106 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:51,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 517 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:13:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-08 16:13:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2025-03-08 16:13:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 331 states have (on average 1.3987915407854985) internal successors, (463), 333 states have internal predecessors, (463), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:13:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 543 transitions. [2025-03-08 16:13:51,484 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 543 transitions. Word has length 117 [2025-03-08 16:13:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:51,485 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 543 transitions. [2025-03-08 16:13:51,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 543 transitions. [2025-03-08 16:13:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:13:51,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:51,487 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:51,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:13:51,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:51,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1857021888, now seen corresponding path program 1 times [2025-03-08 16:13:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:51,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871957637] [2025-03-08 16:13:51,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:51,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:51,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:13:51,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:13:51,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:51,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:51,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:51,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871957637] [2025-03-08 16:13:51,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871957637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:51,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:51,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:51,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294490293] [2025-03-08 16:13:51,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:51,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:51,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:51,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:51,804 INFO L87 Difference]: Start difference. First operand 376 states and 543 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:51,924 INFO L93 Difference]: Finished difference Result 770 states and 1113 transitions. [2025-03-08 16:13:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:13:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-08 16:13:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:51,927 INFO L225 Difference]: With dead ends: 770 [2025-03-08 16:13:51,927 INFO L226 Difference]: Without dead ends: 579 [2025-03-08 16:13:51,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:51,928 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 168 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:51,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 722 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-08 16:13:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 559. [2025-03-08 16:13:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 492 states have (on average 1.4004065040650406) internal successors, (689), 495 states have internal predecessors, (689), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 16:13:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 809 transitions. [2025-03-08 16:13:51,968 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 809 transitions. Word has length 118 [2025-03-08 16:13:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:51,969 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 809 transitions. [2025-03-08 16:13:51,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 809 transitions. [2025-03-08 16:13:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:13:51,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:51,970 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:51,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:13:51,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:51,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1448197663, now seen corresponding path program 1 times [2025-03-08 16:13:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:51,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418411858] [2025-03-08 16:13:51,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:51,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:13:52,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:13:52,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:52,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418411858] [2025-03-08 16:13:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418411858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:52,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:52,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:52,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121326152] [2025-03-08 16:13:52,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:52,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:52,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:52,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:52,347 INFO L87 Difference]: Start difference. First operand 559 states and 809 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:52,467 INFO L93 Difference]: Finished difference Result 1440 states and 2062 transitions. [2025-03-08 16:13:52,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:13:52,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-08 16:13:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:52,471 INFO L225 Difference]: With dead ends: 1440 [2025-03-08 16:13:52,473 INFO L226 Difference]: Without dead ends: 884 [2025-03-08 16:13:52,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:52,475 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 71 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:52,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 723 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-08 16:13:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 872. [2025-03-08 16:13:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 787 states have (on average 1.3913595933926302) internal successors, (1095), 796 states have internal predecessors, (1095), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 63 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 16:13:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1239 transitions. [2025-03-08 16:13:52,530 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1239 transitions. Word has length 118 [2025-03-08 16:13:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:52,530 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1239 transitions. [2025-03-08 16:13:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1239 transitions. [2025-03-08 16:13:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:13:52,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:52,532 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:52,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:13:52,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:52,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 936369783, now seen corresponding path program 1 times [2025-03-08 16:13:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:52,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904231869] [2025-03-08 16:13:52,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:52,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:52,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:13:52,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:13:52,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:52,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904231869] [2025-03-08 16:13:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904231869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:52,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762633902] [2025-03-08 16:13:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:52,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:52,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:52,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:52,743 INFO L87 Difference]: Start difference. First operand 872 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:52,865 INFO L93 Difference]: Finished difference Result 2241 states and 3188 transitions. [2025-03-08 16:13:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-08 16:13:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:52,871 INFO L225 Difference]: With dead ends: 2241 [2025-03-08 16:13:52,871 INFO L226 Difference]: Without dead ends: 1372 [2025-03-08 16:13:52,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:13:52,873 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 146 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:52,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1102 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-03-08 16:13:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2025-03-08 16:13:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1237 states have (on average 1.3880355699272433) internal successors, (1717), 1249 states have internal predecessors, (1717), 114 states have call successors, (114), 18 states have call predecessors, (114), 18 states have return successors, (114), 102 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-08 16:13:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1945 transitions. [2025-03-08 16:13:52,945 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1945 transitions. Word has length 118 [2025-03-08 16:13:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:52,945 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1945 transitions. [2025-03-08 16:13:52,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1945 transitions. [2025-03-08 16:13:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:13:52,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:52,949 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:52,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:13:52,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:52,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash -856794534, now seen corresponding path program 1 times [2025-03-08 16:13:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682310059] [2025-03-08 16:13:52,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:52,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:13:52,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:13:52,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:52,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682310059] [2025-03-08 16:13:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682310059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964025721] [2025-03-08 16:13:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:53,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:53,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:53,249 INFO L87 Difference]: Start difference. First operand 1370 states and 1945 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:53,354 INFO L93 Difference]: Finished difference Result 2332 states and 3283 transitions. [2025-03-08 16:13:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-08 16:13:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:53,360 INFO L225 Difference]: With dead ends: 2332 [2025-03-08 16:13:53,360 INFO L226 Difference]: Without dead ends: 1413 [2025-03-08 16:13:53,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:53,362 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 154 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:53,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 776 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-03-08 16:13:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1033. [2025-03-08 16:13:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 918 states have (on average 1.3867102396514162) internal successors, (1273), 921 states have internal predecessors, (1273), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:13:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1465 transitions. [2025-03-08 16:13:53,411 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1465 transitions. Word has length 118 [2025-03-08 16:13:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:53,411 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1465 transitions. [2025-03-08 16:13:53,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1465 transitions. [2025-03-08 16:13:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:13:53,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:53,413 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:13:53,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1880686781, now seen corresponding path program 1 times [2025-03-08 16:13:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:53,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265843975] [2025-03-08 16:13:53,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:53,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:53,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:13:53,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:13:53,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:53,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265843975] [2025-03-08 16:13:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265843975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:53,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270025788] [2025-03-08 16:13:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:53,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:53,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:53,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:53,673 INFO L87 Difference]: Start difference. First operand 1033 states and 1465 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:53,787 INFO L93 Difference]: Finished difference Result 2441 states and 3426 transitions. [2025-03-08 16:13:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:13:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-08 16:13:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:53,792 INFO L225 Difference]: With dead ends: 2441 [2025-03-08 16:13:53,792 INFO L226 Difference]: Without dead ends: 1411 [2025-03-08 16:13:53,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:53,794 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 77 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:53,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 682 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-03-08 16:13:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1029. [2025-03-08 16:13:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 914 states have (on average 1.3774617067833699) internal successors, (1259), 917 states have internal predecessors, (1259), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:13:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1451 transitions. [2025-03-08 16:13:53,851 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1451 transitions. Word has length 119 [2025-03-08 16:13:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:53,851 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1451 transitions. [2025-03-08 16:13:53,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1451 transitions. [2025-03-08 16:13:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:13:53,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:53,853 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:53,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:13:53,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1257436247, now seen corresponding path program 1 times [2025-03-08 16:13:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833064447] [2025-03-08 16:13:53,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:53,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:13:53,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:13:53,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:53,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:54,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833064447] [2025-03-08 16:13:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833064447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:54,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:54,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:13:54,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349868804] [2025-03-08 16:13:54,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:54,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:13:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:54,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:13:54,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:13:54,111 INFO L87 Difference]: Start difference. First operand 1029 states and 1451 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:54,225 INFO L93 Difference]: Finished difference Result 2125 states and 2985 transitions. [2025-03-08 16:13:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:13:54,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-08 16:13:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:54,230 INFO L225 Difference]: With dead ends: 2125 [2025-03-08 16:13:54,231 INFO L226 Difference]: Without dead ends: 1099 [2025-03-08 16:13:54,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:54,233 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 79 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:54,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 926 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:13:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-08 16:13:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 945. [2025-03-08 16:13:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 830 states have (on average 1.3771084337349397) internal successors, (1143), 833 states have internal predecessors, (1143), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:13:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1335 transitions. [2025-03-08 16:13:54,288 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1335 transitions. Word has length 119 [2025-03-08 16:13:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:54,288 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1335 transitions. [2025-03-08 16:13:54,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1335 transitions. [2025-03-08 16:13:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:13:54,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:54,290 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:54,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:13:54,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:54,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash -436956178, now seen corresponding path program 1 times [2025-03-08 16:13:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573400745] [2025-03-08 16:13:54,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:54,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:13:54,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:13:54,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:54,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573400745] [2025-03-08 16:13:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573400745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:13:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644180394] [2025-03-08 16:13:54,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:54,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:13:54,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:54,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:13:54,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:13:54,645 INFO L87 Difference]: Start difference. First operand 945 states and 1335 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:55,017 INFO L93 Difference]: Finished difference Result 2020 states and 2845 transitions. [2025-03-08 16:13:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:13:55,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-08 16:13:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:55,022 INFO L225 Difference]: With dead ends: 2020 [2025-03-08 16:13:55,022 INFO L226 Difference]: Without dead ends: 1078 [2025-03-08 16:13:55,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:13:55,024 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 267 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:55,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1178 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:13:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-03-08 16:13:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 952. [2025-03-08 16:13:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 837 states have (on average 1.3751493428912784) internal successors, (1151), 840 states have internal predecessors, (1151), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:13:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1343 transitions. [2025-03-08 16:13:55,069 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1343 transitions. Word has length 119 [2025-03-08 16:13:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:55,069 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1343 transitions. [2025-03-08 16:13:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1343 transitions. [2025-03-08 16:13:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 16:13:55,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:55,071 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:55,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:13:55,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:55,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash -691692723, now seen corresponding path program 1 times [2025-03-08 16:13:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:55,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586205956] [2025-03-08 16:13:55,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:55,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 16:13:55,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 16:13:55,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:55,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586205956] [2025-03-08 16:13:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586205956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:55,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:13:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166855665] [2025-03-08 16:13:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:55,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:13:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:55,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:13:55,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:13:55,618 INFO L87 Difference]: Start difference. First operand 952 states and 1343 transitions. Second operand has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 16:13:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:56,131 INFO L93 Difference]: Finished difference Result 2077 states and 2924 transitions. [2025-03-08 16:13:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:13:56,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2025-03-08 16:13:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:56,136 INFO L225 Difference]: With dead ends: 2077 [2025-03-08 16:13:56,137 INFO L226 Difference]: Without dead ends: 1128 [2025-03-08 16:13:56,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:13:56,139 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 211 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:56,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1389 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:13:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-03-08 16:13:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 962. [2025-03-08 16:13:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 847 states have (on average 1.3730814639905549) internal successors, (1163), 850 states have internal predecessors, (1163), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:13:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1355 transitions. [2025-03-08 16:13:56,196 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1355 transitions. Word has length 119 [2025-03-08 16:13:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:56,196 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1355 transitions. [2025-03-08 16:13:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 16:13:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1355 transitions. [2025-03-08 16:13:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:13:56,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:56,197 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:56,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:13:56,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash 384211349, now seen corresponding path program 1 times [2025-03-08 16:13:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40741104] [2025-03-08 16:13:56,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:56,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:13:56,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:13:56,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:56,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:56,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40741104] [2025-03-08 16:13:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40741104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:56,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:13:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509462100] [2025-03-08 16:13:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:56,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:13:56,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:56,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:13:56,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:13:56,466 INFO L87 Difference]: Start difference. First operand 962 states and 1355 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:56,765 INFO L93 Difference]: Finished difference Result 2035 states and 2860 transitions. [2025-03-08 16:13:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:13:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2025-03-08 16:13:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:56,770 INFO L225 Difference]: With dead ends: 2035 [2025-03-08 16:13:56,770 INFO L226 Difference]: Without dead ends: 1076 [2025-03-08 16:13:56,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:13:56,773 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 364 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:56,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 901 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:13:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-03-08 16:13:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 972. [2025-03-08 16:13:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 857 states have (on average 1.3733955659276547) internal successors, (1177), 860 states have internal predecessors, (1177), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:13:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1369 transitions. [2025-03-08 16:13:56,824 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1369 transitions. Word has length 120 [2025-03-08 16:13:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:56,825 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1369 transitions. [2025-03-08 16:13:56,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:13:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1369 transitions. [2025-03-08 16:13:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 16:13:56,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:56,826 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:56,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:13:56,826 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:56,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1077313046, now seen corresponding path program 1 times [2025-03-08 16:13:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:56,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142658464] [2025-03-08 16:13:56,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:56,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 16:13:56,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 16:13:56,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:56,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:57,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:57,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142658464] [2025-03-08 16:13:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142658464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:57,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:13:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195895211] [2025-03-08 16:13:57,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:57,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:13:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:57,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:13:57,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:13:57,427 INFO L87 Difference]: Start difference. First operand 972 states and 1369 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:13:58,346 INFO L93 Difference]: Finished difference Result 2103 states and 2955 transitions. [2025-03-08 16:13:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:13:58,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-08 16:13:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:13:58,352 INFO L225 Difference]: With dead ends: 2103 [2025-03-08 16:13:58,352 INFO L226 Difference]: Without dead ends: 1134 [2025-03-08 16:13:58,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:13:58,354 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 354 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:13:58,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 2427 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:13:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-03-08 16:13:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 962. [2025-03-08 16:13:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 847 states have (on average 1.371900826446281) internal successors, (1162), 850 states have internal predecessors, (1162), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:13:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1354 transitions. [2025-03-08 16:13:58,407 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1354 transitions. Word has length 120 [2025-03-08 16:13:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:13:58,407 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1354 transitions. [2025-03-08 16:13:58,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:13:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1354 transitions. [2025-03-08 16:13:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 16:13:58,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:13:58,409 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:13:58,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:13:58,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:13:58,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:13:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1206848473, now seen corresponding path program 1 times [2025-03-08 16:13:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:13:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321308669] [2025-03-08 16:13:58,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:13:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:13:58,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 16:13:58,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 16:13:58,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:13:58,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:13:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:13:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:13:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321308669] [2025-03-08 16:13:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321308669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:13:59,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:13:59,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:13:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021801012] [2025-03-08 16:13:59,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:13:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:13:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:13:59,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:13:59,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:13:59,430 INFO L87 Difference]: Start difference. First operand 962 states and 1354 transitions. Second operand has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 16:14:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:01,161 INFO L93 Difference]: Finished difference Result 2126 states and 2980 transitions. [2025-03-08 16:14:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:14:01,161 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 121 [2025-03-08 16:14:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:01,166 INFO L225 Difference]: With dead ends: 2126 [2025-03-08 16:14:01,166 INFO L226 Difference]: Without dead ends: 1479 [2025-03-08 16:14:01,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:14:01,169 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 917 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:01,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 3048 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:14:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2025-03-08 16:14:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1004. [2025-03-08 16:14:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 889 states have (on average 1.3689538807649044) internal successors, (1217), 892 states have internal predecessors, (1217), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1409 transitions. [2025-03-08 16:14:01,220 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1409 transitions. Word has length 121 [2025-03-08 16:14:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:01,222 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1409 transitions. [2025-03-08 16:14:01,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 16:14:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1409 transitions. [2025-03-08 16:14:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 16:14:01,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:01,223 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:01,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:14:01,223 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:01,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1175828666, now seen corresponding path program 1 times [2025-03-08 16:14:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876906961] [2025-03-08 16:14:01,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:01,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 16:14:01,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 16:14:01,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:01,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:02,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876906961] [2025-03-08 16:14:02,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876906961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:02,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:02,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:14:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578809471] [2025-03-08 16:14:02,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:02,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:14:02,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:02,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:14:02,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:14:02,062 INFO L87 Difference]: Start difference. First operand 1004 states and 1409 transitions. Second operand has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 16:14:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:03,885 INFO L93 Difference]: Finished difference Result 2178 states and 3046 transitions. [2025-03-08 16:14:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:14:03,886 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 121 [2025-03-08 16:14:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:03,893 INFO L225 Difference]: With dead ends: 2178 [2025-03-08 16:14:03,893 INFO L226 Difference]: Without dead ends: 1489 [2025-03-08 16:14:03,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 16:14:03,896 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 887 mSDsluCounter, 3012 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:03,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 3364 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 16:14:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-03-08 16:14:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 976. [2025-03-08 16:14:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 861 states have (on average 1.3693379790940767) internal successors, (1179), 864 states have internal predecessors, (1179), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1371 transitions. [2025-03-08 16:14:03,948 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1371 transitions. Word has length 121 [2025-03-08 16:14:03,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:03,948 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1371 transitions. [2025-03-08 16:14:03,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 16:14:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1371 transitions. [2025-03-08 16:14:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 16:14:03,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:03,950 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:03,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:14:03,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:03,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1863048527, now seen corresponding path program 1 times [2025-03-08 16:14:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:03,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794554691] [2025-03-08 16:14:03,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:03,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:03,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 16:14:03,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 16:14:03,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:03,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794554691] [2025-03-08 16:14:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794554691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:04,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:04,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:14:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661278768] [2025-03-08 16:14:04,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:04,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:14:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:04,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:14:04,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:04,165 INFO L87 Difference]: Start difference. First operand 976 states and 1371 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:14:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:04,285 INFO L93 Difference]: Finished difference Result 1984 states and 2781 transitions. [2025-03-08 16:14:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:14:04,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2025-03-08 16:14:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:04,289 INFO L225 Difference]: With dead ends: 1984 [2025-03-08 16:14:04,289 INFO L226 Difference]: Without dead ends: 1011 [2025-03-08 16:14:04,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:14:04,292 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 113 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:04,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1393 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-08 16:14:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 995. [2025-03-08 16:14:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 880 states have (on average 1.3602272727272726) internal successors, (1197), 883 states have internal predecessors, (1197), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1389 transitions. [2025-03-08 16:14:04,337 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1389 transitions. Word has length 121 [2025-03-08 16:14:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:04,338 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1389 transitions. [2025-03-08 16:14:04,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:14:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1389 transitions. [2025-03-08 16:14:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 16:14:04,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:04,339 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:04,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:14:04,340 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:04,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -175007762, now seen corresponding path program 1 times [2025-03-08 16:14:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040408279] [2025-03-08 16:14:04,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:04,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 16:14:04,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 16:14:04,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:04,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040408279] [2025-03-08 16:14:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040408279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969937211] [2025-03-08 16:14:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:04,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:04,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:04,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:04,564 INFO L87 Difference]: Start difference. First operand 995 states and 1389 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:04,655 INFO L93 Difference]: Finished difference Result 2093 states and 2922 transitions. [2025-03-08 16:14:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-08 16:14:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:04,659 INFO L225 Difference]: With dead ends: 2093 [2025-03-08 16:14:04,659 INFO L226 Difference]: Without dead ends: 1101 [2025-03-08 16:14:04,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:04,661 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 53 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:04,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 924 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-03-08 16:14:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1008. [2025-03-08 16:14:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 893 states have (on average 1.360582306830907) internal successors, (1215), 896 states have internal predecessors, (1215), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1407 transitions. [2025-03-08 16:14:04,714 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1407 transitions. Word has length 121 [2025-03-08 16:14:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:04,714 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1407 transitions. [2025-03-08 16:14:04,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1407 transitions. [2025-03-08 16:14:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:14:04,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:04,717 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:04,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:14:04,717 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:04,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash 269267994, now seen corresponding path program 1 times [2025-03-08 16:14:04,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:04,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859650797] [2025-03-08 16:14:04,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:04,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:14:04,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:14:04,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:04,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:05,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:05,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859650797] [2025-03-08 16:14:05,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859650797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:05,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:05,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:14:05,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058965474] [2025-03-08 16:14:05,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:05,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:14:05,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:05,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:14:05,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:14:05,292 INFO L87 Difference]: Start difference. First operand 1008 states and 1407 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 16:14:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:06,216 INFO L93 Difference]: Finished difference Result 2099 states and 2923 transitions. [2025-03-08 16:14:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:14:06,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-03-08 16:14:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:06,222 INFO L225 Difference]: With dead ends: 2099 [2025-03-08 16:14:06,222 INFO L226 Difference]: Without dead ends: 1403 [2025-03-08 16:14:06,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:14:06,224 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 458 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:06,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1840 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:14:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-08 16:14:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1028. [2025-03-08 16:14:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 913 states have (on average 1.3581599123767798) internal successors, (1240), 916 states have internal predecessors, (1240), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1432 transitions. [2025-03-08 16:14:06,279 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1432 transitions. Word has length 122 [2025-03-08 16:14:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:06,279 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1432 transitions. [2025-03-08 16:14:06,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 16:14:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1432 transitions. [2025-03-08 16:14:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:14:06,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:06,281 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:06,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:14:06,281 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:06,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1230882011, now seen corresponding path program 1 times [2025-03-08 16:14:06,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:06,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219980911] [2025-03-08 16:14:06,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:06,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:14:06,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:14:06,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:06,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219980911] [2025-03-08 16:14:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219980911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:14:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324909453] [2025-03-08 16:14:07,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:07,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:14:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:07,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:14:07,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:14:07,182 INFO L87 Difference]: Start difference. First operand 1028 states and 1432 transitions. Second operand has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 16:14:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:08,962 INFO L93 Difference]: Finished difference Result 2229 states and 3089 transitions. [2025-03-08 16:14:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:14:08,963 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2025-03-08 16:14:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:08,968 INFO L225 Difference]: With dead ends: 2229 [2025-03-08 16:14:08,968 INFO L226 Difference]: Without dead ends: 1513 [2025-03-08 16:14:08,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 16:14:08,972 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1050 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:08,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 2647 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:14:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-03-08 16:14:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1010. [2025-03-08 16:14:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 895 states have (on average 1.3597765363128491) internal successors, (1217), 898 states have internal predecessors, (1217), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1409 transitions. [2025-03-08 16:14:09,049 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1409 transitions. Word has length 122 [2025-03-08 16:14:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:09,050 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1409 transitions. [2025-03-08 16:14:09,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 16:14:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1409 transitions. [2025-03-08 16:14:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:14:09,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:09,051 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:09,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:14:09,052 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:09,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash -142561680, now seen corresponding path program 1 times [2025-03-08 16:14:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970192867] [2025-03-08 16:14:09,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:09,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:14:09,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:14:09,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:09,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:09,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:09,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970192867] [2025-03-08 16:14:09,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970192867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:09,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:09,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:09,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619129930] [2025-03-08 16:14:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:09,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:09,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:09,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:09,233 INFO L87 Difference]: Start difference. First operand 1010 states and 1409 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:09,339 INFO L93 Difference]: Finished difference Result 2128 states and 2960 transitions. [2025-03-08 16:14:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-08 16:14:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:09,344 INFO L225 Difference]: With dead ends: 2128 [2025-03-08 16:14:09,344 INFO L226 Difference]: Without dead ends: 1121 [2025-03-08 16:14:09,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:09,346 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 116 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:09,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 582 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-08 16:14:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1016. [2025-03-08 16:14:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 901 states have (on average 1.3518312985571588) internal successors, (1218), 904 states have internal predecessors, (1218), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1410 transitions. [2025-03-08 16:14:09,397 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1410 transitions. Word has length 122 [2025-03-08 16:14:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:09,397 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1410 transitions. [2025-03-08 16:14:09,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1410 transitions. [2025-03-08 16:14:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:14:09,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:09,399 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:09,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:14:09,399 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:09,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:09,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1508171605, now seen corresponding path program 1 times [2025-03-08 16:14:09,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:09,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142556220] [2025-03-08 16:14:09,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:09,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:09,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:14:09,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:14:09,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:09,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:09,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:09,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142556220] [2025-03-08 16:14:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142556220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:09,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:09,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:14:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355702588] [2025-03-08 16:14:09,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:14:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:09,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:14:09,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:14:09,780 INFO L87 Difference]: Start difference. First operand 1016 states and 1410 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:14:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:10,140 INFO L93 Difference]: Finished difference Result 2145 states and 2971 transitions. [2025-03-08 16:14:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:14:10,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-03-08 16:14:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:10,150 INFO L225 Difference]: With dead ends: 2145 [2025-03-08 16:14:10,150 INFO L226 Difference]: Without dead ends: 1132 [2025-03-08 16:14:10,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:14:10,154 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 379 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:10,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1736 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-03-08 16:14:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1035. [2025-03-08 16:14:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 920 states have (on average 1.35) internal successors, (1242), 923 states have internal predecessors, (1242), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1434 transitions. [2025-03-08 16:14:10,209 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1434 transitions. Word has length 122 [2025-03-08 16:14:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:10,209 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1434 transitions. [2025-03-08 16:14:10,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:14:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1434 transitions. [2025-03-08 16:14:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:14:10,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:10,210 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:10,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:14:10,210 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:10,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash 989844332, now seen corresponding path program 1 times [2025-03-08 16:14:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481334845] [2025-03-08 16:14:10,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:10,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:10,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:14:10,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:14:10,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:10,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:10,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:10,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481334845] [2025-03-08 16:14:10,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481334845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:10,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:10,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:14:10,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720593320] [2025-03-08 16:14:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:14:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:10,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:14:10,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:10,615 INFO L87 Difference]: Start difference. First operand 1035 states and 1434 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:10,964 INFO L93 Difference]: Finished difference Result 2199 states and 3044 transitions. [2025-03-08 16:14:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:14:10,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-08 16:14:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:10,978 INFO L225 Difference]: With dead ends: 2199 [2025-03-08 16:14:10,978 INFO L226 Difference]: Without dead ends: 1167 [2025-03-08 16:14:10,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:14:10,980 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 438 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:10,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 989 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:14:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-03-08 16:14:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1149. [2025-03-08 16:14:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1010 states have (on average 1.3485148514851486) internal successors, (1362), 1015 states have internal predecessors, (1362), 116 states have call successors, (116), 22 states have call predecessors, (116), 22 states have return successors, (116), 111 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-08 16:14:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1594 transitions. [2025-03-08 16:14:11,056 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1594 transitions. Word has length 122 [2025-03-08 16:14:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:11,056 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1594 transitions. [2025-03-08 16:14:11,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1594 transitions. [2025-03-08 16:14:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:14:11,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:11,060 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:11,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:14:11,061 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:11,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1157371668, now seen corresponding path program 1 times [2025-03-08 16:14:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:11,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809941884] [2025-03-08 16:14:11,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:11,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:11,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:14:11,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:14:11,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:11,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:11,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809941884] [2025-03-08 16:14:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809941884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:11,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:11,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:14:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464706355] [2025-03-08 16:14:11,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:14:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:11,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:14:11,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:14:11,386 INFO L87 Difference]: Start difference. First operand 1149 states and 1594 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:11,809 INFO L93 Difference]: Finished difference Result 2272 states and 3140 transitions. [2025-03-08 16:14:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:14:11,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-08 16:14:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:11,817 INFO L225 Difference]: With dead ends: 2272 [2025-03-08 16:14:11,818 INFO L226 Difference]: Without dead ends: 1175 [2025-03-08 16:14:11,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:14:11,820 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 351 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:11,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1319 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:14:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-08 16:14:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1043. [2025-03-08 16:14:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 926 states have (on average 1.34341252699784) internal successors, (1244), 929 states have internal predecessors, (1244), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1436 transitions. [2025-03-08 16:14:11,879 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1436 transitions. Word has length 122 [2025-03-08 16:14:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:11,879 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1436 transitions. [2025-03-08 16:14:11,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1436 transitions. [2025-03-08 16:14:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 16:14:11,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:11,881 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:11,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:14:11,881 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:11,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1340644269, now seen corresponding path program 1 times [2025-03-08 16:14:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:11,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557004729] [2025-03-08 16:14:11,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:11,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:11,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 16:14:11,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 16:14:11,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:11,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:12,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557004729] [2025-03-08 16:14:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557004729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:12,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:14:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286912451] [2025-03-08 16:14:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:12,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:14:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:12,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:14:12,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:14:12,503 INFO L87 Difference]: Start difference. First operand 1043 states and 1436 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:13,184 INFO L93 Difference]: Finished difference Result 2215 states and 3048 transitions. [2025-03-08 16:14:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:14:13,185 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-08 16:14:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:13,191 INFO L225 Difference]: With dead ends: 2215 [2025-03-08 16:14:13,194 INFO L226 Difference]: Without dead ends: 1175 [2025-03-08 16:14:13,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:14:13,196 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 401 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:13,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 2515 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:14:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-08 16:14:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1039. [2025-03-08 16:14:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 922 states have (on average 1.341648590021692) internal successors, (1237), 925 states have internal predecessors, (1237), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1429 transitions. [2025-03-08 16:14:13,292 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1429 transitions. Word has length 122 [2025-03-08 16:14:13,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:13,293 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1429 transitions. [2025-03-08 16:14:13,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1429 transitions. [2025-03-08 16:14:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:14:13,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:13,295 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:14:13,295 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1066023861, now seen corresponding path program 1 times [2025-03-08 16:14:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537014925] [2025-03-08 16:14:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:13,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:14:13,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:14:13,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:13,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:13,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:13,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537014925] [2025-03-08 16:14:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537014925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:13,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:14:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136342344] [2025-03-08 16:14:13,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:13,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:14:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:13,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:14:13,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:14:13,709 INFO L87 Difference]: Start difference. First operand 1039 states and 1429 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:13,941 INFO L93 Difference]: Finished difference Result 1826 states and 2522 transitions. [2025-03-08 16:14:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:14:13,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-08 16:14:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:13,948 INFO L225 Difference]: With dead ends: 1826 [2025-03-08 16:14:13,948 INFO L226 Difference]: Without dead ends: 1116 [2025-03-08 16:14:13,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:14:13,949 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 52 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:13,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1652 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-03-08 16:14:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1048. [2025-03-08 16:14:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 931 states have (on average 1.3383458646616542) internal successors, (1246), 934 states have internal predecessors, (1246), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1438 transitions. [2025-03-08 16:14:14,008 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1438 transitions. Word has length 124 [2025-03-08 16:14:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:14,009 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1438 transitions. [2025-03-08 16:14:14,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1438 transitions. [2025-03-08 16:14:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:14:14,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:14,010 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:14,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:14:14,011 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:14,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash -299586064, now seen corresponding path program 1 times [2025-03-08 16:14:14,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:14,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244482937] [2025-03-08 16:14:14,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:14,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:14,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:14:14,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:14:14,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:14,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244482937] [2025-03-08 16:14:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244482937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:14,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594772104] [2025-03-08 16:14:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:14,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:14,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:14,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:14,171 INFO L87 Difference]: Start difference. First operand 1048 states and 1438 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:14,293 INFO L93 Difference]: Finished difference Result 1857 states and 2548 transitions. [2025-03-08 16:14:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:14,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-08 16:14:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:14,296 INFO L225 Difference]: With dead ends: 1857 [2025-03-08 16:14:14,297 INFO L226 Difference]: Without dead ends: 1138 [2025-03-08 16:14:14,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:14,298 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 55 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:14,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 883 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-03-08 16:14:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1048. [2025-03-08 16:14:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 931 states have (on average 1.335123523093448) internal successors, (1243), 934 states have internal predecessors, (1243), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1435 transitions. [2025-03-08 16:14:14,352 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1435 transitions. Word has length 124 [2025-03-08 16:14:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:14,353 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1435 transitions. [2025-03-08 16:14:14,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1435 transitions. [2025-03-08 16:14:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 16:14:14,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:14,354 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:14,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:14:14,354 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash -437880411, now seen corresponding path program 1 times [2025-03-08 16:14:14,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:14,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516765019] [2025-03-08 16:14:14,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:14,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:14:14,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:14:14,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:14,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 16:14:14,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:14,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516765019] [2025-03-08 16:14:14,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516765019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:14:14,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159123968] [2025-03-08 16:14:14,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:14,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:14:14,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:14:14,558 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-08 16:14:14,559 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-08 16:14:14,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 16:14:14,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 16:14:14,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:14,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:14,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:14:14,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:14:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:14,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:14:14,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159123968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:14,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:14:14,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:14:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458712188] [2025-03-08 16:14:14,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:14,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:14:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:14,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:14:14,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:14:14,811 INFO L87 Difference]: Start difference. First operand 1048 states and 1435 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:14:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:14,890 INFO L93 Difference]: Finished difference Result 2120 states and 2903 transitions. [2025-03-08 16:14:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:14:14,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-03-08 16:14:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:14,894 INFO L225 Difference]: With dead ends: 2120 [2025-03-08 16:14:14,894 INFO L226 Difference]: Without dead ends: 1075 [2025-03-08 16:14:14,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:14:14,898 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:14,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-08 16:14:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2025-03-08 16:14:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 958 states have (on average 1.325678496868476) internal successors, (1270), 961 states have internal predecessors, (1270), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1462 transitions. [2025-03-08 16:14:14,969 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1462 transitions. Word has length 124 [2025-03-08 16:14:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:14,969 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1462 transitions. [2025-03-08 16:14:14,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:14:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1462 transitions. [2025-03-08 16:14:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 16:14:14,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:14,970 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:14,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:14:15,171 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,SelfDestructingSolverStorable27 [2025-03-08 16:14:15,171 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:15,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash 495129480, now seen corresponding path program 1 times [2025-03-08 16:14:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593068486] [2025-03-08 16:14:15,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:15,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:15,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 16:14:15,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 16:14:15,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:15,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:15,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:15,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593068486] [2025-03-08 16:14:15,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593068486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:15,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:15,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:15,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244909363] [2025-03-08 16:14:15,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:15,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:15,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:15,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:15,343 INFO L87 Difference]: Start difference. First operand 1075 states and 1462 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:15,500 INFO L93 Difference]: Finished difference Result 2213 states and 2999 transitions. [2025-03-08 16:14:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:15,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-03-08 16:14:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:15,505 INFO L225 Difference]: With dead ends: 2213 [2025-03-08 16:14:15,505 INFO L226 Difference]: Without dead ends: 1141 [2025-03-08 16:14:15,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:15,509 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 96 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:15,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 596 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:14:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-08 16:14:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1054. [2025-03-08 16:14:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 937 states have (on average 1.3169690501600855) internal successors, (1234), 940 states have internal predecessors, (1234), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:14:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1426 transitions. [2025-03-08 16:14:15,642 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1426 transitions. Word has length 126 [2025-03-08 16:14:15,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:15,643 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1426 transitions. [2025-03-08 16:14:15,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:15,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1426 transitions. [2025-03-08 16:14:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 16:14:15,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:15,643 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:15,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:14:15,644 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:15,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash -461792878, now seen corresponding path program 1 times [2025-03-08 16:14:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:15,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952770721] [2025-03-08 16:14:15,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:15,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 16:14:15,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 16:14:15,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:15,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:14:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:14:15,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:14:15,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952770721] [2025-03-08 16:14:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952770721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:14:15,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:14:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:14:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973817799] [2025-03-08 16:14:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:14:15,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:14:15,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:14:15,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:14:15,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:14:15,817 INFO L87 Difference]: Start difference. First operand 1054 states and 1426 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:14:16,028 INFO L93 Difference]: Finished difference Result 2066 states and 2797 transitions. [2025-03-08 16:14:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:14:16,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2025-03-08 16:14:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:14:16,032 INFO L225 Difference]: With dead ends: 2066 [2025-03-08 16:14:16,032 INFO L226 Difference]: Without dead ends: 1335 [2025-03-08 16:14:16,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:14:16,033 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 94 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:14:16,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1062 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:14:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-03-08 16:14:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1195. [2025-03-08 16:14:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1068 states have (on average 1.3117977528089888) internal successors, (1401), 1072 states have internal predecessors, (1401), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 16:14:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1609 transitions. [2025-03-08 16:14:16,100 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1609 transitions. Word has length 128 [2025-03-08 16:14:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:14:16,100 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1609 transitions. [2025-03-08 16:14:16,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:14:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1609 transitions. [2025-03-08 16:14:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 16:14:16,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:14:16,101 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:14:16,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:14:16,102 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:14:16,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:14:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1345661585, now seen corresponding path program 1 times [2025-03-08 16:14:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:14:16,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184033048] [2025-03-08 16:14:16,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:14:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:14:16,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 16:14:16,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 16:14:16,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:14:16,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat