./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.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 b28c8175bc39dd1c459be6d9349fe3be895f115cd8cddc9719a89a6e0edbf727 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:34:13,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:34:13,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:34:13,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:34:13,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:34:13,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:34:13,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:34:13,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:34:13,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:34:13,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:34:13,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:34:13,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:34:13,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:34:13,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:34:13,322 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:34:13,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:34:13,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:34:13,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:34:13,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:34:13,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:34:13,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:34:13,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:34:13,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:34:13,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:34:13,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:34:13,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:34:13,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:34:13,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:34:13,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:34:13,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:34:13,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:34:13,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:34:13,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:34:13,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:34:13,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:34:13,325 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 -> b28c8175bc39dd1c459be6d9349fe3be895f115cd8cddc9719a89a6e0edbf727 [2025-03-04 01:34:13,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:34:13,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:34:13,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:34:13,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:34:13,539 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:34:13,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2025-03-04 01:34:14,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b973ef77d/2da5383168c143dab67a14a3168bb437/FLAG1bc3fa2c2 [2025-03-04 01:34:14,884 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:34:14,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2025-03-04 01:34:14,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b973ef77d/2da5383168c143dab67a14a3168bb437/FLAG1bc3fa2c2 [2025-03-04 01:34:15,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b973ef77d/2da5383168c143dab67a14a3168bb437 [2025-03-04 01:34:15,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:34:15,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:34:15,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:34:15,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:34:15,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:34:15,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d41fce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15, skipping insertion in model container [2025-03-04 01:34:15,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:34:15,338 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-p_file-89.i[916,929] [2025-03-04 01:34:15,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:34:15,399 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:34:15,410 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-p_file-89.i[916,929] [2025-03-04 01:34:15,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:34:15,453 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:34:15,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15 WrapperNode [2025-03-04 01:34:15,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:34:15,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:34:15,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:34:15,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:34:15,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,503 INFO L138 Inliner]: procedures = 26, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 459 [2025-03-04 01:34:15,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:34:15,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:34:15,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:34:15,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:34:15,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,536 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 7, 13, 12, 6, 12, 9, 8, 12, 7, 5, 10, 4]. 12 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1]. [2025-03-04 01:34:15,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:34:15,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:34:15,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:34:15,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:34:15,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (1/1) ... [2025-03-04 01:34:15,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:34:15,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:15,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:34:15,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:34:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:34:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:34:15,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:34:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:34:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:34:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:34:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:34:15,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:34:15,737 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:34:15,739 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:34:16,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem64#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~short63#1;havoc property_#t~mem68#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short77#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite100#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite99#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite98#1;havoc property_#t~mem88#1;havoc property_#t~mem86#1;havoc property_#t~bitwise87#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short101#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1; [2025-03-04 01:34:16,116 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-04 01:34:16,116 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:34:16,131 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:34:16,131 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:34:16,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:34:16 BoogieIcfgContainer [2025-03-04 01:34:16,132 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:34:16,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:34:16,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:34:16,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:34:16,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:34:15" (1/3) ... [2025-03-04 01:34:16,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e71b350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:34:16, skipping insertion in model container [2025-03-04 01:34:16,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:34:15" (2/3) ... [2025-03-04 01:34:16,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e71b350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:34:16, skipping insertion in model container [2025-03-04 01:34:16,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:34:16" (3/3) ... [2025-03-04 01:34:16,139 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-89.i [2025-03-04 01:34:16,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:34:16,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-89.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:34:16,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:34:16,210 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;@508285b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:34:16,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:34:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 01:34:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:16,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:16,222 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:16,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:16,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1246125892, now seen corresponding path program 1 times [2025-03-04 01:34:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540513118] [2025-03-04 01:34:16,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:16,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:16,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:16,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:16,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 01:34:16,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:16,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540513118] [2025-03-04 01:34:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540513118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079869508] [2025-03-04 01:34:16,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:16,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:34:16,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:16,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:16,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:16,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:16,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:34:16,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 01:34:16,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079869508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:16,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:16,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:34:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270622589] [2025-03-04 01:34:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:16,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:34:16,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:16,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:34:16,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:34:16,722 INFO L87 Difference]: Start difference. First operand has 101 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 01:34:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:16,741 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-03-04 01:34:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:34:16,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-03-04 01:34:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:16,747 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:34:16,748 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:34:16,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:34:16,751 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:16,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:34:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:34:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 01:34:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2025-03-04 01:34:16,784 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 109 [2025-03-04 01:34:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:16,785 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2025-03-04 01:34:16,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 01:34:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2025-03-04 01:34:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:16,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:16,789 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:16,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:34:16,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:34:16,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:16,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1170187697, now seen corresponding path program 1 times [2025-03-04 01:34:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:16,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082466853] [2025-03-04 01:34:16,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:16,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:17,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:17,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:17,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:17,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:17,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:17,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082466853] [2025-03-04 01:34:17,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082466853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:17,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:17,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:34:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059916181] [2025-03-04 01:34:17,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:17,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:17,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:17,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:17,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:17,209 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:17,254 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-03-04 01:34:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:34:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:17,256 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:34:17,256 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:34:17,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:17,258 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:17,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:34:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 01:34:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 01:34:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2025-03-04 01:34:17,266 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 109 [2025-03-04 01:34:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:17,267 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2025-03-04 01:34:17,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2025-03-04 01:34:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:17,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:17,269 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:17,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:34:17,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:17,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1317325136, now seen corresponding path program 1 times [2025-03-04 01:34:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:17,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448001900] [2025-03-04 01:34:17,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:17,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:17,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:17,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:17,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448001900] [2025-03-04 01:34:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448001900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:34:17,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342426513] [2025-03-04 01:34:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:17,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:17,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:17,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:17,451 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:17,484 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2025-03-04 01:34:17,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:34:17,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:17,489 INFO L225 Difference]: With dead ends: 200 [2025-03-04 01:34:17,489 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:34:17,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:17,490 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:17,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:34:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-04 01:34:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 01:34:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2025-03-04 01:34:17,500 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 109 [2025-03-04 01:34:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:17,501 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2025-03-04 01:34:17,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2025-03-04 01:34:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:17,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:17,505 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:17,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:34:17,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:17,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:17,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2090138479, now seen corresponding path program 1 times [2025-03-04 01:34:17,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:17,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283778265] [2025-03-04 01:34:17,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:17,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:17,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:17,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:17,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283778265] [2025-03-04 01:34:17,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283778265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:17,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:17,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:34:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170018081] [2025-03-04 01:34:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:17,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:17,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:17,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:17,631 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:17,661 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2025-03-04 01:34:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:34:17,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:17,665 INFO L225 Difference]: With dead ends: 204 [2025-03-04 01:34:17,665 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 01:34:17,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:17,666 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:17,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 01:34:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-04 01:34:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 01:34:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2025-03-04 01:34:17,677 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 109 [2025-03-04 01:34:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:17,677 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2025-03-04 01:34:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2025-03-04 01:34:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:17,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:17,681 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:17,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:34:17,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:17,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2089214958, now seen corresponding path program 1 times [2025-03-04 01:34:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:17,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106597324] [2025-03-04 01:34:17,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:17,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:17,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:17,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:17,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:18,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106597324] [2025-03-04 01:34:18,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106597324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:18,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:18,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:18,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280724680] [2025-03-04 01:34:18,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:18,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:18,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:18,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:18,043 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:18,120 INFO L93 Difference]: Finished difference Result 278 states and 392 transitions. [2025-03-04 01:34:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:18,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:18,122 INFO L225 Difference]: With dead ends: 278 [2025-03-04 01:34:18,123 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 01:34:18,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:18,125 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 91 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:18,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 497 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 01:34:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-03-04 01:34:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 155 states have internal predecessors, (212), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:34:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 244 transitions. [2025-03-04 01:34:18,140 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 244 transitions. Word has length 109 [2025-03-04 01:34:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:18,140 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 244 transitions. [2025-03-04 01:34:18,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 244 transitions. [2025-03-04 01:34:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:18,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:18,144 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:18,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:34:18,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1695218161, now seen corresponding path program 1 times [2025-03-04 01:34:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584597088] [2025-03-04 01:34:18,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:18,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:18,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:18,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:18,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584597088] [2025-03-04 01:34:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584597088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:18,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:34:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18286720] [2025-03-04 01:34:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:18,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:34:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:18,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:34:18,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:18,736 INFO L87 Difference]: Start difference. First operand 173 states and 244 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:18,878 INFO L93 Difference]: Finished difference Result 383 states and 539 transitions. [2025-03-04 01:34:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:34:18,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:18,880 INFO L225 Difference]: With dead ends: 383 [2025-03-04 01:34:18,881 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 01:34:18,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:34:18,882 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 136 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:18,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 756 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 01:34:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2025-03-04 01:34:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 170 states have internal predecessors, (227), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:34:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 279 transitions. [2025-03-04 01:34:18,904 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 279 transitions. Word has length 109 [2025-03-04 01:34:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:18,905 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 279 transitions. [2025-03-04 01:34:18,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 279 transitions. [2025-03-04 01:34:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:18,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:18,906 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:18,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:34:18,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:18,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1277840234, now seen corresponding path program 1 times [2025-03-04 01:34:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157672536] [2025-03-04 01:34:18,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:18,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:18,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:19,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157672536] [2025-03-04 01:34:19,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157672536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:19,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:19,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638802725] [2025-03-04 01:34:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:19,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:19,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:19,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:19,210 INFO L87 Difference]: Start difference. First operand 199 states and 279 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:19,280 INFO L93 Difference]: Finished difference Result 398 states and 557 transitions. [2025-03-04 01:34:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:19,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:19,283 INFO L225 Difference]: With dead ends: 398 [2025-03-04 01:34:19,283 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 01:34:19,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:19,284 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 173 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:19,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 373 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 01:34:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2025-03-04 01:34:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 170 states have internal predecessors, (226), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:34:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 278 transitions. [2025-03-04 01:34:19,292 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 278 transitions. Word has length 109 [2025-03-04 01:34:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:19,292 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 278 transitions. [2025-03-04 01:34:19,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 278 transitions. [2025-03-04 01:34:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:19,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:19,293 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:19,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:34:19,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1788374411, now seen corresponding path program 1 times [2025-03-04 01:34:19,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:19,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360644123] [2025-03-04 01:34:19,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:19,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:19,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:19,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:19,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:19,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:19,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360644123] [2025-03-04 01:34:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360644123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:19,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:34:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526861805] [2025-03-04 01:34:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:19,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:34:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:19,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:34:19,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:19,795 INFO L87 Difference]: Start difference. First operand 199 states and 278 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:19,935 INFO L93 Difference]: Finished difference Result 409 states and 571 transitions. [2025-03-04 01:34:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:34:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:19,937 INFO L225 Difference]: With dead ends: 409 [2025-03-04 01:34:19,937 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 01:34:19,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:34:19,938 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 132 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:19,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 956 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 01:34:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 197. [2025-03-04 01:34:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 168 states have internal predecessors, (223), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:34:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 275 transitions. [2025-03-04 01:34:19,947 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 275 transitions. Word has length 109 [2025-03-04 01:34:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:19,947 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 275 transitions. [2025-03-04 01:34:19,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 275 transitions. [2025-03-04 01:34:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:19,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:19,948 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:19,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:34:19,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:19,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash -51158669, now seen corresponding path program 1 times [2025-03-04 01:34:19,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:19,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975857408] [2025-03-04 01:34:19,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:19,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:19,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:19,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:19,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:20,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:20,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975857408] [2025-03-04 01:34:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975857408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:20,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:34:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851755516] [2025-03-04 01:34:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:20,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:34:20,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:20,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:34:20,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:20,637 INFO L87 Difference]: Start difference. First operand 197 states and 275 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:20,908 INFO L93 Difference]: Finished difference Result 469 states and 656 transitions. [2025-03-04 01:34:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:34:20,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:20,910 INFO L225 Difference]: With dead ends: 469 [2025-03-04 01:34:20,910 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 01:34:20,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:34:20,911 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 100 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:20,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1165 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 01:34:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2025-03-04 01:34:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 236 states have (on average 1.3516949152542372) internal successors, (319), 238 states have internal predecessors, (319), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:34:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 381 transitions. [2025-03-04 01:34:20,921 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 381 transitions. Word has length 109 [2025-03-04 01:34:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:20,921 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 381 transitions. [2025-03-04 01:34:20,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 381 transitions. [2025-03-04 01:34:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:20,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:20,926 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:20,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:34:20,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:20,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash -561692846, now seen corresponding path program 1 times [2025-03-04 01:34:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161202478] [2025-03-04 01:34:20,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:20,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:20,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:20,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:20,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161202478] [2025-03-04 01:34:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161202478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:21,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:21,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882914982] [2025-03-04 01:34:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:21,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:21,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:21,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:21,149 INFO L87 Difference]: Start difference. First operand 272 states and 381 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:21,230 INFO L93 Difference]: Finished difference Result 546 states and 762 transitions. [2025-03-04 01:34:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:21,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:21,232 INFO L225 Difference]: With dead ends: 546 [2025-03-04 01:34:21,232 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 01:34:21,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:21,235 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 171 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:21,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 467 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 01:34:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2025-03-04 01:34:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 238 states have (on average 1.3445378151260505) internal successors, (320), 240 states have internal predecessors, (320), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:34:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 382 transitions. [2025-03-04 01:34:21,255 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 382 transitions. Word has length 109 [2025-03-04 01:34:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:21,255 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 382 transitions. [2025-03-04 01:34:21,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 382 transitions. [2025-03-04 01:34:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:21,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:21,257 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:21,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:34:21,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash 760216055, now seen corresponding path program 1 times [2025-03-04 01:34:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939659738] [2025-03-04 01:34:21,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:21,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:21,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:21,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:21,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:21,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939659738] [2025-03-04 01:34:21,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939659738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:21,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:21,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:21,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652423359] [2025-03-04 01:34:21,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:21,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:21,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:21,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:21,866 INFO L87 Difference]: Start difference. First operand 275 states and 382 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:22,056 INFO L93 Difference]: Finished difference Result 817 states and 1135 transitions. [2025-03-04 01:34:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:22,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:22,059 INFO L225 Difference]: With dead ends: 817 [2025-03-04 01:34:22,059 INFO L226 Difference]: Without dead ends: 545 [2025-03-04 01:34:22,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:34:22,060 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 214 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:22,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 719 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-04 01:34:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 537. [2025-03-04 01:34:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 464 states have (on average 1.3426724137931034) internal successors, (623), 468 states have internal predecessors, (623), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:34:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 747 transitions. [2025-03-04 01:34:22,098 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 747 transitions. Word has length 109 [2025-03-04 01:34:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:22,098 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 747 transitions. [2025-03-04 01:34:22,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 747 transitions. [2025-03-04 01:34:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:22,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:22,104 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:22,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:34:22,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:22,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1916045047, now seen corresponding path program 1 times [2025-03-04 01:34:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907636334] [2025-03-04 01:34:22,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:22,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:22,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:22,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:22,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907636334] [2025-03-04 01:34:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907636334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:22,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:22,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040478194] [2025-03-04 01:34:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:22,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:22,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:22,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:22,688 INFO L87 Difference]: Start difference. First operand 537 states and 747 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:22,998 INFO L93 Difference]: Finished difference Result 1075 states and 1493 transitions. [2025-03-04 01:34:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:22,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:23,002 INFO L225 Difference]: With dead ends: 1075 [2025-03-04 01:34:23,002 INFO L226 Difference]: Without dead ends: 541 [2025-03-04 01:34:23,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:34:23,004 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 223 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:23,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 719 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-04 01:34:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 535. [2025-03-04 01:34:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 462 states have (on average 1.3398268398268398) internal successors, (619), 466 states have internal predecessors, (619), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:34:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 743 transitions. [2025-03-04 01:34:23,035 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 743 transitions. Word has length 109 [2025-03-04 01:34:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:23,035 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 743 transitions. [2025-03-04 01:34:23,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 743 transitions. [2025-03-04 01:34:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:23,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:23,037 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:23,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:34:23,037 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:23,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1567547525, now seen corresponding path program 1 times [2025-03-04 01:34:23,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:23,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708263017] [2025-03-04 01:34:23,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:23,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:23,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:23,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:23,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:23,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708263017] [2025-03-04 01:34:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708263017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:23,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:23,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:34:23,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739902580] [2025-03-04 01:34:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:23,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:34:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:23,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:34:23,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:23,567 INFO L87 Difference]: Start difference. First operand 535 states and 743 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:23,827 INFO L93 Difference]: Finished difference Result 1253 states and 1739 transitions. [2025-03-04 01:34:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:34:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:23,831 INFO L225 Difference]: With dead ends: 1253 [2025-03-04 01:34:23,831 INFO L226 Difference]: Without dead ends: 721 [2025-03-04 01:34:23,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:34:23,832 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 108 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:23,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 979 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-04 01:34:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 716. [2025-03-04 01:34:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 618 states have (on average 1.338187702265372) internal successors, (827), 625 states have internal predecessors, (827), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:34:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 993 transitions. [2025-03-04 01:34:23,862 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 993 transitions. Word has length 109 [2025-03-04 01:34:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:23,862 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 993 transitions. [2025-03-04 01:34:23,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 993 transitions. [2025-03-04 01:34:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:23,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:23,864 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:23,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:34:23,864 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:23,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2078081702, now seen corresponding path program 1 times [2025-03-04 01:34:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:23,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729794686] [2025-03-04 01:34:23,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:23,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:23,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:23,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:23,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729794686] [2025-03-04 01:34:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729794686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403118070] [2025-03-04 01:34:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:23,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:23,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:23,997 INFO L87 Difference]: Start difference. First operand 716 states and 993 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:24,083 INFO L93 Difference]: Finished difference Result 1412 states and 1957 transitions. [2025-03-04 01:34:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:24,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:24,086 INFO L225 Difference]: With dead ends: 1412 [2025-03-04 01:34:24,086 INFO L226 Difference]: Without dead ends: 722 [2025-03-04 01:34:24,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:24,089 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 171 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:24,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 547 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-04 01:34:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2025-03-04 01:34:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 620 states have (on average 1.332258064516129) internal successors, (826), 627 states have internal predecessors, (826), 83 states have call successors, (83), 16 states have call predecessors, (83), 16 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:34:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 992 transitions. [2025-03-04 01:34:24,126 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 992 transitions. Word has length 109 [2025-03-04 01:34:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:24,126 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 992 transitions. [2025-03-04 01:34:24,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 992 transitions. [2025-03-04 01:34:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:24,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:24,128 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:24,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:34:24,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:24,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash 689363482, now seen corresponding path program 1 times [2025-03-04 01:34:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:24,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951735610] [2025-03-04 01:34:24,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:24,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:24,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:24,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:24,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:24,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:24,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951735610] [2025-03-04 01:34:24,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951735610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:24,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:24,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774780272] [2025-03-04 01:34:24,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:24,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:24,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:24,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:24,260 INFO L87 Difference]: Start difference. First operand 720 states and 992 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:24,340 INFO L93 Difference]: Finished difference Result 1425 states and 1961 transitions. [2025-03-04 01:34:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:24,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:24,343 INFO L225 Difference]: With dead ends: 1425 [2025-03-04 01:34:24,343 INFO L226 Difference]: Without dead ends: 731 [2025-03-04 01:34:24,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:24,345 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 175 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:24,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 440 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-03-04 01:34:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 561. [2025-03-04 01:34:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 498 states have (on average 1.3493975903614457) internal successors, (672), 502 states have internal predecessors, (672), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 01:34:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 772 transitions. [2025-03-04 01:34:24,368 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 772 transitions. Word has length 109 [2025-03-04 01:34:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:24,368 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 772 transitions. [2025-03-04 01:34:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 772 transitions. [2025-03-04 01:34:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:34:24,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:24,370 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:24,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:34:24,370 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:24,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 178829305, now seen corresponding path program 1 times [2025-03-04 01:34:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787502325] [2025-03-04 01:34:24,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:24,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:24,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:34:24,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:34:24,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:24,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787502325] [2025-03-04 01:34:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787502325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:24,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:24,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:34:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423326507] [2025-03-04 01:34:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:24,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:34:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:24,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:34:24,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:24,641 INFO L87 Difference]: Start difference. First operand 561 states and 772 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:24,779 INFO L93 Difference]: Finished difference Result 1314 states and 1802 transitions. [2025-03-04 01:34:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:34:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2025-03-04 01:34:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:24,783 INFO L225 Difference]: With dead ends: 1314 [2025-03-04 01:34:24,783 INFO L226 Difference]: Without dead ends: 756 [2025-03-04 01:34:24,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:34:24,784 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 136 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:24,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1111 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-04 01:34:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 557. [2025-03-04 01:34:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 494 states have (on average 1.3502024291497976) internal successors, (667), 498 states have internal predecessors, (667), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 01:34:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 767 transitions. [2025-03-04 01:34:24,809 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 767 transitions. Word has length 109 [2025-03-04 01:34:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:24,809 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 767 transitions. [2025-03-04 01:34:24,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 767 transitions. [2025-03-04 01:34:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:34:24,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:24,810 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:24,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:34:24,811 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash 128561909, now seen corresponding path program 1 times [2025-03-04 01:34:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498450725] [2025-03-04 01:34:24,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:24,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:24,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:34:24,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:34:24,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:24,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:24,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:24,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498450725] [2025-03-04 01:34:24,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498450725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:24,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580716912] [2025-03-04 01:34:24,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:24,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:24,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:24,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:24,934 INFO L87 Difference]: Start difference. First operand 557 states and 767 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:25,059 INFO L93 Difference]: Finished difference Result 1341 states and 1848 transitions. [2025-03-04 01:34:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2025-03-04 01:34:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:25,062 INFO L225 Difference]: With dead ends: 1341 [2025-03-04 01:34:25,063 INFO L226 Difference]: Without dead ends: 787 [2025-03-04 01:34:25,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:34:25,064 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 110 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:25,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 495 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-04 01:34:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 680. [2025-03-04 01:34:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 601 states have (on average 1.346089850249584) internal successors, (809), 605 states have internal predecessors, (809), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 935 transitions. [2025-03-04 01:34:25,099 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 935 transitions. Word has length 111 [2025-03-04 01:34:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:25,100 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 935 transitions. [2025-03-04 01:34:25,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 935 transitions. [2025-03-04 01:34:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:34:25,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:25,101 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:25,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:34:25,102 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:25,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1301648309, now seen corresponding path program 1 times [2025-03-04 01:34:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019704036] [2025-03-04 01:34:25,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:25,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:34:25,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:34:25,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:25,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-04 01:34:25,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019704036] [2025-03-04 01:34:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019704036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383081593] [2025-03-04 01:34:25,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:25,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:25,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:25,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:25,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:34:25,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:34:25,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:34:25,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:25,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:25,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:34:25,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:25,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383081593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:34:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999075719] [2025-03-04 01:34:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:25,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:25,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:25,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:25,407 INFO L87 Difference]: Start difference. First operand 680 states and 935 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:25,452 INFO L93 Difference]: Finished difference Result 1252 states and 1723 transitions. [2025-03-04 01:34:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:25,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2025-03-04 01:34:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:25,456 INFO L225 Difference]: With dead ends: 1252 [2025-03-04 01:34:25,456 INFO L226 Difference]: Without dead ends: 698 [2025-03-04 01:34:25,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 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-04 01:34:25,457 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:25,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-04 01:34:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-04 01:34:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 619 states have (on average 1.3360258481421647) internal successors, (827), 623 states have internal predecessors, (827), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 953 transitions. [2025-03-04 01:34:25,486 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 953 transitions. Word has length 111 [2025-03-04 01:34:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:25,486 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 953 transitions. [2025-03-04 01:34:25,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 953 transitions. [2025-03-04 01:34:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:34:25,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:25,488 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:25,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:34:25,688 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,SelfDestructingSolverStorable17 [2025-03-04 01:34:25,688 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1766749103, now seen corresponding path program 1 times [2025-03-04 01:34:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:25,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614302794] [2025-03-04 01:34:25,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:25,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:25,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:34:25,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:34:25,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:25,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:25,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614302794] [2025-03-04 01:34:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614302794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:25,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:34:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687595970] [2025-03-04 01:34:25,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:25,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:34:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:25,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:34:25,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:34:25,966 INFO L87 Difference]: Start difference. First operand 698 states and 953 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:26,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:26,057 INFO L93 Difference]: Finished difference Result 718 states and 978 transitions. [2025-03-04 01:34:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:34:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-03-04 01:34:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:26,060 INFO L225 Difference]: With dead ends: 718 [2025-03-04 01:34:26,060 INFO L226 Difference]: Without dead ends: 716 [2025-03-04 01:34:26,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:26,061 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:26,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 688 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-04 01:34:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-03-04 01:34:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 637 states have (on average 1.3265306122448979) internal successors, (845), 641 states have internal predecessors, (845), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 971 transitions. [2025-03-04 01:34:26,088 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 971 transitions. Word has length 113 [2025-03-04 01:34:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:26,088 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 971 transitions. [2025-03-04 01:34:26,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 971 transitions. [2025-03-04 01:34:26,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:34:26,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:26,089 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:26,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:34:26,089 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:26,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1767672624, now seen corresponding path program 1 times [2025-03-04 01:34:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:26,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92701158] [2025-03-04 01:34:26,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:26,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:34:26,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:34:26,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:26,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:26,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92701158] [2025-03-04 01:34:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92701158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:26,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:34:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365731678] [2025-03-04 01:34:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:26,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:34:26,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:26,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:34:26,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:34:26,360 INFO L87 Difference]: Start difference. First operand 716 states and 971 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:26,544 INFO L93 Difference]: Finished difference Result 1310 states and 1775 transitions. [2025-03-04 01:34:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:34:26,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-03-04 01:34:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:26,547 INFO L225 Difference]: With dead ends: 1310 [2025-03-04 01:34:26,547 INFO L226 Difference]: Without dead ends: 720 [2025-03-04 01:34:26,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:34:26,550 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 202 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:26,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 772 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-04 01:34:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 716. [2025-03-04 01:34:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 637 states have (on average 1.3218210361067504) internal successors, (842), 641 states have internal predecessors, (842), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-03-04 01:34:26,579 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 113 [2025-03-04 01:34:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:26,579 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-03-04 01:34:26,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-03-04 01:34:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:34:26,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:26,581 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:26,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:34:26,581 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:26,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1639790991, now seen corresponding path program 1 times [2025-03-04 01:34:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:26,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392628907] [2025-03-04 01:34:26,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:26,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:34:26,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:34:26,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:26,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392628907] [2025-03-04 01:34:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392628907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:26,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:26,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397838621] [2025-03-04 01:34:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:26,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:26,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:26,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:26,707 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:26,767 INFO L93 Difference]: Finished difference Result 1314 states and 1771 transitions. [2025-03-04 01:34:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:26,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-03-04 01:34:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:26,772 INFO L225 Difference]: With dead ends: 1314 [2025-03-04 01:34:26,772 INFO L226 Difference]: Without dead ends: 724 [2025-03-04 01:34:26,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04 01:34:26,774 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 102 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:26,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 557 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-04 01:34:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-03-04 01:34:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 643 states have (on average 1.3094867807153965) internal successors, (842), 647 states have internal predecessors, (842), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 968 transitions. [2025-03-04 01:34:26,804 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 968 transitions. Word has length 113 [2025-03-04 01:34:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:26,805 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 968 transitions. [2025-03-04 01:34:26,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 968 transitions. [2025-03-04 01:34:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:34:26,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:26,806 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:26,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:34:26,806 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:26,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash 847721842, now seen corresponding path program 1 times [2025-03-04 01:34:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:26,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770806741] [2025-03-04 01:34:26,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:26,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:34:26,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:34:26,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:26,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-04 01:34:26,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770806741] [2025-03-04 01:34:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770806741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724567499] [2025-03-04 01:34:26,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:26,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:26,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:34:27,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:34:27,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:34:27,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:27,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:34:27,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:27,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:27,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724567499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:27,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:27,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:34:27,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75993765] [2025-03-04 01:34:27,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:27,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:27,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:27,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:27,067 INFO L87 Difference]: Start difference. First operand 724 states and 968 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:27,112 INFO L93 Difference]: Finished difference Result 1340 states and 1789 transitions. [2025-03-04 01:34:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:27,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-03-04 01:34:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:27,116 INFO L225 Difference]: With dead ends: 1340 [2025-03-04 01:34:27,117 INFO L226 Difference]: Without dead ends: 742 [2025-03-04 01:34:27,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 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-04 01:34:27,121 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:27,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 528 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-04 01:34:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-03-04 01:34:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 661 states have (on average 1.3010590015128594) internal successors, (860), 665 states have internal predecessors, (860), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 986 transitions. [2025-03-04 01:34:27,148 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 986 transitions. Word has length 113 [2025-03-04 01:34:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:27,148 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 986 transitions. [2025-03-04 01:34:27,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 986 transitions. [2025-03-04 01:34:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:34:27,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:27,149 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:27,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:34:27,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:27,356 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:27,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2015500886, now seen corresponding path program 1 times [2025-03-04 01:34:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254749871] [2025-03-04 01:34:27,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:27,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:34:27,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:34:27,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:27,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-04 01:34:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254749871] [2025-03-04 01:34:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254749871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253536713] [2025-03-04 01:34:27,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:27,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:27,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:27,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:34:27,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:34:27,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:34:27,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:27,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:27,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:34:27,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:27,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:27,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253536713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:27,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:27,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-04 01:34:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584891624] [2025-03-04 01:34:27,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:27,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:27,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:27,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:27,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:27,641 INFO L87 Difference]: Start difference. First operand 742 states and 986 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:27,691 INFO L93 Difference]: Finished difference Result 1382 states and 1831 transitions. [2025-03-04 01:34:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2025-03-04 01:34:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:27,695 INFO L225 Difference]: With dead ends: 1382 [2025-03-04 01:34:27,695 INFO L226 Difference]: Without dead ends: 766 [2025-03-04 01:34:27,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:27,697 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:27,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-04 01:34:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 748. [2025-03-04 01:34:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 667 states have (on average 1.2983508245877062) internal successors, (866), 671 states have internal predecessors, (866), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 992 transitions. [2025-03-04 01:34:27,724 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 992 transitions. Word has length 116 [2025-03-04 01:34:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:27,724 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 992 transitions. [2025-03-04 01:34:27,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 992 transitions. [2025-03-04 01:34:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:34:27,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:27,725 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:27,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:34:27,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:27,927 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:27,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash 696106501, now seen corresponding path program 1 times [2025-03-04 01:34:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:27,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088810167] [2025-03-04 01:34:27,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:27,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:27,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:34:27,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:34:27,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:27,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088810167] [2025-03-04 01:34:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088810167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:27,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:34:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579648600] [2025-03-04 01:34:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:27,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:34:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:27,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:34:27,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:34:27,964 INFO L87 Difference]: Start difference. First operand 748 states and 992 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:27,994 INFO L93 Difference]: Finished difference Result 1376 states and 1825 transitions. [2025-03-04 01:34:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:34:27,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2025-03-04 01:34:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:27,997 INFO L225 Difference]: With dead ends: 1376 [2025-03-04 01:34:27,997 INFO L226 Difference]: Without dead ends: 754 [2025-03-04 01:34:27,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:34:27,999 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:28,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-04 01:34:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-04 01:34:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.2956909361069837) internal successors, (872), 677 states have internal predecessors, (872), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 998 transitions. [2025-03-04 01:34:28,023 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 998 transitions. Word has length 118 [2025-03-04 01:34:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:28,024 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 998 transitions. [2025-03-04 01:34:28,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 998 transitions. [2025-03-04 01:34:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:34:28,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:28,025 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:28,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:34:28,026 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:28,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:28,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1206640678, now seen corresponding path program 1 times [2025-03-04 01:34:28,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:28,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274506713] [2025-03-04 01:34:28,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:28,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:28,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:34:28,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:34:28,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:28,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:28,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:28,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274506713] [2025-03-04 01:34:28,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274506713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:28,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:28,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045188826] [2025-03-04 01:34:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:28,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:28,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:28,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:28,212 INFO L87 Difference]: Start difference. First operand 754 states and 998 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:28,321 INFO L93 Difference]: Finished difference Result 1386 states and 1829 transitions. [2025-03-04 01:34:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:28,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2025-03-04 01:34:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:28,325 INFO L225 Difference]: With dead ends: 1386 [2025-03-04 01:34:28,325 INFO L226 Difference]: Without dead ends: 758 [2025-03-04 01:34:28,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:28,326 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 87 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:28,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 482 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-04 01:34:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-03-04 01:34:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.2912332838038634) internal successors, (869), 677 states have internal predecessors, (869), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 995 transitions. [2025-03-04 01:34:28,355 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 995 transitions. Word has length 118 [2025-03-04 01:34:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:28,355 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 995 transitions. [2025-03-04 01:34:28,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 995 transitions. [2025-03-04 01:34:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:34:28,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:28,356 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:28,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:34:28,357 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:28,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:28,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1404579630, now seen corresponding path program 1 times [2025-03-04 01:34:28,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:28,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673685233] [2025-03-04 01:34:28,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:28,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:28,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:34:28,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:34:28,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:28,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:28,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:28,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673685233] [2025-03-04 01:34:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673685233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:28,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:28,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182484686] [2025-03-04 01:34:28,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:28,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:28,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:28,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:28,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:28,510 INFO L87 Difference]: Start difference. First operand 754 states and 995 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:28,637 INFO L93 Difference]: Finished difference Result 1386 states and 1823 transitions. [2025-03-04 01:34:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:28,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2025-03-04 01:34:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:28,641 INFO L225 Difference]: With dead ends: 1386 [2025-03-04 01:34:28,641 INFO L226 Difference]: Without dead ends: 758 [2025-03-04 01:34:28,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:28,643 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:28,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 600 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-04 01:34:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-03-04 01:34:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.286775631500743) internal successors, (866), 677 states have internal predecessors, (866), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 992 transitions. [2025-03-04 01:34:28,673 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 992 transitions. Word has length 122 [2025-03-04 01:34:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:28,673 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 992 transitions. [2025-03-04 01:34:28,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 992 transitions. [2025-03-04 01:34:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:34:28,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:28,674 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:28,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:34:28,675 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:28,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1732178148, now seen corresponding path program 1 times [2025-03-04 01:34:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479072396] [2025-03-04 01:34:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:28,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:34:28,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:34:28,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:28,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479072396] [2025-03-04 01:34:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479072396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78857236] [2025-03-04 01:34:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:28,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:28,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:28,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:28,821 INFO L87 Difference]: Start difference. First operand 754 states and 992 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:28,933 INFO L93 Difference]: Finished difference Result 1386 states and 1817 transitions. [2025-03-04 01:34:28,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:28,933 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2025-03-04 01:34:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:28,936 INFO L225 Difference]: With dead ends: 1386 [2025-03-04 01:34:28,936 INFO L226 Difference]: Without dead ends: 758 [2025-03-04 01:34:28,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:28,939 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 175 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:28,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 473 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-04 01:34:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-03-04 01:34:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.2823179791976227) internal successors, (863), 677 states have internal predecessors, (863), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 989 transitions. [2025-03-04 01:34:28,964 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 989 transitions. Word has length 123 [2025-03-04 01:34:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:28,964 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 989 transitions. [2025-03-04 01:34:28,964 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 989 transitions. [2025-03-04 01:34:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:34:28,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:28,965 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:28,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:34:28,966 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:28,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash -544007126, now seen corresponding path program 1 times [2025-03-04 01:34:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099661091] [2025-03-04 01:34:28,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:28,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:34:28,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:34:28,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:28,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:29,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:29,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099661091] [2025-03-04 01:34:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099661091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:29,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772633539] [2025-03-04 01:34:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:29,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:29,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:29,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:29,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:29,150 INFO L87 Difference]: Start difference. First operand 754 states and 989 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:29,268 INFO L93 Difference]: Finished difference Result 1386 states and 1811 transitions. [2025-03-04 01:34:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 124 [2025-03-04 01:34:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:29,271 INFO L225 Difference]: With dead ends: 1386 [2025-03-04 01:34:29,271 INFO L226 Difference]: Without dead ends: 758 [2025-03-04 01:34:29,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:29,272 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 83 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:29,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 590 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-04 01:34:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-03-04 01:34:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 673 states have (on average 1.2778603268945021) internal successors, (860), 677 states have internal predecessors, (860), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 986 transitions. [2025-03-04 01:34:29,296 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 986 transitions. Word has length 124 [2025-03-04 01:34:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:29,296 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 986 transitions. [2025-03-04 01:34:29,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 986 transitions. [2025-03-04 01:34:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:34:29,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:29,297 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:29,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:34:29,297 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:29,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1954446035, now seen corresponding path program 1 times [2025-03-04 01:34:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:29,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355457668] [2025-03-04 01:34:29,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:29,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:34:29,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:34:29,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:29,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:29,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:29,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355457668] [2025-03-04 01:34:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355457668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:29,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38909138] [2025-03-04 01:34:29,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:29,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:29,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:29,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:29,450 INFO L87 Difference]: Start difference. First operand 754 states and 986 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:29,517 INFO L93 Difference]: Finished difference Result 1563 states and 2025 transitions. [2025-03-04 01:34:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:34:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 126 [2025-03-04 01:34:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:29,521 INFO L225 Difference]: With dead ends: 1563 [2025-03-04 01:34:29,521 INFO L226 Difference]: Without dead ends: 935 [2025-03-04 01:34:29,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04 01:34:29,526 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 106 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:29,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 541 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-04 01:34:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 785. [2025-03-04 01:34:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 704 states have (on average 1.2798295454545454) internal successors, (901), 708 states have internal predecessors, (901), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1027 transitions. [2025-03-04 01:34:29,553 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1027 transitions. Word has length 126 [2025-03-04 01:34:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:29,554 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1027 transitions. [2025-03-04 01:34:29,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1027 transitions. [2025-03-04 01:34:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:34:29,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:29,554 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:29,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:34:29,555 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:29,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1151914475, now seen corresponding path program 1 times [2025-03-04 01:34:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:29,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645682481] [2025-03-04 01:34:29,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:29,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:34:29,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:34:29,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:29,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-04 01:34:29,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:29,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645682481] [2025-03-04 01:34:29,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645682481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:29,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278465133] [2025-03-04 01:34:29,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:29,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:29,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:29,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:29,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:34:29,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:34:29,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:34:29,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:29,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:29,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:34:30,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:30,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:30,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:30,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 01:34:30,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2025-03-04 01:34:30,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 48 [2025-03-04 01:34:30,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2025-03-04 01:34:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 01:34:30,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278465133] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:30,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:34:30,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 7] total 17 [2025-03-04 01:34:30,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801632921] [2025-03-04 01:34:30,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:30,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:30,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:30,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:34:30,928 INFO L87 Difference]: Start difference. First operand 785 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:31,056 INFO L93 Difference]: Finished difference Result 1745 states and 2234 transitions. [2025-03-04 01:34:31,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:31,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 126 [2025-03-04 01:34:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:31,061 INFO L225 Difference]: With dead ends: 1745 [2025-03-04 01:34:31,061 INFO L226 Difference]: Without dead ends: 1089 [2025-03-04 01:34:31,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:34:31,062 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 60 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:31,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 387 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-03-04 01:34:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 926. [2025-03-04 01:34:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 845 states have (on average 1.2662721893491125) internal successors, (1070), 849 states have internal predecessors, (1070), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1196 transitions. [2025-03-04 01:34:31,094 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1196 transitions. Word has length 126 [2025-03-04 01:34:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:31,095 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1196 transitions. [2025-03-04 01:34:31,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1196 transitions. [2025-03-04 01:34:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:34:31,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:31,096 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:31,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:34:31,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:31,297 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:31,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1131269709, now seen corresponding path program 1 times [2025-03-04 01:34:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:31,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024603419] [2025-03-04 01:34:31,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:31,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:34:31,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:34:31,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:31,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:31,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024603419] [2025-03-04 01:34:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024603419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:31,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:31,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:31,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836908419] [2025-03-04 01:34:31,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:31,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:31,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:31,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:31,524 INFO L87 Difference]: Start difference. First operand 926 states and 1196 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:31,670 INFO L93 Difference]: Finished difference Result 2216 states and 2832 transitions. [2025-03-04 01:34:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:34:31,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2025-03-04 01:34:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:31,676 INFO L225 Difference]: With dead ends: 2216 [2025-03-04 01:34:31,676 INFO L226 Difference]: Without dead ends: 1444 [2025-03-04 01:34:31,677 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-04 01:34:31,677 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 292 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:31,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 428 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-03-04 01:34:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1039. [2025-03-04 01:34:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 958 states have (on average 1.2745302713987474) internal successors, (1221), 962 states have internal predecessors, (1221), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 01:34:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1347 transitions. [2025-03-04 01:34:31,709 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1347 transitions. Word has length 128 [2025-03-04 01:34:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:31,709 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1347 transitions. [2025-03-04 01:34:31,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1347 transitions. [2025-03-04 01:34:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:34:31,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:31,711 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:31,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:34:31,711 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:31,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:31,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1461035470, now seen corresponding path program 1 times [2025-03-04 01:34:31,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:31,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966757411] [2025-03-04 01:34:31,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:31,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:31,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:34:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:34:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:31,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:31,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966757411] [2025-03-04 01:34:31,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966757411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:31,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:31,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:31,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105229321] [2025-03-04 01:34:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:31,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:31,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:31,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:31,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:31,857 INFO L87 Difference]: Start difference. First operand 1039 states and 1347 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:31,946 INFO L93 Difference]: Finished difference Result 2452 states and 3167 transitions. [2025-03-04 01:34:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:31,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2025-03-04 01:34:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:31,952 INFO L225 Difference]: With dead ends: 2452 [2025-03-04 01:34:31,952 INFO L226 Difference]: Without dead ends: 1588 [2025-03-04 01:34:31,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:31,954 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 132 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:31,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 479 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2025-03-04 01:34:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1331. [2025-03-04 01:34:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.285598705501618) internal successors, (1589), 1242 states have internal predecessors, (1589), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1735 transitions. [2025-03-04 01:34:31,991 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1735 transitions. Word has length 128 [2025-03-04 01:34:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:31,991 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1735 transitions. [2025-03-04 01:34:31,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1735 transitions. [2025-03-04 01:34:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:34:31,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:31,992 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:31,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:34:31,992 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:31,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2067752010, now seen corresponding path program 1 times [2025-03-04 01:34:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:31,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847835695] [2025-03-04 01:34:31,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:32,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:34:32,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:34:32,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:32,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:32,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847835695] [2025-03-04 01:34:32,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847835695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:32,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:32,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:34:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494991254] [2025-03-04 01:34:32,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:32,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:32,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:32,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:32,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:32,093 INFO L87 Difference]: Start difference. First operand 1331 states and 1735 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:32,144 INFO L93 Difference]: Finished difference Result 2486 states and 3225 transitions. [2025-03-04 01:34:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:34:32,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 129 [2025-03-04 01:34:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:32,148 INFO L225 Difference]: With dead ends: 2486 [2025-03-04 01:34:32,148 INFO L226 Difference]: Without dead ends: 1335 [2025-03-04 01:34:32,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:32,150 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 94 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:32,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 389 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-03-04 01:34:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1331. [2025-03-04 01:34:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.272653721682848) internal successors, (1573), 1242 states have internal predecessors, (1573), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1719 transitions. [2025-03-04 01:34:32,183 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1719 transitions. Word has length 129 [2025-03-04 01:34:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:32,183 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1719 transitions. [2025-03-04 01:34:32,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1719 transitions. [2025-03-04 01:34:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:34:32,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:32,184 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:32,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:34:32,185 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:32,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash 571205173, now seen corresponding path program 1 times [2025-03-04 01:34:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:32,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944093960] [2025-03-04 01:34:32,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:32,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:32,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:34:32,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:34:32,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:32,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944093960] [2025-03-04 01:34:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944093960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:32,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:34:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633573655] [2025-03-04 01:34:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:32,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:32,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:32,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:32,281 INFO L87 Difference]: Start difference. First operand 1331 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:32,357 INFO L93 Difference]: Finished difference Result 2510 states and 3241 transitions. [2025-03-04 01:34:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:32,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 132 [2025-03-04 01:34:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:32,362 INFO L225 Difference]: With dead ends: 2510 [2025-03-04 01:34:32,362 INFO L226 Difference]: Without dead ends: 1335 [2025-03-04 01:34:32,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:32,366 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 95 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:32,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 379 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-03-04 01:34:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1331. [2025-03-04 01:34:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.2597087378640777) internal successors, (1557), 1242 states have internal predecessors, (1557), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1703 transitions. [2025-03-04 01:34:32,425 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1703 transitions. Word has length 132 [2025-03-04 01:34:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:32,426 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1703 transitions. [2025-03-04 01:34:32,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1703 transitions. [2025-03-04 01:34:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:34:32,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:32,428 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:32,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:34:32,429 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:32,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1572071745, now seen corresponding path program 1 times [2025-03-04 01:34:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086330145] [2025-03-04 01:34:32,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:32,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:34:32,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:34:32,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:32,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:32,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:32,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086330145] [2025-03-04 01:34:32,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086330145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:32,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:32,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:32,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383334367] [2025-03-04 01:34:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:32,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:32,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:32,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:32,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:32,560 INFO L87 Difference]: Start difference. First operand 1331 states and 1703 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:32,669 INFO L93 Difference]: Finished difference Result 2510 states and 3217 transitions. [2025-03-04 01:34:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 133 [2025-03-04 01:34:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:32,674 INFO L225 Difference]: With dead ends: 2510 [2025-03-04 01:34:32,674 INFO L226 Difference]: Without dead ends: 1335 [2025-03-04 01:34:32,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04 01:34:32,677 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 93 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 482 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:32,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 482 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-03-04 01:34:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1331. [2025-03-04 01:34:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.2467637540453074) internal successors, (1541), 1242 states have internal predecessors, (1541), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1687 transitions. [2025-03-04 01:34:32,719 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1687 transitions. Word has length 133 [2025-03-04 01:34:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:32,719 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1687 transitions. [2025-03-04 01:34:32,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1687 transitions. [2025-03-04 01:34:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:34:32,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:32,720 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:32,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:34:32,721 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1019561488, now seen corresponding path program 1 times [2025-03-04 01:34:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257051166] [2025-03-04 01:34:32,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:34:32,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:34:32,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:32,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257051166] [2025-03-04 01:34:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257051166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:32,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:32,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542970313] [2025-03-04 01:34:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:32,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:32,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:32,870 INFO L87 Difference]: Start difference. First operand 1331 states and 1687 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:32,985 INFO L93 Difference]: Finished difference Result 2486 states and 3153 transitions. [2025-03-04 01:34:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:32,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 134 [2025-03-04 01:34:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:32,990 INFO L225 Difference]: With dead ends: 2486 [2025-03-04 01:34:32,990 INFO L226 Difference]: Without dead ends: 1335 [2025-03-04 01:34:32,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:34:32,993 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 90 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:32,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 604 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-03-04 01:34:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1331. [2025-03-04 01:34:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1236 states have (on average 1.2338187702265373) internal successors, (1525), 1242 states have internal predecessors, (1525), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1671 transitions. [2025-03-04 01:34:33,028 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1671 transitions. Word has length 134 [2025-03-04 01:34:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:33,028 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1671 transitions. [2025-03-04 01:34:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1671 transitions. [2025-03-04 01:34:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:34:33,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:33,029 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:33,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:34:33,030 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:33,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1773065683, now seen corresponding path program 1 times [2025-03-04 01:34:33,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:33,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540199059] [2025-03-04 01:34:33,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:33,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:34:33,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:34:33,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:33,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:34:33,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:33,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540199059] [2025-03-04 01:34:33,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540199059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:33,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:33,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:34:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137376098] [2025-03-04 01:34:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:33,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:34:33,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:33,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:34:33,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:34:33,568 INFO L87 Difference]: Start difference. First operand 1331 states and 1671 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:34,001 INFO L93 Difference]: Finished difference Result 3409 states and 4233 transitions. [2025-03-04 01:34:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 01:34:34,001 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 136 [2025-03-04 01:34:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:34,015 INFO L225 Difference]: With dead ends: 3409 [2025-03-04 01:34:34,015 INFO L226 Difference]: Without dead ends: 2307 [2025-03-04 01:34:34,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:34:34,020 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 174 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:34,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2368 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:34:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-04 01:34:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 1280. [2025-03-04 01:34:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1185 states have (on average 1.2379746835443037) internal successors, (1467), 1191 states have internal predecessors, (1467), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1613 transitions. [2025-03-04 01:34:34,062 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1613 transitions. Word has length 136 [2025-03-04 01:34:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:34,063 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1613 transitions. [2025-03-04 01:34:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1613 transitions. [2025-03-04 01:34:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-04 01:34:34,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:34,066 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:34,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:34:34,066 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:34,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:34,067 INFO L85 PathProgramCache]: Analyzing trace with hash 524155991, now seen corresponding path program 1 times [2025-03-04 01:34:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:34,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514388587] [2025-03-04 01:34:34,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:34,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 01:34:34,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 01:34:34,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:34,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 42 proven. 66 refuted. 0 times theorem prover too weak. 1243 trivial. 0 not checked. [2025-03-04 01:34:34,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514388587] [2025-03-04 01:34:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514388587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351290438] [2025-03-04 01:34:34,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:34,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:34,483 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:34,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:34:34,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 01:34:34,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 01:34:34,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:34,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:34,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:34:34,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:35,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:35,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2025-03-04 01:34:35,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-04 01:34:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-04 01:34:35,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2025-03-04 01:34:35,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:35,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 41 [2025-03-04 01:34:35,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-04 01:34:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 13 proven. 692 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2025-03-04 01:34:35,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-04 01:34:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351290438] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:35,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:34:35,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 7] total 17 [2025-03-04 01:34:35,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204911092] [2025-03-04 01:34:35,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:35,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:35,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:35,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:35,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:34:35,524 INFO L87 Difference]: Start difference. First operand 1280 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:35,740 INFO L93 Difference]: Finished difference Result 2026 states and 2580 transitions. [2025-03-04 01:34:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 221 [2025-03-04 01:34:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:35,752 INFO L225 Difference]: With dead ends: 2026 [2025-03-04 01:34:35,752 INFO L226 Difference]: Without dead ends: 1439 [2025-03-04 01:34:35,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:34:35,753 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 148 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:35,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 389 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-04 01:34:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1260. [2025-03-04 01:34:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1165 states have (on average 1.226609442060086) internal successors, (1429), 1171 states have internal predecessors, (1429), 73 states have call successors, (73), 21 states have call predecessors, (73), 21 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1575 transitions. [2025-03-04 01:34:35,789 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1575 transitions. Word has length 221 [2025-03-04 01:34:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1575 transitions. [2025-03-04 01:34:35,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1575 transitions. [2025-03-04 01:34:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-04 01:34:35,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:35,792 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:35,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:34:35,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 01:34:35,993 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:35,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:35,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1679984983, now seen corresponding path program 1 times [2025-03-04 01:34:35,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:35,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373698267] [2025-03-04 01:34:35,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:35,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:36,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 01:34:36,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 01:34:36,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:36,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 41 proven. 66 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2025-03-04 01:34:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373698267] [2025-03-04 01:34:36,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373698267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:36,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692351076] [2025-03-04 01:34:36,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:36,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:36,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:36,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:36,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:34:36,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 01:34:36,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 01:34:36,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:36,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:36,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:34:36,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:36,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 717 proven. 144 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-04 01:34:36,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:37,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-04 01:34:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 41 proven. 66 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2025-03-04 01:34:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692351076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:34:37,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:34:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-03-04 01:34:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026536922] [2025-03-04 01:34:37,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:37,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:34:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:37,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:34:37,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:34:37,069 INFO L87 Difference]: Start difference. First operand 1260 states and 1575 transitions. Second operand has 17 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 8 states have call successors, (62), 4 states have call predecessors, (62), 7 states have return successors, (62), 5 states have call predecessors, (62), 8 states have call successors, (62) [2025-03-04 01:34:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:37,369 INFO L93 Difference]: Finished difference Result 2300 states and 2864 transitions. [2025-03-04 01:34:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:34:37,370 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 8 states have call successors, (62), 4 states have call predecessors, (62), 7 states have return successors, (62), 5 states have call predecessors, (62), 8 states have call successors, (62) Word has length 221 [2025-03-04 01:34:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:37,373 INFO L225 Difference]: With dead ends: 2300 [2025-03-04 01:34:37,373 INFO L226 Difference]: Without dead ends: 1218 [2025-03-04 01:34:37,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 434 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:34:37,376 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 220 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:37,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 753 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-03-04 01:34:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1194. [2025-03-04 01:34:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1090 states have (on average 1.2155963302752293) internal successors, (1325), 1096 states have internal predecessors, (1325), 73 states have call successors, (73), 30 states have call predecessors, (73), 30 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1471 transitions. [2025-03-04 01:34:37,421 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1471 transitions. Word has length 221 [2025-03-04 01:34:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:37,421 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1471 transitions. [2025-03-04 01:34:37,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 8 states have call successors, (62), 4 states have call predecessors, (62), 7 states have return successors, (62), 5 states have call predecessors, (62), 8 states have call successors, (62) [2025-03-04 01:34:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1471 transitions. [2025-03-04 01:34:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-04 01:34:37,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:37,425 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:37,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 01:34:37,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:37,626 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:37,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash 633607385, now seen corresponding path program 1 times [2025-03-04 01:34:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:37,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851176099] [2025-03-04 01:34:37,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:37,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:37,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 01:34:37,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 01:34:37,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:37,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2025-03-04 01:34:38,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851176099] [2025-03-04 01:34:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851176099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899531959] [2025-03-04 01:34:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:38,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:38,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:38,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:38,579 INFO L87 Difference]: Start difference. First operand 1194 states and 1471 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:38,963 INFO L93 Difference]: Finished difference Result 1721 states and 2150 transitions. [2025-03-04 01:34:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:38,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 221 [2025-03-04 01:34:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:38,968 INFO L225 Difference]: With dead ends: 1721 [2025-03-04 01:34:38,968 INFO L226 Difference]: Without dead ends: 1172 [2025-03-04 01:34:38,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:34:38,969 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 214 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:38,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 637 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-04 01:34:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1170. [2025-03-04 01:34:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1066 states have (on average 1.199812382739212) internal successors, (1279), 1072 states have internal predecessors, (1279), 73 states have call successors, (73), 30 states have call predecessors, (73), 30 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1425 transitions. [2025-03-04 01:34:39,011 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1425 transitions. Word has length 221 [2025-03-04 01:34:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:39,011 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1425 transitions. [2025-03-04 01:34:39,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1425 transitions. [2025-03-04 01:34:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-04 01:34:39,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:39,014 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:39,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 01:34:39,014 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:39,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1138289907, now seen corresponding path program 1 times [2025-03-04 01:34:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:39,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919302844] [2025-03-04 01:34:39,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:39,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-04 01:34:39,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-04 01:34:39,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:39,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2025-03-04 01:34:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919302844] [2025-03-04 01:34:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919302844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:39,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:39,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:34:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541609653] [2025-03-04 01:34:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:39,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:39,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:39,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:39,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:39,109 INFO L87 Difference]: Start difference. First operand 1170 states and 1425 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:39,166 INFO L93 Difference]: Finished difference Result 2372 states and 2933 transitions. [2025-03-04 01:34:39,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:34:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 223 [2025-03-04 01:34:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:39,170 INFO L225 Difference]: With dead ends: 2372 [2025-03-04 01:34:39,170 INFO L226 Difference]: Without dead ends: 1393 [2025-03-04 01:34:39,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:39,171 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 70 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:39,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-04 01:34:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1106. [2025-03-04 01:34:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1002 states have (on average 1.2055888223552895) internal successors, (1208), 1008 states have internal predecessors, (1208), 73 states have call successors, (73), 30 states have call predecessors, (73), 30 states have return successors, (73), 67 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 01:34:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1354 transitions. [2025-03-04 01:34:39,213 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1354 transitions. Word has length 223 [2025-03-04 01:34:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:39,213 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1354 transitions. [2025-03-04 01:34:39,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 01:34:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1354 transitions. [2025-03-04 01:34:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-04 01:34:39,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:39,215 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:39,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 01:34:39,216 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:39,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash 70684145, now seen corresponding path program 1 times [2025-03-04 01:34:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:39,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500351342] [2025-03-04 01:34:39,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:39,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 01:34:39,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 01:34:39,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:39,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat