./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:12:10,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:12:10,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:12:10,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:12:10,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:12:10,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:12:10,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:12:10,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:12:10,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:12:10,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:12:10,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:12:10,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:12:10,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:12:10,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:12:10,237 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:12:10,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:12:10,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:12:10,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:12:10,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:12:10,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:12:10,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:10,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:12:10,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:12:10,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:12:10,240 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2025-02-06 03:12:10,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:12:10,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:12:10,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:12:10,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:12:10,483 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:12:10,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2025-02-06 03:12:11,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2509edd65/2fc877e8d3ce4e3ba711496eb101d4f0/FLAG047eb1319 [2025-02-06 03:12:11,842 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:12:11,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2025-02-06 03:12:11,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2509edd65/2fc877e8d3ce4e3ba711496eb101d4f0/FLAG047eb1319 [2025-02-06 03:12:12,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2509edd65/2fc877e8d3ce4e3ba711496eb101d4f0 [2025-02-06 03:12:12,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:12:12,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:12:12,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:12:12,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:12:12,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:12:12,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67aa05f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12, skipping insertion in model container [2025-02-06 03:12:12,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:12:12,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2025-02-06 03:12:12,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:12:12,330 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:12:12,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2025-02-06 03:12:12,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:12:12,384 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:12:12,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12 WrapperNode [2025-02-06 03:12:12,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:12:12,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:12:12,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:12:12,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:12:12,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,419 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2025-02-06 03:12:12,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:12:12,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:12:12,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:12:12,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:12:12,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,448 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2025-02-06 03:12:12,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:12:12,467 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:12:12,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:12:12,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:12:12,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (1/1) ... [2025-02-06 03:12:12,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:12:12,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:12,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:12:12,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:12:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:12:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:12:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:12:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:12:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:12:12,600 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:12:12,601 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:12:12,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short90#1;havoc property_#t~ite101#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite98#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short141#1; [2025-02-06 03:12:12,945 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-06 03:12:12,946 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:12:12,953 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:12:12,953 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:12:12,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:12 BoogieIcfgContainer [2025-02-06 03:12:12,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:12:12,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:12:12,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:12:12,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:12:12,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:12:12" (1/3) ... [2025-02-06 03:12:12,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e0e1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:12:12, skipping insertion in model container [2025-02-06 03:12:12,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:12:12" (2/3) ... [2025-02-06 03:12:12,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e0e1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:12:12, skipping insertion in model container [2025-02-06 03:12:12,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:12:12" (3/3) ... [2025-02-06 03:12:12,959 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2025-02-06 03:12:12,969 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:12:12,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-15.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:12:13,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:12:13,016 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;@17890918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:12:13,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:12:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:12:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:12:13,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:13,028 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:13,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:13,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash -270087371, now seen corresponding path program 1 times [2025-02-06 03:12:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:13,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021545507] [2025-02-06 03:12:13,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:13,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:13,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:13,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:13,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:13,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 03:12:13,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021545507] [2025-02-06 03:12:13,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021545507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:12:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195458450] [2025-02-06 03:12:13,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:13,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:13,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:13,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:12:13,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:12:13,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:13,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:13,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:13,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:13,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:12:13,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 03:12:13,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:12:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195458450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:13,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:12:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:12:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667001520] [2025-02-06 03:12:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:13,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:12:13,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:13,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:12:13,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:12:13,565 INFO L87 Difference]: Start difference. First operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:13,585 INFO L93 Difference]: Finished difference Result 218 states and 335 transitions. [2025-02-06 03:12:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:12:13,587 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-02-06 03:12:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:13,591 INFO L225 Difference]: With dead ends: 218 [2025-02-06 03:12:13,591 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:12:13,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:12:13,597 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:13,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:12:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-06 03:12:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:12:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-02-06 03:12:13,623 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2025-02-06 03:12:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:13,623 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-02-06 03:12:13,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-02-06 03:12:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:12:13,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:13,630 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:13,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:12:13,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:12:13,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1200235572, now seen corresponding path program 1 times [2025-02-06 03:12:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936321910] [2025-02-06 03:12:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:13,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:12:13,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:12:13,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:14,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936321910] [2025-02-06 03:12:14,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936321910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:14,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:14,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:14,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796221628] [2025-02-06 03:12:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:14,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:14,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:14,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:14,346 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:14,530 INFO L93 Difference]: Finished difference Result 429 states and 623 transitions. [2025-02-06 03:12:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:12:14,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-02-06 03:12:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:14,535 INFO L225 Difference]: With dead ends: 429 [2025-02-06 03:12:14,535 INFO L226 Difference]: Without dead ends: 323 [2025-02-06 03:12:14,535 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-02-06 03:12:14,536 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 252 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:14,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1014 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-06 03:12:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 213. [2025-02-06 03:12:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.403225806451613) internal successors, (261), 186 states have internal predecessors, (261), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:12:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2025-02-06 03:12:14,568 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 115 [2025-02-06 03:12:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:14,568 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2025-02-06 03:12:14,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2025-02-06 03:12:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:12:14,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:14,569 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:14,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:12:14,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:14,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1571966134, now seen corresponding path program 1 times [2025-02-06 03:12:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020323852] [2025-02-06 03:12:14,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:12:14,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:12:14,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:14,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:15,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:15,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020323852] [2025-02-06 03:12:15,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020323852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:15,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:12:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947585868] [2025-02-06 03:12:15,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:15,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:15,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:15,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:12:15,076 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:15,164 INFO L93 Difference]: Finished difference Result 590 states and 855 transitions. [2025-02-06 03:12:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:15,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-02-06 03:12:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:15,168 INFO L225 Difference]: With dead ends: 590 [2025-02-06 03:12:15,168 INFO L226 Difference]: Without dead ends: 380 [2025-02-06 03:12:15,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:15,169 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 114 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:15,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 751 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-06 03:12:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2025-02-06 03:12:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 331 states have (on average 1.404833836858006) internal successors, (465), 333 states have internal predecessors, (465), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:12:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 545 transitions. [2025-02-06 03:12:15,202 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 545 transitions. Word has length 117 [2025-02-06 03:12:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:15,202 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 545 transitions. [2025-02-06 03:12:15,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 545 transitions. [2025-02-06 03:12:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:12:15,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:15,208 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:15,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:12:15,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:15,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash -624343642, now seen corresponding path program 1 times [2025-02-06 03:12:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:15,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64834393] [2025-02-06 03:12:15,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:15,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:12:15,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:12:15,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:15,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64834393] [2025-02-06 03:12:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64834393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:15,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:15,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:12:15,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150887380] [2025-02-06 03:12:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:15,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:12:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:15,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:12:15,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:12:15,381 INFO L87 Difference]: Start difference. First operand 376 states and 545 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:15,426 INFO L93 Difference]: Finished difference Result 753 states and 1091 transitions. [2025-02-06 03:12:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:15,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-02-06 03:12:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:15,429 INFO L225 Difference]: With dead ends: 753 [2025-02-06 03:12:15,429 INFO L226 Difference]: Without dead ends: 380 [2025-02-06 03:12:15,430 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-02-06 03:12:15,431 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 106 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:15,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 517 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-06 03:12:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2025-02-06 03:12:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 331 states have (on average 1.3987915407854985) internal successors, (463), 333 states have internal predecessors, (463), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:12:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 543 transitions. [2025-02-06 03:12:15,453 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 543 transitions. Word has length 117 [2025-02-06 03:12:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:15,453 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 543 transitions. [2025-02-06 03:12:15,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 543 transitions. [2025-02-06 03:12:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:12:15,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:15,456 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:15,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:12:15,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:15,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1857021888, now seen corresponding path program 1 times [2025-02-06 03:12:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339222315] [2025-02-06 03:12:15,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:15,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:15,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:12:15,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:12:15,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:15,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:15,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:15,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339222315] [2025-02-06 03:12:15,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339222315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:15,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:15,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:15,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479269629] [2025-02-06 03:12:15,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:15,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:15,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:15,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:15,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:15,773 INFO L87 Difference]: Start difference. First operand 376 states and 543 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:15,889 INFO L93 Difference]: Finished difference Result 770 states and 1113 transitions. [2025-02-06 03:12:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:12:15,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-02-06 03:12:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:15,892 INFO L225 Difference]: With dead ends: 770 [2025-02-06 03:12:15,892 INFO L226 Difference]: Without dead ends: 579 [2025-02-06 03:12:15,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:15,893 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 168 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:15,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 722 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-02-06 03:12:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 559. [2025-02-06 03:12:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 492 states have (on average 1.4004065040650406) internal successors, (689), 495 states have internal predecessors, (689), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:12:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 809 transitions. [2025-02-06 03:12:15,918 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 809 transitions. Word has length 118 [2025-02-06 03:12:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 809 transitions. [2025-02-06 03:12:15,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 809 transitions. [2025-02-06 03:12:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:12:15,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:15,921 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:15,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:12:15,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1448197663, now seen corresponding path program 1 times [2025-02-06 03:12:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511449666] [2025-02-06 03:12:15,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:15,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:12:15,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:12:15,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:15,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511449666] [2025-02-06 03:12:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511449666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:16,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:16,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517092830] [2025-02-06 03:12:16,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:16,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:16,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:16,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:16,354 INFO L87 Difference]: Start difference. First operand 559 states and 809 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:16,445 INFO L93 Difference]: Finished difference Result 1440 states and 2062 transitions. [2025-02-06 03:12:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-06 03:12:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:16,449 INFO L225 Difference]: With dead ends: 1440 [2025-02-06 03:12:16,449 INFO L226 Difference]: Without dead ends: 884 [2025-02-06 03:12:16,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:16,450 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 71 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:16,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 723 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-02-06 03:12:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 872. [2025-02-06 03:12:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 787 states have (on average 1.3913595933926302) internal successors, (1095), 796 states have internal predecessors, (1095), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 63 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 03:12:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1239 transitions. [2025-02-06 03:12:16,489 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1239 transitions. Word has length 118 [2025-02-06 03:12:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:16,489 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1239 transitions. [2025-02-06 03:12:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1239 transitions. [2025-02-06 03:12:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:12:16,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:16,490 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:16,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:12:16,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:16,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash 936369783, now seen corresponding path program 1 times [2025-02-06 03:12:16,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:16,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148339297] [2025-02-06 03:12:16,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:16,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:12:16,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:12:16,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:16,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:16,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:16,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148339297] [2025-02-06 03:12:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148339297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:16,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786265903] [2025-02-06 03:12:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:16,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:16,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:16,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:16,681 INFO L87 Difference]: Start difference. First operand 872 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:16,815 INFO L93 Difference]: Finished difference Result 2241 states and 3188 transitions. [2025-02-06 03:12:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-02-06 03:12:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:16,821 INFO L225 Difference]: With dead ends: 2241 [2025-02-06 03:12:16,821 INFO L226 Difference]: Without dead ends: 1372 [2025-02-06 03:12:16,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:16,823 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 146 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:16,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1102 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-02-06 03:12:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2025-02-06 03:12:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1237 states have (on average 1.3880355699272433) internal successors, (1717), 1249 states have internal predecessors, (1717), 114 states have call successors, (114), 18 states have call predecessors, (114), 18 states have return successors, (114), 102 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-06 03:12:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1945 transitions. [2025-02-06 03:12:16,882 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1945 transitions. Word has length 118 [2025-02-06 03:12:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:16,882 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1945 transitions. [2025-02-06 03:12:16,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1945 transitions. [2025-02-06 03:12:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:12:16,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:16,886 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:16,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:12:16,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:16,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:16,887 INFO L85 PathProgramCache]: Analyzing trace with hash -856794534, now seen corresponding path program 1 times [2025-02-06 03:12:16,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:16,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804676840] [2025-02-06 03:12:16,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:16,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:16,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:12:16,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:12:16,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:16,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804676840] [2025-02-06 03:12:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804676840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:17,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:17,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:17,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659704209] [2025-02-06 03:12:17,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:17,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:17,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:17,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:17,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:17,158 INFO L87 Difference]: Start difference. First operand 1370 states and 1945 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:17,277 INFO L93 Difference]: Finished difference Result 2332 states and 3283 transitions. [2025-02-06 03:12:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:17,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-06 03:12:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:17,283 INFO L225 Difference]: With dead ends: 2332 [2025-02-06 03:12:17,284 INFO L226 Difference]: Without dead ends: 1413 [2025-02-06 03:12:17,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:17,288 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 154 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:17,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 776 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-02-06 03:12:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1033. [2025-02-06 03:12:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 918 states have (on average 1.3867102396514162) internal successors, (1273), 921 states have internal predecessors, (1273), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1465 transitions. [2025-02-06 03:12:17,363 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1465 transitions. Word has length 118 [2025-02-06 03:12:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:17,364 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1465 transitions. [2025-02-06 03:12:17,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1465 transitions. [2025-02-06 03:12:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:12:17,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:17,366 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:17,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:12:17,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:17,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1880686781, now seen corresponding path program 1 times [2025-02-06 03:12:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:17,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959937197] [2025-02-06 03:12:17,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:17,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:17,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:12:17,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:12:17,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:17,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959937197] [2025-02-06 03:12:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959937197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:17,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315283102] [2025-02-06 03:12:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:17,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:17,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:17,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:17,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:17,673 INFO L87 Difference]: Start difference. First operand 1033 states and 1465 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:17,793 INFO L93 Difference]: Finished difference Result 2441 states and 3426 transitions. [2025-02-06 03:12:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:17,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-06 03:12:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:17,800 INFO L225 Difference]: With dead ends: 2441 [2025-02-06 03:12:17,800 INFO L226 Difference]: Without dead ends: 1411 [2025-02-06 03:12:17,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:17,802 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 77 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:17,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 682 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-02-06 03:12:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1029. [2025-02-06 03:12:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 914 states have (on average 1.3774617067833699) internal successors, (1259), 917 states have internal predecessors, (1259), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1451 transitions. [2025-02-06 03:12:17,864 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1451 transitions. Word has length 119 [2025-02-06 03:12:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:17,864 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1451 transitions. [2025-02-06 03:12:17,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1451 transitions. [2025-02-06 03:12:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:12:17,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:17,865 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:17,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:12:17,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:17,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1257436247, now seen corresponding path program 1 times [2025-02-06 03:12:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808592567] [2025-02-06 03:12:17,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:17,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:12:17,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:12:17,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:17,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808592567] [2025-02-06 03:12:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808592567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698152148] [2025-02-06 03:12:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:18,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:18,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:18,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:18,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:18,119 INFO L87 Difference]: Start difference. First operand 1029 states and 1451 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:18,226 INFO L93 Difference]: Finished difference Result 2125 states and 2985 transitions. [2025-02-06 03:12:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:18,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-06 03:12:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:18,230 INFO L225 Difference]: With dead ends: 2125 [2025-02-06 03:12:18,230 INFO L226 Difference]: Without dead ends: 1099 [2025-02-06 03:12:18,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:18,232 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 79 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:18,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 926 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-06 03:12:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 945. [2025-02-06 03:12:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 830 states have (on average 1.3771084337349397) internal successors, (1143), 833 states have internal predecessors, (1143), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1335 transitions. [2025-02-06 03:12:18,276 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1335 transitions. Word has length 119 [2025-02-06 03:12:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:18,276 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1335 transitions. [2025-02-06 03:12:18,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1335 transitions. [2025-02-06 03:12:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:12:18,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:18,278 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:18,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:12:18,278 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:18,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -436956178, now seen corresponding path program 1 times [2025-02-06 03:12:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:18,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355955811] [2025-02-06 03:12:18,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:18,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:12:18,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:12:18,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:18,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:18,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:18,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355955811] [2025-02-06 03:12:18,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355955811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:18,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:18,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:12:18,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501715201] [2025-02-06 03:12:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:18,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:12:18,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:18,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:12:18,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:18,572 INFO L87 Difference]: Start difference. First operand 945 states and 1335 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:18,952 INFO L93 Difference]: Finished difference Result 2020 states and 2845 transitions. [2025-02-06 03:12:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:12:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-02-06 03:12:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:18,956 INFO L225 Difference]: With dead ends: 2020 [2025-02-06 03:12:18,957 INFO L226 Difference]: Without dead ends: 1078 [2025-02-06 03:12:18,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:12:18,958 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 267 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:18,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1178 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:12:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-02-06 03:12:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 952. [2025-02-06 03:12:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 837 states have (on average 1.3751493428912784) internal successors, (1151), 840 states have internal predecessors, (1151), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1343 transitions. [2025-02-06 03:12:18,999 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1343 transitions. Word has length 119 [2025-02-06 03:12:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:19,000 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1343 transitions. [2025-02-06 03:12:19,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1343 transitions. [2025-02-06 03:12:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:12:19,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:19,001 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:19,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:12:19,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:19,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash -691692723, now seen corresponding path program 1 times [2025-02-06 03:12:19,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:19,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293539484] [2025-02-06 03:12:19,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:19,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:12:19,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:12:19,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:19,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293539484] [2025-02-06 03:12:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293539484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:19,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:19,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:12:19,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586763971] [2025-02-06 03:12:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:19,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:12:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:19,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:12:19,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:19,492 INFO L87 Difference]: Start difference. First operand 952 states and 1343 transitions. Second operand has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:12:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:19,922 INFO L93 Difference]: Finished difference Result 2077 states and 2924 transitions. [2025-02-06 03:12:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:12:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2025-02-06 03:12:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:19,927 INFO L225 Difference]: With dead ends: 2077 [2025-02-06 03:12:19,927 INFO L226 Difference]: Without dead ends: 1128 [2025-02-06 03:12:19,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:12:19,929 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 211 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:19,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1389 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:12:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-02-06 03:12:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 962. [2025-02-06 03:12:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 847 states have (on average 1.3730814639905549) internal successors, (1163), 850 states have internal predecessors, (1163), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1355 transitions. [2025-02-06 03:12:20,001 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1355 transitions. Word has length 119 [2025-02-06 03:12:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:20,001 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1355 transitions. [2025-02-06 03:12:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:12:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1355 transitions. [2025-02-06 03:12:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:12:20,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:20,003 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:20,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:12:20,003 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:20,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash 384211349, now seen corresponding path program 1 times [2025-02-06 03:12:20,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:20,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979651627] [2025-02-06 03:12:20,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:20,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:12:20,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:12:20,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:20,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:20,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979651627] [2025-02-06 03:12:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979651627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:20,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279856143] [2025-02-06 03:12:20,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:20,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:20,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:20,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:20,270 INFO L87 Difference]: Start difference. First operand 962 states and 1355 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:20,549 INFO L93 Difference]: Finished difference Result 2035 states and 2860 transitions. [2025-02-06 03:12:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2025-02-06 03:12:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:20,553 INFO L225 Difference]: With dead ends: 2035 [2025-02-06 03:12:20,553 INFO L226 Difference]: Without dead ends: 1076 [2025-02-06 03:12:20,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:12:20,555 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 364 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:20,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 901 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-02-06 03:12:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 972. [2025-02-06 03:12:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 857 states have (on average 1.3733955659276547) internal successors, (1177), 860 states have internal predecessors, (1177), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1369 transitions. [2025-02-06 03:12:20,602 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1369 transitions. Word has length 120 [2025-02-06 03:12:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:20,602 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1369 transitions. [2025-02-06 03:12:20,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1369 transitions. [2025-02-06 03:12:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:12:20,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:20,603 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:20,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:12:20,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:20,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1077313046, now seen corresponding path program 1 times [2025-02-06 03:12:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:20,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231642386] [2025-02-06 03:12:20,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:20,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:12:20,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:12:20,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:20,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:21,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231642386] [2025-02-06 03:12:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231642386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:21,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:12:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372649293] [2025-02-06 03:12:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:21,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:12:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:21,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:12:21,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:12:21,104 INFO L87 Difference]: Start difference. First operand 972 states and 1369 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:22,038 INFO L93 Difference]: Finished difference Result 2103 states and 2955 transitions. [2025-02-06 03:12:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:12:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-02-06 03:12:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:22,043 INFO L225 Difference]: With dead ends: 2103 [2025-02-06 03:12:22,043 INFO L226 Difference]: Without dead ends: 1134 [2025-02-06 03:12:22,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:12:22,045 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 354 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:22,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 2427 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:12:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-02-06 03:12:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 962. [2025-02-06 03:12:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 847 states have (on average 1.371900826446281) internal successors, (1162), 850 states have internal predecessors, (1162), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1354 transitions. [2025-02-06 03:12:22,097 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1354 transitions. Word has length 120 [2025-02-06 03:12:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:22,098 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1354 transitions. [2025-02-06 03:12:22,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1354 transitions. [2025-02-06 03:12:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:12:22,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:22,099 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:22,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:12:22,099 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:22,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1206848473, now seen corresponding path program 1 times [2025-02-06 03:12:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130394599] [2025-02-06 03:12:22,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:22,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:22,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:12:22,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:12:22,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:22,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130394599] [2025-02-06 03:12:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130394599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:23,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:23,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 03:12:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298652754] [2025-02-06 03:12:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:23,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:12:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:23,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:12:23,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:12:23,079 INFO L87 Difference]: Start difference. First operand 962 states and 1354 transitions. Second operand has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-06 03:12:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:24,729 INFO L93 Difference]: Finished difference Result 2126 states and 2980 transitions. [2025-02-06 03:12:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:12:24,732 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 121 [2025-02-06 03:12:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:24,737 INFO L225 Difference]: With dead ends: 2126 [2025-02-06 03:12:24,737 INFO L226 Difference]: Without dead ends: 1479 [2025-02-06 03:12:24,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:12:24,739 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 917 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:24,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 3048 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:12:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2025-02-06 03:12:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1004. [2025-02-06 03:12:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 889 states have (on average 1.3689538807649044) internal successors, (1217), 892 states have internal predecessors, (1217), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1409 transitions. [2025-02-06 03:12:24,806 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1409 transitions. Word has length 121 [2025-02-06 03:12:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:24,808 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1409 transitions. [2025-02-06 03:12:24,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-06 03:12:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1409 transitions. [2025-02-06 03:12:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:12:24,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:24,809 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:24,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:12:24,809 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:24,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1175828666, now seen corresponding path program 1 times [2025-02-06 03:12:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640196683] [2025-02-06 03:12:24,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:24,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:12:24,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:12:24,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:24,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:25,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640196683] [2025-02-06 03:12:25,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640196683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:25,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:12:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845188490] [2025-02-06 03:12:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:12:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:25,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:12:25,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:12:25,628 INFO L87 Difference]: Start difference. First operand 1004 states and 1409 transitions. Second operand has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-06 03:12:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:27,366 INFO L93 Difference]: Finished difference Result 2178 states and 3046 transitions. [2025-02-06 03:12:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:12:27,367 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 121 [2025-02-06 03:12:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:27,372 INFO L225 Difference]: With dead ends: 2178 [2025-02-06 03:12:27,372 INFO L226 Difference]: Without dead ends: 1489 [2025-02-06 03:12:27,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:12:27,374 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 887 mSDsluCounter, 3012 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:27,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 3364 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:12:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-02-06 03:12:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 976. [2025-02-06 03:12:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 861 states have (on average 1.3693379790940767) internal successors, (1179), 864 states have internal predecessors, (1179), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1371 transitions. [2025-02-06 03:12:27,423 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1371 transitions. Word has length 121 [2025-02-06 03:12:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:27,423 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1371 transitions. [2025-02-06 03:12:27,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-06 03:12:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1371 transitions. [2025-02-06 03:12:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:12:27,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:27,424 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:27,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:12:27,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:27,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1863048527, now seen corresponding path program 1 times [2025-02-06 03:12:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:27,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395217499] [2025-02-06 03:12:27,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:27,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:27,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:12:27,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:12:27,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:27,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:27,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:27,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395217499] [2025-02-06 03:12:27,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395217499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:27,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:27,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:12:27,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502178622] [2025-02-06 03:12:27,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:27,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:12:27,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:27,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:12:27,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:27,614 INFO L87 Difference]: Start difference. First operand 976 states and 1371 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:27,736 INFO L93 Difference]: Finished difference Result 1984 states and 2781 transitions. [2025-02-06 03:12:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:12:27,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2025-02-06 03:12:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:27,754 INFO L225 Difference]: With dead ends: 1984 [2025-02-06 03:12:27,755 INFO L226 Difference]: Without dead ends: 1011 [2025-02-06 03:12:27,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:12:27,756 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 113 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:27,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1393 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-02-06 03:12:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 995. [2025-02-06 03:12:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 880 states have (on average 1.3602272727272726) internal successors, (1197), 883 states have internal predecessors, (1197), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1389 transitions. [2025-02-06 03:12:27,802 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1389 transitions. Word has length 121 [2025-02-06 03:12:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:27,802 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1389 transitions. [2025-02-06 03:12:27,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1389 transitions. [2025-02-06 03:12:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:12:27,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:27,804 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:27,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:12:27,804 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:27,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -175007762, now seen corresponding path program 1 times [2025-02-06 03:12:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006037879] [2025-02-06 03:12:27,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:27,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:12:27,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:12:27,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:27,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006037879] [2025-02-06 03:12:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006037879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167869164] [2025-02-06 03:12:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:28,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:28,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:28,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:28,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:28,035 INFO L87 Difference]: Start difference. First operand 995 states and 1389 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:28,125 INFO L93 Difference]: Finished difference Result 2093 states and 2922 transitions. [2025-02-06 03:12:28,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:28,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-02-06 03:12:28,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:28,130 INFO L225 Difference]: With dead ends: 2093 [2025-02-06 03:12:28,130 INFO L226 Difference]: Without dead ends: 1101 [2025-02-06 03:12:28,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:28,133 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 53 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:28,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 924 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-02-06 03:12:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1008. [2025-02-06 03:12:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 893 states have (on average 1.360582306830907) internal successors, (1215), 896 states have internal predecessors, (1215), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1407 transitions. [2025-02-06 03:12:28,183 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1407 transitions. Word has length 121 [2025-02-06 03:12:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:28,183 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1407 transitions. [2025-02-06 03:12:28,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1407 transitions. [2025-02-06 03:12:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:12:28,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:28,185 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:28,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:12:28,185 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:28,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash 269267994, now seen corresponding path program 1 times [2025-02-06 03:12:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:28,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594657037] [2025-02-06 03:12:28,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:28,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:28,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:12:28,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:12:28,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:28,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:28,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:28,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594657037] [2025-02-06 03:12:28,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594657037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:28,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:12:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530634022] [2025-02-06 03:12:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:28,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:12:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:28,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:12:28,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:12:28,729 INFO L87 Difference]: Start difference. First operand 1008 states and 1407 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:12:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:29,647 INFO L93 Difference]: Finished difference Result 2099 states and 2923 transitions. [2025-02-06 03:12:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:12:29,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-02-06 03:12:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:29,653 INFO L225 Difference]: With dead ends: 2099 [2025-02-06 03:12:29,653 INFO L226 Difference]: Without dead ends: 1403 [2025-02-06 03:12:29,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:12:29,655 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 458 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:29,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1840 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:12:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-06 03:12:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1028. [2025-02-06 03:12:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 913 states have (on average 1.3581599123767798) internal successors, (1240), 916 states have internal predecessors, (1240), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1432 transitions. [2025-02-06 03:12:29,710 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1432 transitions. Word has length 122 [2025-02-06 03:12:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:29,710 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1432 transitions. [2025-02-06 03:12:29,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:12:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1432 transitions. [2025-02-06 03:12:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:12:29,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:29,712 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:29,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:12:29,712 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:29,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1230882011, now seen corresponding path program 1 times [2025-02-06 03:12:29,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:29,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495552205] [2025-02-06 03:12:29,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:29,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:29,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:12:29,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:12:29,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:29,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:30,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:30,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495552205] [2025-02-06 03:12:30,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495552205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:30,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:30,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:12:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979981343] [2025-02-06 03:12:30,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:30,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:12:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:30,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:12:30,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:12:30,581 INFO L87 Difference]: Start difference. First operand 1028 states and 1432 transitions. Second operand has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-06 03:12:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:32,240 INFO L93 Difference]: Finished difference Result 2229 states and 3089 transitions. [2025-02-06 03:12:32,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:12:32,241 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2025-02-06 03:12:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:32,246 INFO L225 Difference]: With dead ends: 2229 [2025-02-06 03:12:32,246 INFO L226 Difference]: Without dead ends: 1513 [2025-02-06 03:12:32,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:12:32,248 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1050 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:32,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 2647 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:12:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-02-06 03:12:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1010. [2025-02-06 03:12:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 895 states have (on average 1.3597765363128491) internal successors, (1217), 898 states have internal predecessors, (1217), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1409 transitions. [2025-02-06 03:12:32,303 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1409 transitions. Word has length 122 [2025-02-06 03:12:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:32,304 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1409 transitions. [2025-02-06 03:12:32,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-06 03:12:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1409 transitions. [2025-02-06 03:12:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:12:32,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:32,305 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:32,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:12:32,305 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:32,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash -142561680, now seen corresponding path program 1 times [2025-02-06 03:12:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:32,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600401587] [2025-02-06 03:12:32,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:32,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:32,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:12:32,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:12:32,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:32,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:32,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600401587] [2025-02-06 03:12:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600401587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:32,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200306798] [2025-02-06 03:12:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:32,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:32,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:32,517 INFO L87 Difference]: Start difference. First operand 1010 states and 1409 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:32,620 INFO L93 Difference]: Finished difference Result 2128 states and 2960 transitions. [2025-02-06 03:12:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:32,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-06 03:12:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:32,626 INFO L225 Difference]: With dead ends: 2128 [2025-02-06 03:12:32,626 INFO L226 Difference]: Without dead ends: 1121 [2025-02-06 03:12:32,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:32,628 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 116 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:32,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 582 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-02-06 03:12:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1016. [2025-02-06 03:12:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 901 states have (on average 1.3518312985571588) internal successors, (1218), 904 states have internal predecessors, (1218), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1410 transitions. [2025-02-06 03:12:32,681 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1410 transitions. Word has length 122 [2025-02-06 03:12:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:32,681 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1410 transitions. [2025-02-06 03:12:32,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1410 transitions. [2025-02-06 03:12:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:12:32,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:32,683 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:12:32,683 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1508171605, now seen corresponding path program 1 times [2025-02-06 03:12:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390565000] [2025-02-06 03:12:32,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:32,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:12:32,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:12:32,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:32,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:33,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390565000] [2025-02-06 03:12:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390565000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:33,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:33,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:12:33,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024691631] [2025-02-06 03:12:33,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:33,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:12:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:33,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:12:33,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:12:33,051 INFO L87 Difference]: Start difference. First operand 1016 states and 1410 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:33,361 INFO L93 Difference]: Finished difference Result 2145 states and 2971 transitions. [2025-02-06 03:12:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:12:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-02-06 03:12:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:33,368 INFO L225 Difference]: With dead ends: 2145 [2025-02-06 03:12:33,371 INFO L226 Difference]: Without dead ends: 1132 [2025-02-06 03:12:33,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:12:33,373 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 379 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:33,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1736 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-02-06 03:12:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1035. [2025-02-06 03:12:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 920 states have (on average 1.35) internal successors, (1242), 923 states have internal predecessors, (1242), 96 states have call successors, (96), 18 states have call predecessors, (96), 18 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1434 transitions. [2025-02-06 03:12:33,428 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1434 transitions. Word has length 122 [2025-02-06 03:12:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1434 transitions. [2025-02-06 03:12:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1434 transitions. [2025-02-06 03:12:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:12:33,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:33,430 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:33,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:12:33,430 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:33,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 989844332, now seen corresponding path program 1 times [2025-02-06 03:12:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:33,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515743203] [2025-02-06 03:12:33,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:33,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:12:33,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:12:33,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:33,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515743203] [2025-02-06 03:12:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515743203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:33,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:33,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:12:33,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448530409] [2025-02-06 03:12:33,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:12:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:33,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:12:33,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:33,834 INFO L87 Difference]: Start difference. First operand 1035 states and 1434 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:34,123 INFO L93 Difference]: Finished difference Result 2199 states and 3044 transitions. [2025-02-06 03:12:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-06 03:12:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:34,128 INFO L225 Difference]: With dead ends: 2199 [2025-02-06 03:12:34,128 INFO L226 Difference]: Without dead ends: 1167 [2025-02-06 03:12:34,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:12:34,130 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 438 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:34,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 989 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:12:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-02-06 03:12:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1149. [2025-02-06 03:12:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1010 states have (on average 1.3485148514851486) internal successors, (1362), 1015 states have internal predecessors, (1362), 116 states have call successors, (116), 22 states have call predecessors, (116), 22 states have return successors, (116), 111 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-06 03:12:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1594 transitions. [2025-02-06 03:12:34,187 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1594 transitions. Word has length 122 [2025-02-06 03:12:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:34,188 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1594 transitions. [2025-02-06 03:12:34,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1594 transitions. [2025-02-06 03:12:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:12:34,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:34,189 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:34,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:12:34,189 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:34,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1157371668, now seen corresponding path program 1 times [2025-02-06 03:12:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:34,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261113527] [2025-02-06 03:12:34,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:34,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:12:34,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:12:34,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:34,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261113527] [2025-02-06 03:12:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261113527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:34,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:12:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519100112] [2025-02-06 03:12:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:34,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:12:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:34,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:12:34,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:12:34,516 INFO L87 Difference]: Start difference. First operand 1149 states and 1594 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:34,913 INFO L93 Difference]: Finished difference Result 2272 states and 3140 transitions. [2025-02-06 03:12:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:12:34,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-06 03:12:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:34,922 INFO L225 Difference]: With dead ends: 2272 [2025-02-06 03:12:34,922 INFO L226 Difference]: Without dead ends: 1175 [2025-02-06 03:12:34,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:12:34,924 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 351 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:34,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1319 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:12:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-02-06 03:12:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1043. [2025-02-06 03:12:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 926 states have (on average 1.34341252699784) internal successors, (1244), 929 states have internal predecessors, (1244), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1436 transitions. [2025-02-06 03:12:34,980 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1436 transitions. Word has length 122 [2025-02-06 03:12:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:34,981 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1436 transitions. [2025-02-06 03:12:34,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1436 transitions. [2025-02-06 03:12:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:12:34,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:34,982 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:34,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:12:34,982 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:34,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1340644269, now seen corresponding path program 1 times [2025-02-06 03:12:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:34,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447065950] [2025-02-06 03:12:34,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:34,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:12:35,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:12:35,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:35,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:35,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:35,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447065950] [2025-02-06 03:12:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447065950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:35,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:35,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:12:35,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319910609] [2025-02-06 03:12:35,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:35,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:12:35,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:35,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:12:35,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:12:35,693 INFO L87 Difference]: Start difference. First operand 1043 states and 1436 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:36,284 INFO L93 Difference]: Finished difference Result 2215 states and 3048 transitions. [2025-02-06 03:12:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:12:36,285 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-06 03:12:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:36,288 INFO L225 Difference]: With dead ends: 2215 [2025-02-06 03:12:36,288 INFO L226 Difference]: Without dead ends: 1175 [2025-02-06 03:12:36,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:12:36,290 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 401 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:36,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 2515 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:12:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-02-06 03:12:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1039. [2025-02-06 03:12:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 922 states have (on average 1.341648590021692) internal successors, (1237), 925 states have internal predecessors, (1237), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1429 transitions. [2025-02-06 03:12:36,342 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1429 transitions. Word has length 122 [2025-02-06 03:12:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:36,342 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1429 transitions. [2025-02-06 03:12:36,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1429 transitions. [2025-02-06 03:12:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:12:36,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:36,345 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:36,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:12:36,345 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1066023861, now seen corresponding path program 1 times [2025-02-06 03:12:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050432241] [2025-02-06 03:12:36,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:36,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:12:36,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:12:36,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:36,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:36,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:36,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050432241] [2025-02-06 03:12:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050432241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:36,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:36,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:12:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886739476] [2025-02-06 03:12:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:36,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:12:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:36,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:12:36,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:12:36,722 INFO L87 Difference]: Start difference. First operand 1039 states and 1429 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:36,940 INFO L93 Difference]: Finished difference Result 1826 states and 2522 transitions. [2025-02-06 03:12:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:12:36,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-02-06 03:12:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:36,947 INFO L225 Difference]: With dead ends: 1826 [2025-02-06 03:12:36,947 INFO L226 Difference]: Without dead ends: 1116 [2025-02-06 03:12:36,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:12:36,948 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 52 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:36,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1652 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-02-06 03:12:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1048. [2025-02-06 03:12:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 931 states have (on average 1.3383458646616542) internal successors, (1246), 934 states have internal predecessors, (1246), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1438 transitions. [2025-02-06 03:12:37,006 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1438 transitions. Word has length 124 [2025-02-06 03:12:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:37,007 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1438 transitions. [2025-02-06 03:12:37,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1438 transitions. [2025-02-06 03:12:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:12:37,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:37,008 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:37,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:12:37,010 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:37,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash -299586064, now seen corresponding path program 1 times [2025-02-06 03:12:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:37,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145233629] [2025-02-06 03:12:37,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:37,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:12:37,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:12:37,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:37,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:37,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:37,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145233629] [2025-02-06 03:12:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145233629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:37,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:37,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400727302] [2025-02-06 03:12:37,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:37,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:37,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:37,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:37,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:37,194 INFO L87 Difference]: Start difference. First operand 1048 states and 1438 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:37,332 INFO L93 Difference]: Finished difference Result 1857 states and 2548 transitions. [2025-02-06 03:12:37,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:37,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-02-06 03:12:37,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:37,336 INFO L225 Difference]: With dead ends: 1857 [2025-02-06 03:12:37,336 INFO L226 Difference]: Without dead ends: 1138 [2025-02-06 03:12:37,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:37,337 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 55 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:37,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 883 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-02-06 03:12:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1048. [2025-02-06 03:12:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 931 states have (on average 1.335123523093448) internal successors, (1243), 934 states have internal predecessors, (1243), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1435 transitions. [2025-02-06 03:12:37,396 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1435 transitions. Word has length 124 [2025-02-06 03:12:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:37,397 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1435 transitions. [2025-02-06 03:12:37,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1435 transitions. [2025-02-06 03:12:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:12:37,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:37,398 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:37,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:12:37,398 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:37,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash -437880411, now seen corresponding path program 1 times [2025-02-06 03:12:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390122816] [2025-02-06 03:12:37,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:37,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:12:37,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:12:37,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:37,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 03:12:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390122816] [2025-02-06 03:12:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390122816] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:12:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104014004] [2025-02-06 03:12:37,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:37,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:12:37,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:12:37,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:12:37,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:12:37,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:12:37,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:12:37,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:37,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:37,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:12:37,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:12:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:37,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:12:37,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104014004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:37,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:12:37,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:12:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701198582] [2025-02-06 03:12:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:37,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:12:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:37,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:12:37,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:37,711 INFO L87 Difference]: Start difference. First operand 1048 states and 1435 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:37,779 INFO L93 Difference]: Finished difference Result 2120 states and 2903 transitions. [2025-02-06 03:12:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:12:37,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-02-06 03:12:37,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:37,785 INFO L225 Difference]: With dead ends: 2120 [2025-02-06 03:12:37,785 INFO L226 Difference]: Without dead ends: 1075 [2025-02-06 03:12:37,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:12:37,788 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:37,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:12:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-02-06 03:12:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2025-02-06 03:12:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 958 states have (on average 1.325678496868476) internal successors, (1270), 961 states have internal predecessors, (1270), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1462 transitions. [2025-02-06 03:12:37,845 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1462 transitions. Word has length 124 [2025-02-06 03:12:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:37,845 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1462 transitions. [2025-02-06 03:12:37,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:12:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1462 transitions. [2025-02-06 03:12:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:12:37,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:37,846 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:37,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:12:38,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 03:12:38,046 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:38,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash 495129480, now seen corresponding path program 1 times [2025-02-06 03:12:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:38,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477286506] [2025-02-06 03:12:38,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:38,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:12:38,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:12:38,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:38,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:38,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477286506] [2025-02-06 03:12:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477286506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:38,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568837574] [2025-02-06 03:12:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:38,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:38,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:38,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:38,270 INFO L87 Difference]: Start difference. First operand 1075 states and 1462 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:38,398 INFO L93 Difference]: Finished difference Result 2213 states and 2999 transitions. [2025-02-06 03:12:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:38,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-02-06 03:12:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:38,402 INFO L225 Difference]: With dead ends: 2213 [2025-02-06 03:12:38,402 INFO L226 Difference]: Without dead ends: 1141 [2025-02-06 03:12:38,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:38,404 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 96 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:38,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 596 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-02-06 03:12:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1054. [2025-02-06 03:12:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 937 states have (on average 1.3169690501600855) internal successors, (1234), 940 states have internal predecessors, (1234), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:12:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1426 transitions. [2025-02-06 03:12:38,458 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1426 transitions. Word has length 126 [2025-02-06 03:12:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:38,459 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1426 transitions. [2025-02-06 03:12:38,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1426 transitions. [2025-02-06 03:12:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:12:38,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:38,460 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:38,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:12:38,460 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:38,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash -461792878, now seen corresponding path program 1 times [2025-02-06 03:12:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033970115] [2025-02-06 03:12:38,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:38,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:12:38,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:12:38,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:38,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:12:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:12:38,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:12:38,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033970115] [2025-02-06 03:12:38,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033970115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:12:38,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:12:38,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:12:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418845113] [2025-02-06 03:12:38,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:12:38,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:12:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:12:38,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:12:38,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:12:38,621 INFO L87 Difference]: Start difference. First operand 1054 states and 1426 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:12:38,856 INFO L93 Difference]: Finished difference Result 2066 states and 2797 transitions. [2025-02-06 03:12:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:12:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2025-02-06 03:12:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:12:38,860 INFO L225 Difference]: With dead ends: 2066 [2025-02-06 03:12:38,860 INFO L226 Difference]: Without dead ends: 1335 [2025-02-06 03:12:38,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:12:38,862 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 94 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:12:38,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1062 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:12:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-06 03:12:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1195. [2025-02-06 03:12:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1068 states have (on average 1.3117977528089888) internal successors, (1401), 1072 states have internal predecessors, (1401), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-06 03:12:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1609 transitions. [2025-02-06 03:12:38,949 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1609 transitions. Word has length 128 [2025-02-06 03:12:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:12:38,950 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1609 transitions. [2025-02-06 03:12:38,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:12:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1609 transitions. [2025-02-06 03:12:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:12:38,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:12:38,951 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:12:38,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:12:38,951 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:12:38,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:12:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1345661585, now seen corresponding path program 1 times [2025-02-06 03:12:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:12:38,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96923729] [2025-02-06 03:12:38,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:12:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:12:38,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:12:39,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:12:39,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:12:39,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat